Metraipolis › archive › dc_dc34579f4a98

Explicit Oblique Inverses of the Approximate Discrete Radon Transform — arXiv:2610.23363

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.23363
License (as archived)
CC0-1.0
Archived
2026-10-19T09:38:31.622Z
SHA-256 of the archived text
c567edbb29d46078b4aca8b4e4171fccb5cdb68bf4ac6013aa900497c8bbc642
Stable URL of this page
https://metraipolis.com/documento/dc_dc34579f4a98

How to cite

Explicit Oblique Inverses of the Approximate Discrete Radon Transform — arXiv:2610.23363 — arXiv (en), https://arxiv.org/abs/2610.23363 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dc34579f4a98 (Metraipolis archive dc_dc34579f4a98, sha256 c567edbb29d46078b4aca8b4e4171fccb5cdb68bf4ac6013aa900497c8bbc642)
BibTeX
@misc{dcdc34579f4a98,
  title = {Explicit Oblique Inverses of the Approximate Discrete Radon Transform — arXiv:2610.23363},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.23363},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dc34579f4a98; sha256 c567edbb29d46078b4aca8b4e4171fccb5cdb68bf4ac6013aa900497c8bbc642},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.23363. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The approximate discrete Radon transform (ADRT) is a fast, hierarchical approximation of the Radon transform whose levels have explicit spectral decompositions, but its Moore-Penrose inverse, needed for data outside the range, has no closed form. We construct explicit left inverses of the ADRT, oblique projections onto its range, that are exact for every choice of their parameters and amplify noise by a constant factor relative to the Moore-Penrose inverse. Realized with polynomial filters on the butterfly structure of the levels, they are fixed linear maps of cost $O(N^{5/2}\log^{3/2}N/\sigma_{\min})$ for an $N\times N$ image, where $\sigma_{\min}$ is the smallest singular value of the ADRT; with the measured growth $\sigma_{\min}\sim N^{1/4}$ this is $O(N^{2.25}\log^{3/2}N)$. A hybrid that keeps the explicit inverse of the cross-quadrant level is cheaper and closer to the Moore-Penrose inverse. In compiled implementations both outperform a polynomial solver of the normal equations from $N=256$ on, and their conditioning is traced to the aliasing of integer-sampled lines.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.NA, nuovi lavori del giorno).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2610.23363 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T09:34:29.797Z dalla pagina https://arxiv.org/list/math.NA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).