Sparse Decomposition of Two Dimensional Signals

Abstract : In this paper, we consider sparse decomposition (SD) of twodimensional (2D) signals on overcomplete dictionaries with separable atoms. Although, this problem can be solved by converting it to the SD of one-dimensional (1D) signals, this approach requires a tremendous amount of memory and computational cost. Moreover, the uniqueness constraint obtained by this approach is too restricted. Then in the paper, we present an algorithm to be used directly for sparse decomposition of 2D signals on dictionaries with separable atoms. Moreover, we will state another uniqueness constraint for this class of decomposition. Our algorithm is obtained by modifying the Smoothed L0 (SL0) algorithm, and hence we call it two-dimensional SL0 (2D-SL0).
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download
Contributor : Christian Jutten <>
Submitted on : Tuesday, June 30, 2009 - 6:39:32 PM
Last modification on : Tuesday, July 9, 2019 - 1:21:25 AM
Long-term archiving on : Tuesday, June 15, 2010 - 7:10:44 PM


Publisher files allowed on an open archive


  • HAL Id : hal-00400464, version 1


A. Ghafari, Massoud Babaie-Zadeh, Christian Jutten. Sparse Decomposition of Two Dimensional Signals. IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2009, Apr 2009, Taipei, Taiwan. pp.3157-3160. ⟨hal-00400464⟩



Record views


Files downloads