Sciweavers

2295 search results - page 26 / 459
» Learning Overcomplete Representations
Sort
View
ACCV
2007
Springer
14 years 2 months ago
Flea, Do You Remember Me?
The ability to detect and recognize individuals is essential for an autonomous robot interacting with humans even if computational resources are usually rather limited. In general ...
Michael Grabner, Helmut Grabner, Joachim Pehserl, ...
ICA
2007
Springer
14 years 2 months ago
Morphological Diversity and Sparsity in Blind Source Separation
This paper describes a new blind source separation method for instantaneous linear mixtures. This new method coined GMCA (Generalized Morphological Component Analysis) relies on mo...
Jérôme Bobin, Yassir Moudden, Jalal F...
TASLP
2008
82views more  TASLP 2008»
13 years 8 months ago
Union of MDCT Bases for Audio Coding
This paper investigates the use of sparse overcomplete decompositions for audio coding. Audio signals are decomposed over a redundant union of modified discrete cosine transform (M...
Emmanuel Ravelli, Gaël Richard, Laurent Daude...
TIP
2008
128views more  TIP 2008»
13 years 8 months ago
The Pairing of a Wavelet Basis With a Mildly Redundant Analysis via Subband Regression
A distinction is usually made between wavelet bases and wavelet frames. The former are associated with a one-to-one representation of signals, which is somewhat constrained but mos...
Michael Unser, Dimitri Van De Ville
INTERSPEECH
2010
13 years 3 months ago
Towards a robust face recognition system using compressive sensing
An application of compressive sensing (CS) theory in imagebased robust face recognition is considered. Most contemporary face recognition systems suffer from limited abilities to ...
Allen Y. Yang, Zihan Zhou, Yi Ma, Shankar Sastry