Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Sparsity estimation in image compressive 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

4 Author(s)
Shanzhen Lan ; Inf. Eng. Sch., Commun. Univ. of China, Beijing, China ; Qi Zhang ; Xinggong Zhang ; Zongming Guo

Compressive sensing is an emerging technology which can recover a K-sparse signal vector from M = O(Klog(K=N)) measurements. However, it is a challenge to know exactly how many measurements an image requires to achieve an acceptable recovered visual quality. In this paper, we study the relationship between the image's complexity and its sparsity. We propose a mathematical model to estimate the number of needed measurements by using the image's texture, the edge density and the target reconstruction quality. There exists a linear function between them. The experimental results with a large number of photo pictures show that, quite most reconstructed images using our pre-calculated number of measurements have good enough quality, which confirms our proposed image-complexity-based model well.

Published in:

Circuits and Systems (ISCAS), 2012 IEEE International Symposium on

Date of Conference:

20-23 May 2012