Metraipolis › archive › dc_c745f469039c

Online Learning of Correspondences between Images — arXiv:2608.13104

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.13104
License (as archived)
CC0-1.0
Archived
2026-10-19T04:55:45.916Z
SHA-256 of the archived text
a7b0d8da250fce8c828a11afec4ad7cd2dfc062b6673e37250d73e3ce3f97be0
Stable URL of this page
https://metraipolis.com/documento/dc_c745f469039c

How to cite

Online Learning of Correspondences between Images — arXiv:2608.13104 — arXiv (en), https://arxiv.org/abs/2608.13104 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c745f469039c (Metraipolis archive dc_c745f469039c, sha256 a7b0d8da250fce8c828a11afec4ad7cd2dfc062b6673e37250d73e3ce3f97be0)
BibTeX
@misc{dcc745f469039c,
  title = {Online Learning of Correspondences between Images — arXiv:2608.13104},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.13104},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c745f469039c; sha256 a7b0d8da250fce8c828a11afec4ad7cd2dfc062b6673e37250d73e3ce3f97be0},
  year = {2026}
}

Archived text

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

We propose a novel method for iterative learning of point correspondences between image sequences. Points moving on surfaces in 3D space are projected into two images. Given a point in either view, the considered problem is to determine the corresponding location in the other view. The geometry and distortions of the projections are unknown as is the shape of the surface. Given several pairs of point-sets but no access to the 3D scene, correspondence mappings can be found by excessive global optimization or by the fundamental matrix if a perspective projective model is assumed. However, an iterative solution on sequences of point-set pairs with general imaging geometry is preferable. We derive such a method that optimizes the mapping based on Neyman's chi-square divergence between the densities representing the uncertainties of the estimated and the actual locations. The densities are represented as channel vectors computed with a basis function approach. The mapping between these vectors is updated with each new pair of images such that fast convergence and high accuracy are achieved. The resulting algorithm runs in real-time and is superior to state-of-the-art methods in terms of convergence and accuracy in a number of experiments.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-14 in cs.CV).
Categorie arXiv: Computer Vision and Pattern Recognition (cs.CV).
Pagina del lavoro: https://arxiv.org/abs/2608.13104 — 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-19T04:46:30.153Z dalla pagina https://arxiv.org/catchup/cs.CV/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).