TY - GEN
T1 - Image representation by compressed sensing
AU - Han, Bing
AU - Wu, Feng
AU - Wu, Dapeng
N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].
PY - 2008
Y1 - 2008
N2 - This paper addresses the image representation problem in visual sensor networks. We propose a new image representation scheme based on compressive sensing (CS) because compressive sensing is capable of reducing computational complexity of an image/video encoder. In our scheme, the encoder first decomposes the input image into two components, i.e., dense and sparse components; then the dense component is encoded by the traditional approach while the sparse component is encoded by a CS technique. To improve the rate distortion performance, we leverage the strong correlation between dense and sparse components. Given the measurements and the prediction of the sparse component, we use projection onto convex set (POCS) to reconstruct the sparse component. Our method considerably reduces the number of random measurements needed and decoding computational complexity, compared to the existing CS methods. © 2008 IEEE.
AB - This paper addresses the image representation problem in visual sensor networks. We propose a new image representation scheme based on compressive sensing (CS) because compressive sensing is capable of reducing computational complexity of an image/video encoder. In our scheme, the encoder first decomposes the input image into two components, i.e., dense and sparse components; then the dense component is encoded by the traditional approach while the sparse component is encoded by a CS technique. To improve the rate distortion performance, we leverage the strong correlation between dense and sparse components. Given the measurements and the prediction of the sparse component, we use projection onto convex set (POCS) to reconstruct the sparse component. Our method considerably reduces the number of random measurements needed and decoding computational complexity, compared to the existing CS methods. © 2008 IEEE.
KW - Compressed sensing
KW - Convex optimization
KW - Image representation
KW - Random sampling
UR - http://www.scopus.com/inward/record.url?scp=69949114065&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-69949114065&origin=recordpage
U2 - 10.1109/ICIP.2008.4712012
DO - 10.1109/ICIP.2008.4712012
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 1424417643
SN - 9781424417643
T3 - Proceedings - International Conference on Image Processing, ICIP
SP - 1344
EP - 1347
BT - 2008 IEEE International Conference on Image Processing, ICIP 2008 Proceedings
T2 - 2008 IEEE International Conference on Image Processing, ICIP 2008
Y2 - 12 October 2008 through 15 October 2008
ER -