Compressive Imaging Using RIP-Compliant CMOS Imager Architecture and Landweber Reconstruction

In this paper, we present a new image sensor architecture for fast and accurate compressive sensing (CS) of natural images. Measurement matrices usually employed in CS CMOS image sensors are recursive pseudo-random binary matrices. We have proved that the restricted isometry property of these matrices is limited by a low sparsity constant. The quality of these matrices is also affected by the non-idealities of pseudo-random number generators (PRNG). To overcome these limitations, we propose a hardware-friendly pseudo-random ternary measurement matrix generated on-chip by means of class III elementary cellular automata (ECA). These ECA present a chaotic behavior that emulates random CS measurement matrices better than other PRNG. We have combined this new architecture with a block-based CS smoothed-projected Landweber reconstruction algorithm. By means of single value decomposition, we have adapted this algorithm to perform fast and precise reconstruction while operating with binary and ternary matrices. Simulations are provided to qualify the approach.

[1]  Shigeru Ninagawa,et al.  Power Spectral Analysis of Elementary Cellular Automata , 2008, Complex Syst..

[2]  Shahram Shirani,et al.  CMOS Image Sensor With Area-Efficient Block-Based Compressive Sensing , 2015, IEEE Sensors Journal.

[3]  Vijaya Sankara Rao Pasupureddi,et al.  A Low Power CMOS Imager Based on Distributed Compressed Sensing , 2014, 2014 27th International Conference on VLSI Design and 2014 13th International Conference on Embedded Systems.

[4]  Kaare Brandt Petersen,et al.  The Matrix Cookbook , 2006 .

[5]  Geoff Boeing,et al.  Visual Analysis of Nonlinear Dynamical Systems: Chaos, Fractals, Self-Similarity and the Limits of Prediction , 2016, Syst..

[6]  Emmanuel J. Candès,et al.  NESTA: A Fast and Accurate First-Order Method for Sparse Recovery , 2009, SIAM J. Imaging Sci..

[7]  Bertrand Granado,et al.  Adaptive saliency-based compressive sensing image reconstruction , 2016, 2016 IEEE International Conference on Multimedia & Expo Workshops (ICMEW).

[8]  Richard Obermeier,et al.  Sensing Matrix Design via Mutual Coherence Minimization for Electromagnetic Compressive Imaging Applications , 2017, IEEE Transactions on Computational Imaging.

[9]  Shu-Tao Xia,et al.  Construction of ternary matrices with small coherence for compressed sensing , 2016 .

[10]  Thong T. Do,et al.  Sparsity adaptive matching pursuit algorithm for practical compressed sensing , 2008, 2008 42nd Asilomar Conference on Signals, Systems and Computers.

[11]  James E. Fowler,et al.  Block Compressed Sensing of Images Using Directional Transforms , 2010, 2010 Data Compression Conference.

[12]  Kidiyo Kpalma,et al.  Near-optimal Binary Compressed Sensing Matrix , 2013, ArXiv.

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

[14]  Thomas Maugey,et al.  Disparity-compensated compressed-sensing reconstruction for multiview images , 2010, 2010 IEEE International Conference on Multimedia and Expo.

[15]  Lu Gan.  Block Compressed Sensing of Natural Images , 2007, 2007 15th International Conference on Digital Signal Processing.

[16]  A. Robert Calderbank,et al.  Beyond worst-case reconstruction in deterministic compressed sensing , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[17]  S. Wolfram.  Statistical mechanics of cellular automata , 1983 .

[18]  K. Bredies,et al.  Linear Convergence of Iterative Soft-Thresholding , 2007, 0709.1598.

[19]  Volkan Cevher,et al.  Low-Dimensional Models for Dimensionality Reduction and Signal Recovery: A Geometric Perspective , 2010, Proceedings of the IEEE.

[20]  Abbas El Gamal,et al.  CMOS Image Sensor With Per-Column ΣΔ ADC and Programmable Compressed Sensing , 2013, IEEE Journal of Solid-State Circuits.

[21]  T. Blumensath,et al.  Iterative Thresholding for Sparse Approximations , 2008 .

[22]  Sachin Dhingra.  Comparison of LFSR and CA for BIST , 2005 .

[23]  Piotr Indyk.  Explicit constructions for compressed sensing of sparse signals , 2008, SODA '08.

[24]  Maria Trocan,et al.  Robust Image Reconstruction for Block-Based Compressed Sensing Using a Binary Measurement Matrix , 2018, 2018 25th IEEE International Conference on Image Processing (ICIP).

[25]  Mário A. T. Figueiredo,et al.  Gradient Projection for Sparse Reconstruction: Application to Compressed Sensing and Other Inverse Problems , 2007, IEEE Journal of Selected Topics in Signal Processing.

[26]  M. Lavanya,et al.  Design and Analysis of Linear Feedback Shift Register Based on Various Tap Connections , 2012 .

[27]  Djiby Sow,et al.  Construction of Maximum Period Linear Feedback ShiftRegisters (LFSR) (Primitive Polynomials and Linear RecurringRelations) , 2015 .

[28]  Stephen J. Wright,et al.  Computational Methods for Sparse Solution of Linear Inverse Problems , 2010, Proceedings of the IEEE.

[29]  Maria Trocan,et al.  Sparse recovery-based error concealment for multiview images , 2015, 2015 International Workshop on Computational Intelligence for Multimedia Understanding (IWCIM).

[30]  G. Mazzini,et al.  Randomly-Flipped Linear Feedback Shift Registers: Spectral Analysis and Conjectures , 2008, 2008 IEEE 10th International Symposium on Spread Spectrum Techniques and Applications.

[31]  Ronald A. DeVore,et al.  Deterministic constructions of compressed sensing matrices , 2007, J. Complex..

[32]  E.J. Candes.  Compressive Sampling , 2022 .

[33]  Shu-Tao Xia,et al.  Deterministic Constructions of Binary Measurement Matrices From Finite Geometry , 2013, IEEE Transactions on Signal Processing.

[34]  E. Jen.  Aperiodicity in one-dimensional cellular automata , 1991 .

[35]  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.