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.
arXiv preprint arXiv:2410.22196 (2024)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Enhances GA-based sieving for SVP on integral and module lattices via domain-informed representation and crossover.
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.