Loading...

A first step to convolutive sparse representation

Firouzi, H ; Sharif University of Technology | 2008

322 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/ICASSP.2008.4518011
  3. Publisher: 2008
  4. Abstract:
  5. In this paper an extension of the sparse decomposition problem is considered and an algorithm for solving it is presented. In this extension, it is known that one of the shifted versions of a signal s (not necessarily the original signal itself) has a sparse representation on an overcomplete dictionary, and we are looking for the sparsest representation among the representations of all the shifted versions of s. Then, the proposed algorithm finds simultaneously the amount of the required shift, and the sparse representation. Experimental results emphasize on the performance of our algorithm. ©2008 IEEE
  6. Keywords:
  7. Acoustics ; Signal processing ; Atomic decomposition ; Overcomplete signal representation ; Sparse decomposition ; Sparse representation ; Sparse source separation ; Boolean functions
  8. Source: 2008 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP, Las Vegas, NV, 31 March 2008 through 4 April 2008 ; 2008 , Pages 1921-1924 ; 15206149 (ISSN) ; 1424414849 (ISBN); 9781424414840 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/4518011