A Comparison of Search Strategies for Geometric Branch and Bound Algorithms-Reference-Cited by-同舟云学术

A Comparison of Search Strategies for Geometric Branch and Bound Algorithms

Published:2002 Issue: Volume: Page:837-850
ISSN:0302-9743
Container-title:Computer Vision — ECCV 2002
language:
Short-container-title:

Author:

Breuel Thomas M.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-47977-5_55

Reference14 articles.

1. Henry S. Baird. Model-Based Image Matching Using Location. MIT Press, Cambridge, MA, 1985.

2. D. H. Ballard. Generalized hough transform to detect arbitrary patterns. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(2): 111–122, 1981.

3. G Borgefors. Hierarchical chamfer matching: A parametric edge matching algorithm. PAMI, 10:849–865, 1988.

4. T. M. Breuel. Fast Recognition using Adaptive Subdivisions of Transformation Space. In IEEE Conference on Computer Vision and Pattern Recognition, pages 445–451, 1992.

5. T. M. Breuel. Higher-Order Statistics in Object Recognition. In IEEE Conference on Computer Vision and Pattern Recognition, pages 707–708, 1993.

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. ROSIA: Rotation-Search-Based Star Identification Algorithm;IEEE Transactions on Aerospace and Electronic Systems;2023

2. Structure-based improvement of scene warped locally in digital video stabilization;Procedia Computer Science;2017

3. Geodesic-like features for point matching;Neurocomputing;2016-12

4. Iterative Point Matching via multi-direction geometric serialization and reliable correspondence selection;Neurocomputing;2016-07

5. Branch&Rank for Efficient Object Detection;International Journal of Computer Vision;2013-12-24