By Topic

Compressive color imaging with group-sparsity on analysis prior

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)
Majumdar, A. ; Dept. of Electr. & Comput. Eng., Univ. of British Columbia, Vancouver, BC, Canada ; Ward, R.K.

Compressed sensing (CS) of color images can be formulated as a group-sparsity promoting inverse problem. In the past, group-sparsity constraint was imposed on the CS synthesis prior formulation with an orthogonal transform to solve the inverse problem. The objective of this work is to empirically show that better results can be obtained if a group-sparsity constraint is imposed on the CS analysis prior formulation with a redundant transform. This problem requires solving a group-sparsity promoting inverse problem which has not been addressed earlier. Therefore we derive a new algorithm for solving it based on the Majorization-Minimization approach. Experimental results corroborate that analysis prior with a redundant transform gives far superior (about 1.5dB) improvement compared to synthesis prior with orthogonal transform.

Published in:

Image Processing (ICIP), 2010 17th IEEE International Conference on

Date of Conference:

26-29 Sept. 2010