Image representation by compressive sensing for visual sensor networks

被引:37
作者
Han, Bing [1 ,2 ]
Wu, Feng [2 ]
Wu, Dapeng [1 ]
机构
[1] Univ Florida, Dept Elect & Comp Engn, Gainesville, FL 32611 USA
[2] Microsoft Res Asia, Beijing 100080, Peoples R China
关键词
Image representation; Compressive sensing; Random sampling; Projection onto convex sets; Convex optimization; Image decomposition; Interpolation; Image reconstruction; RECONSTRUCTION; NEIGHBORLINESS; PROJECTIONS; POLYTOPES; DIMENSION;
D O I
10.1016/j.jvcir.2010.02.007
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper addresses the image representation problem in visual sensor networks. We propose a new image representation method for visual sensor networks based on compressive sensing (CS). CS is a new sampling method for sparse signals, which is able to compress the input data in the sampling process. Combining both signal sampling and data compression, CS is more capable of image representation for reducing the computation complexity in image/video encoder in visual sensor networks where computation resource is extremely limited. Since CS is more efficient for sparse signals, in our scheme, the input image is firstly decomposed into two components, i.e., dense and sparse components; then the dense component is encoded by the traditional approach OPEC or JPEG 2000) while the sparse component is encoded by a CS technique. In order to improve the rate distortion performance, we leverage the strong correlation between dense and sparse components by using a piecewise autoregressive model to construct a prediction of the sparse component from the corresponding dense component. Given the measurements and the prediction of the sparse component as initial guess, we use projection onto convex set (POCS) to reconstruct the sparse component. Our method considerably reduces the number of random measurements needed for CS reconstruction and the decoding computational complexity, compared to the existing CS methods. In addition, our experimental results show that our method may achieves up to 2 dB gain in PSNR over the existing CS based schemes, for the same number of measurements. (C) 2010 Elsevier Inc. All rights reserved.
引用
收藏
页码:325 / 333
页数:9
相关论文
共 54 条
[1]  
[Anonymous], P COMP IM 5 SPIE EL
[2]  
[Anonymous], P INT C DIG SIGN PRO
[3]  
[Anonymous], INT C INF PROC SENS
[4]  
[Anonymous], 200618 STANF U DEP S
[5]  
[Anonymous], 2006, P COMP IM 4 SPIE EL
[6]  
[Anonymous], P 44 ANN ALL C COMM
[7]  
[Anonymous], P IEEE DALL CIRC SYS
[8]  
BARANIUK R, 2007, RANDOM PROJECTIONS S
[9]   A Simple Proof of the Restricted Isometry Property for Random Matrices [J].
Baraniuk, Richard ;
Davenport, Mark ;
DeVore, Ronald ;
Wakin, Michael .
CONSTRUCTIVE APPROXIMATION, 2008, 28 (03) :253-263
[10]  
BLUMENSATH T, 2007, GRADIENT PURSU UNPUB