Robust 3D marker localization using multi-spectrum sequences

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

Abstract

Robust 3D marker localization in different conditions is an open, challenging problem to stereovision systems. For years, many algorithms - using monocular or multiple views; based on visible or infrared sequences - have been proposed to solve this problem. But they all have limitations. In this paper, we propose a novel algorithm for robust 3D marker localization in different conditions, using synchronous visible and infrared (IR) spectrum sequences captured by binocular camera. The main difficulty of the proposed algorithm is how to accurately match the corresponding marked objects in multi-spectrum views. We propose to solve the matching problem by considering geometry constraints, context based features of special designed markers, 3D physical spacial constraints, and etc. Experimental results demonstrated the feasibility of the proposed algorithm. © 2009 Springer-Verlag.

Cite

CITATION STYLE

APA

Li, P., Cheng, J., Yuan, R., & Zhao, W. (2009). Robust 3D marker localization using multi-spectrum sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5876 LNCS, pp. 529–537). https://doi.org/10.1007/978-3-642-10520-3_50

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