Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

An approximate L0 norm minimization algorithm for compressed sensing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hyder, M. ; Sch. of Electr. Eng. & Comput. Sci., Univ. of Newcastle, Callaghan, NSW ; Mahata, K.

lscr0 Norm based signal recovery is attractive in compressed sensing as it can facilitate exact recovery of sparse signal with very high probability. Unfortunately, direct lscr0 norm minimization problem is NP-hard. This paper describes an approximate lscr0 norm algorithm for sparse representation which preserves most of the advantages of lscr0 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 high dimensional signal.

Published in:

Acoustics, Speech and Signal Processing, 2009. ICASSP 2009. IEEE International Conference on

Date of Conference:

19-24 April 2009