Sciweavers

5 search results - page 1 / 1
» Sparse Decomposition over non-full-rank dictionaries
Sort
View
ICASSP
2009
IEEE
13 years 11 months ago
Sparse Decomposition over non-full-rank dictionaries
Sparse Decomposition (SD) of a signal on an overcomplete dictionary has recently attracted a lot of interest in signal processing and statistics, because of its potential applicat...
Massoud Babaie-Zadeh, Vincent Vigneron, Christian ...
ICA
2007
Springer
13 years 10 months ago
Two Improved Sparse Decomposition Methods for Blind Source Separation
In underdetermined blind source separation problems, it is common practice to exploit the underlying sparsity of the sources for demixing. In this work, we propose two sparse decom...
B. Vikrham Gowreesunker, Ahmed H. Tewfik
ICASSP
2008
IEEE
13 years 11 months ago
Blind source separation using monochannel overcomplete dictionaries
We propose a new approach to underdetermined Blind Source Separation (BSS) using sparse decomposition over monochannel dictionary atoms and compare it to multichannel dictionary a...
B. Vikrham Gowreesunker, Ahmed H. Tewfik
TIP
2008
181views more  TIP 2008»
13 years 4 months ago
Sparse Representation for Color Image Restoration
Abstract--Sparse representations of signals have drawn considerable interest in recent years. The assumption that natural signals, such as images, admit a sparse decomposition over...
Julien Mairal, Michael Elad, Guillermo Sapiro
ICIP
2008
IEEE
14 years 6 months ago
Geometry-based distributed coding of multi-view omnidirectional images
This paper presents a distributed and occlusion-robust coding scheme for multi-view omnidirectional images, which relies on the geometry of the 3D scene. The Wyner-Ziv coder uses ...
Ivana Tosic, Pascal Frossard