Sparse Decomposition Over Non-Full-Rank Dictionaries

Massoud Babaie-Zadeh 1 Vincent Vigneron 2 Christian Jutten 3
2 SIBI
IBISC - Informatique, Biologie Intégrative et Systèmes Complexes
3 GIPSA-SIGMAPHY - SIGMAPHY
GIPSA-DIS - Département Images et Signal
Abstract : 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 application in many different areas including Compressive Sensing (CS). However, in the current literature, the dictionary matrix has generally been assumed to be of full-rank. In this paper, we consider non-full-rank dictionaries (which are not even necessarily overcomplete), and extend the definition of SD over these dictionaries. Moreover, we present an approach which enables to use previously developed SD algorithms for this non-full-rank case. Besides this general approach, for the special case of the Smoothed L0-norm (SL0) algorithm, we show that a slight modification of it covers automatically non-full-rank dictionaries.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00400474
Contributor : Christian Jutten <>
Submitted on : Tuesday, June 30, 2009 - 6:53:47 PM
Last modification on : Tuesday, July 9, 2019 - 1:21:25 AM
Long-term archiving on : Tuesday, June 15, 2010 - 7:10:47 PM

File

ICASSP2009_NonFullRankSD_Babai...
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-00400474, version 1

Citation

Massoud Babaie-Zadeh, Vincent Vigneron, Christian Jutten. Sparse Decomposition Over Non-Full-Rank Dictionaries. IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2009, Apr 2009, Taipei, Taiwan. pp.2953-2956. ⟨hal-00400474⟩

Share

Metrics

Record views

461

Files downloads

187