Compressive sensing with local geometric features Citation

We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ R be an N -pixel image, where each pixel p has value xp. The image is acquired by computing the measurement vector Ax, where A is an m×N measurement matrix for some m N . The goal is then to design the matrix A and recovery algorithm which, given Ax, returns an approximation to x. In this paper we investigate this problem for the case where x consists of a small number (k) of “local geometric objects” (e.g., stars in an image of a sky), plus noise. We construct a matrix A and recovery algorithm with the following features: (i) the number of measurements m is O(k logk N), which undercuts currently known schemes that achieve m = O(k log(N/k)) (ii) the matrix A is ultra-sparse, which is important for hardware considerations (iii) the recovery algorithm is fast and runs in time sub-linear in N . We also present a comprehensive study of an application of our algorithm to a problem in satellite navigation.

[1]  Amit Ashok,et al.  Increased field of view through optical multiplexing. , 2010, Optics express.

[2]  Laurent Jacques,et al.  A (256×256) pixel 76.7mW CMOS imager/ compressor based on real-time In-pixel compressive sensing , 2010, Proceedings of 2010 IEEE International Symposium on Circuits and Systems.

[3]  Piotr Indyk,et al.  Sparse Recovery Using Sparse Matrices , 2010, Proceedings of the IEEE.

[4]  Holger Rauhut,et al.  The Gelfand widths of lp-balls for 0p<=1 , 2010, J. Complex..

[5]  David P. Woodruff,et al.  Lower bounds for sparse recovery , 2010, SODA '10.

[6]  David V. Anderson,et al.  Compressive Sensing on a CMOS Separable-Transform Image Sensor , 2010, Proceedings of the IEEE.

[7]  Justin K. Romberg,et al.  Compressive Sensing by Random Convolution , 2009, SIAM J. Imaging Sci..

[8]  Piotr Indyk,et al.  Sequential Sparse Matching Pursuit , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[9]  Daniele Mortari,et al.  A Survey on Star Identification Algorithms , 2009, Algorithms.

[10]  Nathan A. Goodman,et al.  Optically multiplexed imaging with superposition space tracking , 2008, Optical Engineering + Applications.

[11]  Wojciech Makowiecki,et al.  New Sky Pattern Recognition Algorithm , 2008, ICCS.

[12]  Piotr Indyk,et al.  Combining geometry and combinatorics: A unified approach to sparse signal recovery , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[13]  Ting Sun,et al.  Single-pixel imaging via compressive sampling , 2008, IEEE Signal Process. Mag..

[14]  Gerald C. Holst,et al.  CMOS/CCD sensors and camera systems , 2007 .

[15]  R. Fergus,et al.  Random Lens Imaging , 2006 .

[16]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

[17]  Graham Cormode,et al.  An improved data stream summary: the count-min sketch and its applications , 2004, J. Algorithms.

[18]  Daniele Mortari,et al.  The Pyramid Star Identification Technique , 2004 .

[19]  S. Muthukrishnan,et al.  Data streams: algorithms and applications , 2005, SODA '03.

[20]  James D. Meindl,et al.  Beyond Moore's Law: the interconnect era , 2004, Computing in Science & Engineering.

[21]  Carl Christian Liebe,et al.  Accuracy performance of star trackers - a tutorial , 2002 .

[22]  Moses Charikar,et al.  Finding frequent items in data streams , 2002, Theor. Comput. Sci..

[23]  Samir Khuller,et al.  Algorithms for facility location problems with outliers , 2001, SODA '01.

[24]  Dana Ron,et al.  Chinese remaindering with errors , 1999, STOC '99.

[25]  Jørn Justesen,et al.  On the complexity of decoding Reed-Solomon codes (Corresp.) , 1976, IEEE Trans. Inf. Theory.