Metraipolis › archive › dc_27784e5e2c85
Adaptive Tiling for Least-Squares Phase Unwrapping: Runtime and Accuracy — arXiv:2609.28541
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.28541
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T04:50:31.272Z
- SHA-256 of the archived text
6c461bff8566882fee61659ea266e4d1110d10a9ced8e12ef285cd0560d83773- Stable URL of this page
https://metraipolis.com/documento/dc_27784e5e2c85
How to cite
Adaptive Tiling for Least-Squares Phase Unwrapping: Runtime and Accuracy — arXiv:2609.28541 — arXiv (en), https://arxiv.org/abs/2609.28541 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_27784e5e2c85 (Metraipolis archive dc_27784e5e2c85, sha256 6c461bff8566882fee61659ea266e4d1110d10a9ced8e12ef285cd0560d83773)
BibTeX
@misc{dc27784e5e2c85,
title = {Adaptive Tiling for Least-Squares Phase Unwrapping: Runtime and Accuracy — arXiv:2609.28541},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.28541},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_27784e5e2c85; sha256 6c461bff8566882fee61659ea266e4d1110d10a9ced8e12ef285cd0560d83773},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.28541. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Phase unwrapping estimates the missing multiples of $2\pi$ in measured phase images. For large images, tiling limits the size of local reconstruction problems and enables parallel processing. Adaptive tiling could further reduce the number of local problems and boundaries by retaining large tiles where little refinement is needed. We investigate whether this reduction makes reconstruction faster. We compare complete reconstruction time and accuracy for a regular grid, quadtree, and kd-tree partitions. We also evaluate nine criteria for deciding where quadtree tiles should be subdivided, including residue count, fringe density, and measures of phase variation, at different tile sizes and budgets. In single-threaded experiments on a heterogeneous image dataset, optimized adaptive partitions use fewer tiles but remain slower than the optimized grid, and some reconstructions lose substantial accuracy. Stage measurements explain why: constructing the partition and solving larger retained tiles outweigh the savings at tile boundaries. The criterion comparison also shows that more refinement does not consistently improve accuracy. These results motivate evaluating adaptive partitions by the complete time needed to reach a chosen reconstruction accuracy, including whether limited refinement can provide a faster approximate result. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-25 in cs.DC). Categorie arXiv: Image and Video Processing (eess.IV) ; Computer Vision and Pattern Recognition (cs.CV); Distributed, Parallel, and Cluster Computing (cs.DC). Pagina del lavoro: https://arxiv.org/abs/2609.28541 — 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-08T04:28:24.140Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).