By Topic

Algorithms to Approximately Solve NP Hard Row-Sparse MMV Recovery Problem: Application to Compressive Color Imaging

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
$33 $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

3 Author(s)
Angshul Majumdar ; Department of Electrical and Computer Engineering, University of British Columbia, Vancouver, Canada ; Rabab K. Ward ; Tyseer Aboulnasr

This paper addresses the row-sparse multiple measurement vector (MMV) recovery problem. This requires solving a nondeterministic polynomial (NP) hard optimization. Instead of approximating the NP hard problem by its convex/nonconvex surrogates as is done in other studies, we propose techniques to directly solve the NP hard problem approximately with tractable algorithms. The algorithms derived in here yields better recovery rates than the state-of-the-art convex (spectral projected gradient) algorithm we compared against. We show that the compressive color image reconstruction can be formulated as an MMV recovery problem with sparse rows and therefore can be solved by our proposed method. The reconstructed images are more accurate (improvement about 2 dB in peak signal-to-noise ratio) than the previous technique compared against.

Published in:

IEEE Journal on Emerging and Selected Topics in Circuits and Systems  (Volume:2 ,  Issue: 3 )