Development and evaluation of fast branch-and-bound algorithm for feature matching based on line segments

DOI10.1016/J.PATCOG.2006.10.022zbMath1113.68621OpenAlexW1990139755MaRDI QIDQ869025

Lik-Kwan Shark, Andrey A. Kurekin, Bogdan J. Matuszewski

Publication date: 26 February 2007

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2006.10.022

zbMATH Keywords

branch and boundHausdorff distancefeature matchingbounded alignmentline segment matching

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10)

Uses Software

• robustbase

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Implementation techniques for geometric branch-and-bound matching methods
• Robust Statistics

This page was built for publication: Development and evaluation of fast branch-and-bound algorithm for feature matching based on line segments