Skip to content
DraconiticResearch
Search Sources API
182,460 studies31 sourcesUpdated 55 min ago
PreprintCC BY 4.0arXiv

Alias Geometry and Density Compensation in Perturbed Fourier Sampling

Abstract

On a uniform grid with equal weights, Fourier modes that remain distinct on the grid are exactly orthogonal. When the nodes are perturbed, density compensation readjusts the weights. We ask how much of the resulting error reweighting can remove, measuring it by the Frobenius norm of the Gram defect, whose square is proportional to the mean-square error of density-compensated adjoint reconstruction. The answer is governed by aliasing. The grid cannot distinguish certain frequency differences, so a weight correction must treat each such alias class as a single number, while a node displacement affects every frequency difference in the class separately. To first order, reweighting removes the class average but not the spread. The irreducible error is a sum of covariance matrices, one for each class of colliding frequency differences. If no differences collide, every small node perturbation can be repaired exactly with positive weights. With collisions, a repair that works to first order can fail at second order. At the two-dimensional DFT, row and column shears are each exactly repairable, but their combination is not, and we compute the obstruction. In one dimension, oversampling protects a band of low-frequency node motions, and under random jitter optimal reweighting asymptotically removes a fraction 1−κ2(2−κ)2 of the expected squared first-order error at oversampling ratio κ∈[1,2]. At critical sampling, node and weight perturbations are orthogonal: no reweighting helps, Voronoi weights can never reduce the error, and for the one-dimensional DFT the remaining error is a log-Vandermonde energy with the circular H1/2 energy as its continuum limit.

Related

  1. Smallest Singular Value Estimates for Nonuniform Fourier Matrices via Periodic Nonuniform Sampling
    Liang Chen, Rongrong Lin, Haizhang Zhang
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
  2. Fourier sampling on a lattice
    Oleg Asipchuk, Sinai Robins
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  3. Fourier decay of Gaussian multiplicative chaos and boundary geometry
    Marcu-Antone Orsoni, William Verreault
    arXivPreprintCC BY 4.0Full textMathematical physicsProbabilityarXiv
  4. Remarks on the Geometry of Sets in ℤd with Small Fourier L1 Norm
    Alex Burgin, Junzhe Mao
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryAnalysis & PDEsarXiv
  5. Optimal sampling density design for homotopic off-the-grid deconvolution
    Joseph Gabet, Maxime Ferreira Da Costa, Kiryung Lee
    HALPreprintPublisher termsFull textNumerical analysis & scientific computingOptimisation & controlHAL
BibTeX
@misc{windandersen2026alias,
  title = {{Alias Geometry and Density Compensation in Perturbed Fourier Sampling}},
  author = {Erli Wind-Andersen},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.02379},
  eprint = {2611.02379},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.02379},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Alias Geometry and Density Compensation in Perturbed Fourier Sampling
AU  - Erli Wind-Andersen
PY  - 2026
DA  - 2026/11/02
PB  - arXiv
DO  - 10.48550/arxiv.2611.02379
UR  - https://arxiv.org/abs/2611.02379
AB  - On a uniform grid with equal weights, Fourier modes that remain distinct on the grid are exactly orthogonal. When the nodes are perturbed, density compensation readjusts the weights. We ask how much of the resulting error reweighting can remove, measuring it by the Frobenius norm of the Gram defect, whose square is proportional to the mean-square error of density-compensated adjoint reconstruction. The answer is governed by aliasing. The grid cannot distinguish certain frequency differences, so a weight correction must treat each such alias class as a single number, while a node displacement affects every frequency difference in the class separately. To first order, reweighting removes the class average but not the spread. The irreducible error is a sum of covariance matrices, one for each class of colliding frequency differences. If no differences collide, every small node perturbation can be repaired exactly with positive weights. With collisions, a repair that works to first order can fail at second order. At the two-dimensional DFT, row and column shears are each exactly repairable, but their combination is not, and we compute the obstruction. In one dimension, oversampling protects a band of low-frequency node motions, and under random jitter optimal reweighting asymptotically removes a fraction 1−κ^2(2−κ)^2 of the expected squared first-order error at oversampling ratio κ∈[1,2]. At critical sampling, node and weight perturbations are orthogonal: no reweighting helps, Voronoi weights can never reduce the error, and for the one-dimensional DFT the remaining error is a log-Vandermonde energy with the circular H^1/2 energy as its continuum limit.
ER  -