Reconstruction of Binary Functions and Shapes from Incomplete Frequency Information
Yu Mao

TL;DR
This paper demonstrates that binary functions and shapes can be reconstructed from incomplete frequency data using linear optimization, enabling efficient sensing and recovery with minimal measurements.
Contribution
It introduces a method for reconstructing binary signals from partial frequency information and proves that spatially structured binary functions can be recovered from very few low-frequency measurements.
Findings
Binary signals can be reconstructed from incomplete frequency data.
Spatially structured binary functions require very few low-frequency measurements for recovery.
Numerical results validate the theoretical recovery guarantees.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
