Metraipolis › archive › dc_ecc8eb5f64d7

Co-occurrence-Aware Quadratic Assignment for Local Feature Matching in Simultaneous Localization and Mapping — arXiv:2609.17905

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.17905
License (as archived)
CC0-1.0
Archived
2026-10-15T17:13:20.650Z
SHA-256 of the archived text
e594d5ce7957032ffcbc1294c97438f7ded916f22d36dda0029148f86bd1c648
Stable URL of this page
https://metraipolis.com/documento/dc_ecc8eb5f64d7

How to cite

Co-occurrence-Aware Quadratic Assignment for Local Feature Matching in Simultaneous Localization and Mapping — arXiv:2609.17905 — arXiv (en), https://arxiv.org/abs/2609.17905 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ecc8eb5f64d7 (Metraipolis archive dc_ecc8eb5f64d7, sha256 e594d5ce7957032ffcbc1294c97438f7ded916f22d36dda0029148f86bd1c648)
BibTeX
@misc{dcecc8eb5f64d7,
  title = {Co-occurrence-Aware Quadratic Assignment for Local Feature Matching in Simultaneous Localization and Mapping — arXiv:2609.17905},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.17905},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ecc8eb5f64d7; sha256 e594d5ce7957032ffcbc1294c97438f7ded916f22d36dda0029148f86bd1c648},
  year = {2026}
}

Archived text

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

Local feature matching, which associates keypoints in two images as keypoint pairs, is fundamental to Visual Simultaneous Localization and Mapping (Visual SLAM). Nearest Neighbor (NN) search is commonly used for keypoint matching, but it has difficulty selecting correct keypoint pairs when multiple candidates have similar costs. To improve matching accuracy, this paper proposes a keypoint matching method that considers the pairwise co-occurrence of two keypoint pairs. The keypoint matching is formulated as a quadratic assignment problem, which is an NP-hard combinatorial optimization problem, making it difficult to solve quickly on conventional computers. Recently, Ising machines have been developed as computing devices capable of solving hard combinatorial optimization problems. Using a simulated bifurcation based Ising machine, the proposed method improved matching accuracy by approximately 8 percentage points over a conventional method on the HPatches dataset. Furthermore, we integrated the proposed method into ORB-SLAM3, a representative academic Visual SLAM system, and achieved a 3.78-fold improvement in absolute pose error (APE) and a 2.85-fold improvement in relative pose error (RPE) on the KITTI dataset scenes where multiple same shape objects are repeatedly arranged, which are challenging for accurate self-pose estimation by the original ORB-SLAM3.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-17 in cs.ET).
Categorie arXiv: Emerging Technologies (cs.ET).
Pagina del lavoro: https://arxiv.org/abs/2609.17905 — 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-15T16:20:17.220Z dalla pagina https://arxiv.org/catchup/cs.ET/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).