Loading...

Fast sparse representation based on smoothed ℓ0norm

Mohimani, G. H ; Sharif University of Technology | 2007

174 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-540-74494-8_49
  3. Publisher: Springer Verlag , 2007
  4. Abstract:
  5. In this paper, a new algorithm for Sparse Component Analysis (SCA) or atomic decomposition on over-complete dictionaries is presented. The algorithm is essentially a method for obtaining sufficiently sparse solutions of underdetermined systems of linear equations. The solution obtained by the proposed algorithm is compared with the minimum ℓ1-norm solution achieved by Linear Programming (LP). It is experimentally shown that the proposed algorithm is about two orders of magnitude faster than the state-of-the-art ℓ1-magic, while providing the same (or better) accuracy. © Springer-Verlag Berlin Heidelberg 2007
  6. Keywords:
  7. Algorithms ; Linear equations ; Linear programming ; Problem solving ; Over complete atomic decomposition ; Sparse component analysis ; Independent component analysis
  8. Source: 7th International Conference on Independent Component Analysis (ICA) and Source Separation, ICA 2007, London, 9 September 2007 through 12 September 2007 ; Volume 4666 LNCS , 2007 , Pages 389-396 ; 03029743 (ISSN); 9783540744931 (ISBN)
  9. URL: https://link.springer.com/chapter/10.1007/978-3-540-74494-8_49