Sciweavers

374 search results - page 2 / 75
» Fast separable factorization and applications
Sort
View
ICASSP
2011
IEEE
12 years 9 months ago
A fast transform for acoustic imaging with separable arrays
Acoustic imaging is a computationally intensive and ill-conditioned inverse problem, which involves estimating high resolution source distributions with large microphone arrays. I...
Flavio P. Ribeiro, Vitor H. Nascimento
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 2 months ago
Fast Approximation Algorithms for Cut-based Problems in Undirected Graphs
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
Aleksander Madry
ICASSP
2010
IEEE
13 years 3 months ago
A sparse component model of source signals and its application to blind source separation
In this paper, we propose a new method of blind source separation (BSS) for music signals. Our method has the following characteristics: 1) the method is a combination of the spar...
Yu Kitano, Hirokazu Kameoka, Yosuke Izumi, Nobutak...
ICASSP
2009
IEEE
14 years 17 hour ago
A fast asymptotically efficient algorithm for blind separation of a linear mixture of block-wise stationary autoregressive proce
We propose a novel blind source separation algorithm called Block AutoRegressive Blind Identification (BARBI). The algorithm is asymptotically efficient in separation of instant...
Petr Tichavský, Arie Yeredor, Zbynek Koldov...
NIPS
2003
13 years 6 months ago
Sparse Representation and Its Applications in Blind Source Separation
In this paper, sparse representation (factorization) of a data matrix is first discussed. An overcomplete basis matrix is estimated by using the K−means method. We have proved ...
Yuanqing Li, Andrzej Cichocki, Shun-ichi Amari, Se...