Integer-valued images can be uniquely recovered from a minimal set of DFT coefficients through algebraic reduction to 1D problems and dynamic programming algorithms that use lattice approximation to handle NP-hard subproblems.
Esedoglu, Blind deconvolution of bar code signals, Inverse Problems 20 (2003) 121
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NA 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Recovery of Integer Images from Minimal DFT Measurements: Uniqueness and Inversion Algorithms
Integer-valued images can be uniquely recovered from a minimal set of DFT coefficients through algebraic reduction to 1D problems and dynamic programming algorithms that use lattice approximation to handle NP-hard subproblems.