Image representation by compressive sensing for visual sensor networks

Journal of Visual Communication and Image Representation

Volumn 21, Issue 4, 2010, Pages 325-333

  Han, Bing ^a   Wu, Feng ^b   Wu, Dapeng ^a  

^a University of Florida   (United States)

^b MICROSOFT RESEARCH ASIA   (China)

Author keywords

Compressive sensing; Convex optimization; Image decomposition; Image reconstruction; Image representation; Interpolation; Projection onto convex sets; Random sampling

Indexed keywords

COMPRESSIVE SENSING; IMAGE DECOMPOSITION; IMAGE REPRESENTATIONS; PROJECTION ONTO CONVEX SETS; RANDOM SAMPLING;

COMPUTATIONAL COMPLEXITY; DATA COMPRESSION; IMAGE CODING; IMAGE RECONSTRUCTION; INTERPOLATION; OPTIMIZATION; REPAIR; SENSOR NETWORKS; SET THEORY;

CONVEX OPTIMIZATION;

EID: 78049236920     PISSN: 10473203     EISSN: 10959076     Source Type: Journal    
DOI: 10.1016/j.jvcir.2010.02.007     Document Type: Article

References (54)

1. A.J. Jerri The Shannon sampling theorem - its various extensions and applications: a tutorial review Proc. IEEE 65 1977 1565 1596
2. E. Cands, J. Romberg, and T. Tao Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information IEEE Trans. Inf. Theory 52 2006 489 509
3. D. Donoho Compressed sensing IEEE Trans. Inf. Theory 52 2006 1289 1306
4. E. Cands Compressive sampling Proc. International Congress of Mathematics vol. 3 2006 Madrid Spain 1433 1452
5. D. Donoho, and Y. Tsaig Extensions of compressed sensing Signal Process. 86 2006 533 548
6. R. Baraniuk, M. Davenport, R. DeVore, and M. Wakin A simple proof of the restricted isometry property for random matrices Constr. Approx. 28 3 2008 253 263
7. M. Elad Optimized projections for compressed sensing IEEE Trans. Signal Process. 55 2007 5695 5702
8. E. Cands, and T. Tao Near optimal signal recovery from random projections: universal encoding strategies IEEE Trans. Inf. Theory 52 2006 5406 5425
9. E. Cands, J. Romberg, Practical signal recovery from random projections, in: Wavelet Applications in Signal and Image Processing XI, Proc. SPIE Conf., 2004, pp. 5914.
10. A. Cohen, W. Dahmen, and R. DeVore Compressed sensing and best k-term approximation Amer. Math. Soc. 22 1 2009 211 231
11. G. Peyré Best basis compressed sensing Scale Space and Variational Methods in Computer Vision vol. 4485 2007 Springer Berlin/Heidelberg 80 91
12. H. Rauhut, K. Schass, and P. Vandergheynst Compressed sensing and redundant dictionaries IEEE Trans. Inform. Theory 54 5 2008 2210 2219
13. J. Tropp, A. Gilbert, Signal recovery from partial information via orthogonal matching pursuit, in preparation, 2005.
14. M. Duarte, M. Wakin, R. Baraniuk, Fast reconstruction of piecewise smooth signals from random projections, in: Proc. SPARS Workshop, November 2005.
15. C. La, M. Do, Signal reconstruction using sparse tree representations, in: Proc. SPIE Wavelets XI, San Diego, California, September 2005.
16. W. Bajwa, J. Haupt, A. Sayeed, R. Nowak, Compressive wireless sensing, in: Int. Conf. on Information Processing in Sensor Networks (IPSN), Nashville, Tennessee, April 2006.
17. S. Sarvotham, D. Baron, R. Baraniuk, Sudocodes - fast measurement and reconstruction of sparse signals, in: Proc. IEEE Int. Symposium on Information Theory, Seattle, Washington, July 2006.
18. D. Donoho, Y. Tsaig, Fast solution of ell-1-norm minimization problems when the solution may be sparse, Stanford University Department of Statistics Technical Report 2006-18, 2006.
19. S. Kim, K. Koh, M. Lustig, S. Boyd, D. Gorinevsky, A method for large-scale ell-1-regularized least squares problems with applications in signal processing and statistics, in preparation, 2007.
20. T. Blumensath, M.E. Davies, Iterative thresholding for sparse approximations, The Journal of Fourier Analysis and Applications, accepted for publication.
21. T. Blumensath, M.E. Davies, Gradient pursuits, in preparation, 2007.
22. M.A.T. Figueiredo, R.D. Nowak, and S.J. Wright Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems IEEE J. Selected Topics Signal Process. 1 4 2007 586 597
23. E. Cands, and T. Tao Decoding by linear programming IEEE Trans. Inf. Theory 51 12 2005 4203 4215
24. S. Sarvotham, D. Baron, R. Baraniuk, Measurements vs. bits: compressed sensing meets information theory, in: Proc. Allerton Conference on Communication, Control, and Computing, Monticello, IL, September 2006.
25. M. Wainwright, Information-theoretic bounds on sparsity recovery in the high-dimensional and noisy setting, in: Proc. IEEE Int. Symposium on Information Theory, Nice, France, June 2007.
26. D. Donoho High-dimensional centrally-symmetric polytopes with neighborliness proportional to dimension Disc. Comput. Geometry 35 4 2006 617 652
27. D. Donoho, J. Tanner, Neighborliness of randomly-projected simplices in high dimensions, in: Proc. National Academy of Sciences, vol. 102 (27), 2005, pp. 9452-9457.
28. D. Donoho, and J. Tanner Counting faces of randomly-projected polytopes when the projection radically lowers dimension Amer. Math. Soc. 22 1 2009 1 53
29. R. Baraniuk, and M. Wakin Random Projections of Smooth Manifolds. Foundations of Computational Mathematics 2007 Springer New York December
30. J. Haupt, R. Castro, R. Nowak, G. Fudge, A. Yeh, Compressive sampling for signal classification, in: Proc. Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, California, October 2006.
31. M. Davenport, M. Duarte, M. Wakin, J. Laska, D. Takhar, K. Kelly, R. Baraniuk, The smashed filter for compressive classification and target recognition, in: Proc. of Computational Imaging V at SPIE Electronic Imaging, San Jose, California, January 2007.
32. M. Duarte, M. Davenport, M. Wakin, R. Baraniuk, Sparse signal detection from incoherent projections, in: Proc. IEEE Int. Conf. on Acoustics, Speech, and Signal Processing, Toulouse, France, May 2006.
33. A. Gilbert, M. Strauss, J. Tropp, R. Vershynin, Algorithmic linear dimension reduction in the ell-1 norm for sparse vectors, in: Proc. of the 44th Annual Allerton Conference on Communication, Control and Computing, Allerton, September 2006.
34. A. Gilbert, M. Strauss, J. Tropp, R. Vershynin, One sketch for all: fast algorithms for compressed sensing, in: Proceedings of the Thirty-ninth Annual ACM Symposium on theory of Computing (San Diego, California, USA, June 11-13, 2007). STOC '07. ACM, New York, NY, pp. 237-246.
35. S. Muthukrishnan Some algorithmic problems and results in compressed sensing 44th Annual Allerton Conference, September, 2006 2006 Allerton House Illinois
36. M. Wakin, J. Laska, M. Duarte, D. Baron, S. Sarvotham, D. Takhar, K. Kelly, R. Baraniuk, An architecture for compressive imaging, in: Proc. Int. Conf. on Image Processing, Atlanta, Georgia, October 2006.
37. D. Takhar, J. Laska, M. Wakin, M. Duarte, D. Baron, S. Sarvotham, K. Kelly, R. Baraniuk, A new compressive imaging camera architecture using optical-domain compression, in: Proc. of Computational Imaging IV at SPIE Electronic Imaging, San Jose, California, January 2006.
38. L. Gan, Block compressed sensing of natural images, in: Proc. Int. Conf. on Digital Signal Processing, Cardiff, UK, July 2007.
39. M. Lustig, D. Donoho, and J.M. Pauly Sparse MRI: the application of compressed sensing for rapid MR imaging Magn. Reson. Med. 58 2007 1182 1195
40. M. Lustig, J.M. Santos, D. Donoho, J.M. Pauly, k-t SPARSE: high frame rate dynamic MRI exploiting spatio-temporal sparsity, in: Proc. 14th. Annual Meeting of ISMRM, Seattle, Washington, May 2006.
41. H. Jung, J.C. Ye, and E.Y. Kim Improved k-t BLASK and k-t SENSE using FOCUSS Phys Med. Biol. 52 2007 3201 3226
42. J.C. Ye Compressed sensing shape estimation of star-shaped objects in Fourier imaging Signal Process. Lett. IEEE 14 10 2007 750 753
43. M. Rabbat, J. Haupt, A. Singh, R. Nowak, Decentralized compression and predistribution via randomized gossiping, in: Proc. Int. Conf. on Information Processing in Sensor Networks Nashville, Tennessee, April 2006.
44. W. Wang, M. Garofalakis, K. Ramchandran, Distributed sparse random projections for refinable approximation, in: Proc. Int. Conf. on Information Processing in Sensor Networks, Cambridge, Massachusetts, April 2007.
45. S. Kirolos, J. Laska, M. Wakin, M. Duarte, D. Baron, T. Ragheb, Y. Massoud, R. Baraniuk, Analog-to-information conversion via random demodulation, in: Proc. IEEE Dallas Circuits and Systems Workshop, Dallas, Texas, 2006.
46. J. Laska, S. Kirolos, Y. Massoud, R. Baraniuk, A. Gilbert, M. Iwen, M. Strauss, Random sampling for analog-to-information conversion of wideband signals, in: Proc. IEEE Dallas Circuits and Systems Workshop, Dallas, Texas, 2006.
47. J. Laska, S. Kirolos, M. Duarte, T. Ragheb, R. Baraniuk, Y. Massoud, Theory and implementation of an analog-to-information converter using random demodulation, in: Proc. IEEE Int. Symp. on Circuits and Systems, New Orleans, Louisiana, 2007.
48. T. Ragheb, S. Kirolos, J. Laska, A. Gilbert, M. Strauss, R Baraniuk, Y. Massoud, Implementation models for analog-to-information conversion via random sampling, in: 50th IEEE Int'l Midwest Symposium on Circuits and Systems/5th IEEE Int'l Northeast Workshop on Circuits and Systems (MWSCAS/NEWCAS), August 2007.
49. M. Sheikh, O. Milenkovic, R. Baraniuk, Compressed sensing DNA microarrays, in: Rice ECE Department Technical Report TREE 0706, May 2007.
50. J.L. Starch, M. Elad, and D. Donoho Image decomposition via the combination of sparse representations and a variational approach IEEE Trans. Image Process. 14 10 2005 1570 1582
51. M. Elad, and A.M. Bruckstein A generalized uncertainty principle and sparse representation in pairs of bases IEEE Trans. Inf. Theory 48 2002 2558 2567
52. S. Mallat A Wavelet Tour of Signal Processing 1999 Academic Press
53. X. Zhang, X. Wu, F. Wu, Image Coding on Quincunx Lattice with Adaptive Lifting and Interpolation, in: Data Compression Conference, 2007, pp. 193-202.
54. L.M. Bregman The method of successive projection for finding a common point of convex sets Soviet Math. Dokl. 6 1965 688 692