An approximate L0 norm minimization algorithm for compressed sensing

  • Authors:
  • Mashud Hyder;Kaushik Mahata

  • Affiliations:
  • School of Electrical Engineering and Computer Science, University of Newcastle, Callaghan, NSW 2308, Australia;School of Electrical Engineering and Computer Science, University of Newcastle, Callaghan, NSW 2308, Australia

  • Venue:
  • ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

ℓ0 norm based signal recovery is attractive in compressed sensing as it can facilitate exact recovery of sparse signal with very high probability. Unfortunately, direct ℓ0 norm minimization problem is NP-hard. This paper describes an approximate ℓ0 norm algorithm for sparse representation which preserves most of the advantages of ℓ0 norm. The algorithm shows attractive convergence properties, and provides remarkable performance improvement in noisy environment compared to other popular algorithms. The sparse representation algorithm presented is capable of very fast signal recovery, thereby reducing retrieval latency when handling