RECORD
Reconstruction of Binary Functions and Shapes from Incomplete Frequency Information
Information Theory · Submitted 4 Apr 2011
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim We show that it is possible to reconstruct binary signals from incomplete frequency measurements via the solution of a simple linear optimization problem.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
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.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | The characterization of a binary function by partial frequency information is considered. | background 0.97 | 0.25 | 0.03 | asserted 0.55 |
| s1 | We show that it is possible to reconstruct binary signals from incomplete frequency measurements via the solution of a simple linear optimization problem. | result 0.46 | 0.94 | 0.63 | asserted 0.87 |
| s2 | 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. | result 0.93 | 0.90 | 0.45 | asserted 1.00 |
| s3 | 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. | interpretation 0.99 | 0.38 | 0.14 | hedged possibility 0.93 |
| s4 | Numerical results are provided to demonstrate the theoretical arguments. | contribution 0.39 | 0.91 | 0.03 | asserted 0.99 |
What was examined, and what was not
- arXiv listing abstract v3
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original 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.
Human review
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.