Reconstruction of Binary Functions and Shapes From Incomplete Frequency Information

The characterization of a binary function by partial frequency information is considered. We show that it is possible to reconstruct binary signals from incomplete frequency measurements via the solution of a simple linear optimization problem. We further prove that if a binary function is spatially structured (e.g., a general black-white image or an indicator function of a shape), then it can be recovered from very few low frequency measurements in general. These results would lead to efficient methods of sensing, characterizing and recovering a binary signal or a shape as well as other applications like deconvolution of binary functions blurred by a low-pass filter. Numerical results are provided to demonstrate the theoretical arguments.

[1]  Wotao Yin,et al.  An Iterative Regularization Method for Total Variation-Based Image Restoration , 2005, Multiscale Model. Simul..

[2]  David L. Donoho,et al.  Counting the Faces of Randomly-Projected Hypercubes and Orthants, with Applications , 2008, Discret. Comput. Geom..

[3]  F. Santosa,et al.  Reconstruction of a two-dimensional binary obstacle by controlled evolution of a level-set , 1998 .

[4]  Jean-Jacques Fuchs,et al.  Sparsity and uniqueness for some specific under-determined linear systems , 2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005..

[5]  D. Donoho,et al.  Uncertainty principles and signal recovery , 1989 .

[6]  Alan V. Oppenheim,et al.  Reconstruction of Multidimensional Signals from Zero Crossings* , 1986, Topical Meeting On Signal Recovery and Synthesis II.

[7]  A. Ulanovskii.  The Sturm-Hurwitz Theorem and its Extensions , 2006 .

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

[9]  P. J. Harwin,et al.  Sturm’s Theorems on Zero Sets in Nonlinear Parabolic Equations , 2005 .

[10]  Thomas M. Cover,et al.  Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition , 1965, IEEE Trans. Electron. Comput..

[11]  Jorge L. C. Sanz.  Multidimensional signal representation by zero crossings and algebraic study , 1989 .

[12]  Thomas S. Huang,et al.  Image Representation by Sign Information , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  B. Kedem,et al.  Spectral analysis and discrimination by zero-crossings , 1986, Proceedings of the IEEE.

[14]  Daniel Cremers,et al.  Global Solutions of Variational Models with Convex Regularization , 2010, SIAM J. Imaging Sci..

[15]  David L. Donoho,et al.  Exponential Bounds Implying Construction of Compressed Sensing Matrices, Error-Correcting Codes, and Neighborly Polytopes by Random Sampling , 2010, IEEE Transactions on Information Theory.

[16]  Xavier Bresson,et al.  Fast Global Minimization of the Active Contour/Snake Model , 2007, Journal of Mathematical Imaging and Vision.

[17]  J. Bucklew,et al.  Synthesis of binary images from band-limited functions , 1989 .

[18]  Jae S. Lim,et al.  Signal reconstruction from Fourier transform sign information , 1985, IEEE Trans. Acoust. Speech Signal Process..

[19]  B. Logan.  Information in the zero crossings of bandpass signals , 1977, The Bell System Technical Journal.

[20]  Michael Elad,et al.  On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations , 2008, IEEE Transactions on Information Theory.

[21]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[22]  S. Osher,et al.  Level Set Methods for Optimization Problems Involving Geometry and Constraints I. Frequencies of a T , 2001 .

[23]  Naif Alajlan,et al.  Geometry-Based Image Retrieval in Binary Image Databases , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[24]  Thierry Blu,et al.  Sampling signals with finite rate of innovation , 2002, IEEE Trans. Signal Process..

[25]  Tom Goldstein,et al.  The Split Bregman Method for L1-Regularized Problems , 2009, SIAM J. Imaging Sci..

[26]  A. Oppenheim,et al.  Reconstruction of two-dimensional signals from level crossings , 1990 .

[27]  Hiroshi Ishikawa,et al.  Exact Optimization for Markov Random Fields with Convex Priors , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[28]  Gady Kozma,et al.  On the gaps between zeros of trigonometric polynomials. , 2003 .

[29]  Robert Hummel,et al.  Reconstructions from zero crossings in scale space , 1989, IEEE Trans. Acoust. Speech Signal Process..

[30]  Emmanuel J. Candès,et al.  Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.

[31]  S. Esedoglu.  Blind deconvolution of bar code signals , 2004 .

[32]  Yehoshua Y. Zeevi,et al.  Image reconstruction from zero crossings , 1986, IEEE Trans. Acoust. Speech Signal Process..

[33]  Robert R. Meyer,et al.  A variable-penalty alternating directions method for convex optimization , 1998, Math. Program..

[34]  A. Requicha,et al.  The zeros of entire functions: Theory and engineering applications , 1980, Proceedings of the IEEE.

[35]  Mila Nikolova,et al.  Algorithms for Finding Global Minimizers of Image Segmentation and Denoising Models , 2006, SIAM J. Appl. Math..

[36]  Stanley Osher,et al.  A split Bregman method for non-negative sparsity penalized least squares with applications to hyperspectral demixing , 2010, 2010 IEEE International Conference on Image Processing.