Fast hierarchical template matching strategy for real-time pose estimation of texture-less objects

12Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes a fast template matching strategy for real-time pose estimation of texture-less objects in a single camera image. The key novelty is the hierarchical searching strategy through a template pyramid. Firstly, a model database whose templates are stored in a hierarchical pyramid need to be generated offline. The online hierarchical searching through the template pyramid is computed to collect all candidate templates which pass the similarity measure criterion. All of the template candidates and their child neighbor templates are tracked down to the next lower level of pyramid. This hierarchical tracking process is repeated until all template candidates have been tracked down to the lowest level of pyramid. The experimental result shows that the runtime of template matching procedure in the state-of-the-art LINE2D approach [1] after applying our fast hierarchical searching strategy is 44 times faster than the original LINE2D searching method while the database contains 15120 templates.

Cite

CITATION STYLE

APA

Ye, C., Li, K., Jia, L., Zhuang, C., & Xiong, Z. (2016). Fast hierarchical template matching strategy for real-time pose estimation of texture-less objects. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9834 LNCS, pp. 225–236). Springer Verlag. https://doi.org/10.1007/978-3-319-43506-0_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free