Corpus ID: 17355708

Spatio-temporal Compressed Sensing with Coded Apertures and Keyed Exposures

@article{Harmany2011SpatiotemporalCS,
  title={Spatio-temporal Compressed Sensing with Coded Apertures and Keyed Exposures},
  author={Zachary T. Harmany and Roummel F. Marcia and Rebecca M. Willett},
  journal={arXiv: Applications},
  year={2011}
}
Optical systems which measure independent random projections of a scene according to compressed sensing (CS) theory face a myriad of practical challenges related to the size of the physical platform, photon efficiency, the need for high temporal resolution, and fast reconstruction in video settings. This paper describes a coded aperture and keyed exposure approach to compressive measurement in optical systems. The proposed projections satisfy the Restricted Isometry Property for sufficiently… Expand

Figures and Tables from this paper

Compressive Coded Aperture Keyed Exposure Imaging with Optical Flow Reconstruction
TLDR
A coded aperture and keyed exposure approach to compressive video measurement which admits a small physical platform, high photon efficiency, high temporal resolution, and fast reconstruction algorithms and hence compressed sensing theory provides theoretical guarantees on the video reconstruction quality. Expand
Flutter Shutter Video Camera for compressive sensing of videos
TLDR
It is shown that a simple coded exposure modulation is sufficient to reconstruct high speed videos and is proposed the Flutter Shutter Video Camera (FSVC), in which each exposure of the sensor is temporally coded using an independent pseudo-random sequence. Expand
A Coded Aperture Compressive Imaging Array and Its Visual Detection and Tracking Algorithms for Surveillance Systems
TLDR
A parallel coded aperture compressive imaging system is proposed to reduce the needed high resolution coded mask requirements and facilitate the storage of the projection matrix and experimental results demonstrate that low dimensional compressed imaging representation is sufficient to determine spatial motion targets. Expand
Sample Efficient Fourier Ptychography for Structured Data
TLDR
Through a novel framework of recovery algorithms, it is shown that one can reconstruct high-resolution images (or video) from fewer samples, via simple and natural assumptions on the structure of the images ( or video), and demonstrate the validity of the claims through a series of experiments. Expand
Compressive Sensing for Video Applications
TLDR
This paper will present an extensive overview of computational imaging and compressive sensing techniques as applied to the video compressed sensing problem, and shows the interplay of three core ideas: signal models, imaging architectures and recovery algorithms. Expand
Per-pixel mirror-based measuring : um novo método para aquisição para vídeo de alta velocidade
Video acquisition in high temporal resolution has several aplications in science, industry, segurity, entertainment, sports, etc. However, high speed cameras are expensive and, therefore, there is aExpand
Geometry of random Toeplitz-block sensing matrices: bounds and implications for sparse signal processing
  • W. Bajwa
  • Engineering
  • Defense + Commercial Sensing
  • 2012
A rich body of literature has emerged during the last decade that seeks to exploit the sparsity of a signal for a reduction in the number of measurements required for various inference tasks. Much ofExpand
Accurate compressive data gathering in wireless sensor networks using weighted spatio-temporal compressive sensing
TLDR
A method based on weighted spatial-temporal compressive sensing is proposed to improve the accuracy of the reconstructed data and yields a 12% improvement compared to the closest method in the literature. Expand
Performance Analysis of Toeplitz Block Sampling Matrix in Compressed Sensing
TLDR
Results show that the sampling performance of Toeplitz block matrix can approach that of random matrix by choosing its parameters properly and by comparing with the random matrix in which its entries are drawn independently from certain probability distributions. Expand
Sparse block circulant matrices for compressed sensing
TLDR
The authors propose to construct a novel measurement matrix with a specific structure, called sparse block circulant matrix (SBCM), to reduce the computational burden and ensure similar signal recovery accuracy as Gaussian random matrices. Expand
...
1
2
...

References

SHOWING 1-10 OF 50 REFERENCES
Compressive coded aperture superresolution image reconstruction
  • R. Marcia, R. Willett
  • Computer Science
  • 2008 IEEE International Conference on Acoustics, Speech and Signal Processing
  • 2008
TLDR
The design of coded aperture masks for super- resolution image reconstruction from a single, low-resolution, noisy observation image are described and based upon recent theoretical work on Toeplitz- structured matrices for compressive sensing, the proposed masks are fast and memory-efficient to compute. Expand
Compressive coded apertures for high-resolution imaging
TLDR
It is described how given a fixed size focal plane array, compressive measurements using coded apertures combined with sophisticated optimization algorithms can significantly increase image quality and resolution. Expand
Compressive coded aperture video reconstruction
TLDR
This paper applies coded aperture mask designs to each video frame and uses compressive sensing optimization techniques for enhanced resolution digital video recovery and demonstrates that further improvements can be attained by solving for multiple frames simultaneously, even when the total computation time budget is held fixed. Expand
Coded Strobing Photography: Compressive Sensing of High Speed Periodic Videos
TLDR
The problem of sub-Nyquist sampling of periodic signals and designs to capture and reconstruct such signals are addressed and the key result is that for such signals, the Nyquist rate constraint can be imposed on the strobe rate rather than the sensor rate. Expand
An analysis of coded aperture acquisition and reconstruction using multi-frame code sequences for relaxed optical design constraints
TLDR
It is found that even with suboptimal solutions that binary masks can be used to improve imagery over the case of an uncoded aperture with the same aberration. Expand
Compressive Structured Light for Recovering Inhomogeneous Participating Media
TLDR
The effectiveness of the proposed compressive structured light method with simulations as well as experiments on the volumetric recovery of multiple translucent layers, 3D point clouds etched in glass, and the dynamic process of milk drops dissolving in water are shown. Expand
Compressive Sampling Vs. Conventional Imaging
  • J. Haupt, R. Nowak
  • Mathematics, Computer Science
  • 2006 International Conference on Image Processing
  • 2006
TLDR
Compared to conventional imaging by considering a canonical class of piecewise smooth image models, CS can be advantageous in noisy imaging problems if the underlying image is highly compressible or if the SNR is sufficiently large. Expand
Compressed Sensing Performance Bounds Under Poisson Noise
TLDR
It is shown that, as the overall intensity of the underlying signal increases, an upper bound on the reconstruction error decays at an appropriate rate, but that for a fixed signal intensity, the error bound actually grows with the number of measurements or sensors. Expand
Lensless wide-field fluorescent imaging on a chip using compressive decoding of sparse objects
TLDR
A compressive sampling based optimization algorithm is used to rapidly reconstruct the sparse distribution of fluorescent sources to achieve ~10 µm spatial resolution over the entire active region of the sensor-array over an imaging field-of-view of >8 cm2. Expand
Compressed sensing
  • D. Donoho
  • Computer Science
  • IEEE Transactions on Information Theory
  • 2006
TLDR
It is possible to design n=O(Nlog(m)) nonadaptive measurements allowing reconstruction with accuracy comparable to that attainable with direct knowledge of the N most important coefficients, and a good approximation to those N important coefficients is extracted from the n measurements by solving a linear program-Basis Pursuit in signal processing. Expand
...
1
2
3
4
5
...