Binary Compressed Imaging
Compressed sensing can substantially reduce the number of samples required for conventional signal acquisition at the expense of an additional reconstruction procedure. It also provides robust reconstruction when using quantized measurements, including in the one-bit setting. In this paper, our goal is to design a framework for binary compressed sensing that is adapted to images. Accordingly, we propose an acquisition and reconstruction approach that complies with the high dimensionality of image data and that provides reconstructions of satisfactory visual quality. Our forward model describes data acquisition and follows physical principles. It entails a series of random convolutions performed optically followed by sampling and binary thresholding. The binary samples that are obtained can be either measured or ignored according to predefined functions. Based on these measurements, we then express our reconstruction problem as the minimization of a compound convex cost that enforces the consistency of the solution with the available binary data under total-variation regularization. Finally, we derive an efficient reconstruction algorithm relying on convex-optimization principles. We conduct several experiments on standard images and demonstrate the practical interest of our approach.
- URL: http://bigwww.epfl.ch/publications/bourquard1303.html
- URL: http://bigwww.epfl.ch/publications/bourquard1303.pdf
- URL: http://bigwww.epfl.ch/publications/bourquard1303.ps
Keywords: Acquisition devices ; bound optimization ; compressed sensing ; conjugate gradient ; convex optimization ; inverse problems ; iteratively reweighted least squares ; Nesterov's method ; point-spread function ; preconditioning ; quantization
Record created on 2013-10-01, modified on 2016-08-09