Decentralized compression and predistribution via randomized gossiping
Proceedings of the 5th international conference on Information processing in sensor networks
Proceedings of the 5th international conference on Information processing in sensor networks
Extensions of compressed sensing
Signal Processing - Sparse approximations in signal and image processing
Distributed sparse random projections for refinable approximation
Proceedings of the 6th international conference on Information processing in sensor networks
One sketch for all: fast algorithms for compressed sensing
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Image Coding on Quincunx Lattice with Adaptive Lifting and Interpolation
DCC '07 Proceedings of the 2007 Data Compression Conference
Random Projections of Smooth Manifolds
Foundations of Computational Mathematics
SSVM'07 Proceedings of the 1st international conference on Scale space and variational methods in computer vision
Optimized Projections for Compressed Sensing
IEEE Transactions on Signal Processing
A generalized uncertainty principle and sparse representation in pairs of bases
IEEE Transactions on Information Theory
Decoding by linear programming
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
IEEE Transactions on Information Theory
Compressed Sensing and Redundant Dictionaries
IEEE Transactions on Information Theory
Image decomposition via the combination of sparse representations and a variational approach
IEEE Transactions on Image Processing
Block-Based Compressed Sensing of Images and Video
Foundations and Trends in Signal Processing
Image representation using block compressive sensing for compression applications
Journal of Visual Communication and Image Representation
Hi-index | 0.00 |
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 (JPEG 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 2dB gain in PSNR over the existing CS based schemes, for the same number of measurements.