Sciweavers

1582 search results - page 67 / 317
» On sparse signal representations
Sort
View
ICANNGA
2007
Springer
191views Algorithms» more  ICANNGA 2007»
15 years 6 months ago
Novel Multi-layer Non-negative Tensor Factorization with Sparsity Constraints
In this paper we present a new method of 3D non-negative tensor factorization (NTF) that is robust in the presence of noise and has many potential applications, including multi-way...
Andrzej Cichocki, Rafal Zdunek, Seungjin Choi, Rob...
ICASSP
2008
IEEE
15 years 6 months ago
Unsupervised learning of auditory filter banks using non-negative matrix factorisation
Non-negative matrix factorisation (NMF) is an unsupervised learning technique that decomposes a non-negative data matrix into a product of two lower rank non-negative matrices. Th...
Alexander Bertrand, Kris Demuynck, Veronique Stout...
ICASSP
2010
IEEE
15 years 2 days ago
Ultrasound tomography with learned dictionaries
We propose a new method for imaging sound speed in breast tissue from measurements obtained by ultrasound tomography (UST) scanners. Given the measurements, our algorithm finds a...
Ivana Tosic, Ivana Jovanovic, Pascal Frossard, Mar...
ICASSP
2011
IEEE
14 years 3 months ago
A-Functions: A generalization of Extended Baum-Welch transformations to convex optimization
We introduce the Line Search A-Function (LSAF) technique that generalizes the Extended-Baum Welch technique in order to provide an effective optimization technique for a broader s...
Dimitri Kanevsky, David Nahamoo, Tara N. Sainath, ...
STOC
2012
ACM
192views Algorithms» more  STOC 2012»
13 years 2 months ago
Nearly optimal sparse fourier transform
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
Haitham Hassanieh, Piotr Indyk, Dina Katabi, Eric ...