Loading...

Fast block-sparse decomposition based on SL0

Hamidi Ghalehjegh, S ; Sharif University of Technology | 2010

790 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-642-15995-4_53
  3. Publisher: 2010
  4. Abstract:
  5. In this paper we present a new algorithm based on Smoothed ℓ0 (SL0), called Block SL0 (BSL0), for Under-determined Systems of Linear Equations (USLE) in which the nonzero elements of the unknown vector occur in clusters. Contrary to the previous algorithms such as Block Orthogonal Matching Pursuit (BOMP) and mixed ℓ2/ℓ1 norm, our approach provides a fast algorithm, while providing the same (or better) accuracy. Moreover, we will see experimentally that BSL0 has better performance than SL0, BOMP and mixed ℓ2/ℓ1 norm when the number of nonzero elements of the source vector approaches the upper bound of uniqueness theorem
  6. Keywords:
  7. Under-determined Systems of Linear Equations ; Block-Sparsity ; Fast algorithms ; Orthogonal matching pursuit ; SL0 Algorithm ; Sparse decomposition ; Systems of linear equations ; Under-determined ; Uniqueness theorem ; Upper Bound ; Linear equations ; Algorithms
  8. Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 27 September 2010 through 30 September 2010 ; Volume 6365 LNCS , September , 2010 , Pages 426-433 ; 03029743 (ISSN) ; 9783642159947 (ISBN)
  9. URL: http://link.springer.com/chapter/10.1007%2F978-3-642-15995-4_53