Abstract
This paper presents a new approach of recognizing a 3D object using a single camera, based on the extended convex hull of its silhouette. It aims at minimizing the DB size and simplifying the processes for matching and feature extraction. For this purpose, two concepts are introduced: extended convex hull and measurable region. Extended convex hull is consisted of convex curved edges as well as convex polygons. Measurable region is the cluster of the viewing vectors of a camera represented as the points on the orientation sphere from which a specific set of surfaces can be measured. A measurable region is represented by the extended convex hull of the silhouette which can be obtained by viewing the object from the center of the measurable region. Each silhouette is represented by a relation graph where a node describes an edge using its type, length, reality, and components. Experimental results are included to show that the proposed algorithm works efficiently even when the objects are overlapped and partially occluded. The time complexity for searching the object model in the database is O(N) where N is the number of silhouette models.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Quick, P., Capson, D.: Analysis of Determining Camera Position Via Karhunen-Loeve Transform. In: IEEE Southwest Symposium on Image Analysis and Interpretation, pp. 88–92 (2000)
Besl, P.J., Jain, R.C.: Three dimensional object recognition. Comput. Surveys 17(1), 77–145 (1985)
Joshi, S., Chang, T.C.: Graph-based heuristics for recognition of machined features from a 3D solid model. Computer-Aided Design 20(20), 58–66 (1988)
De Floriani, L.: Feature Extraction from Boundary Models of Three-Dimensional Objects. IEEE Trans. Pattern Matching and Machine Intelligence 11(8), 785–598
Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. IEEE Trans. Pattern Analysis and Machine Intelligence 18(4), 377–388 (1996)
Wilson, R.C., Hancock, E.R.: Structural matching by discrete relaxation. IEEE Trans. Pattern Analysis and Machine Intelligence 19(6), 634–647 (1997)
Luo, B., Wilson, R.C., Hancock, E.: Spectral embedding of graphs. Pattern Recognition 36, 2213–2223 (2003)
Caelli, T., Kosiov, S.: An eigenspace projection clustering method for inexact graph matching. IEEE Trans. Pattern Analysis and Machine Intelligence 26(4), 515–519 (2004)
FANUC LTD, http://www.fanuc.co.jp/en/product/new_product/2003/0311/newbinpicking.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hahn, H., Han, Y. (2006). Recognition of 3D Object Using Attributed Relation Graph of Silhouette’s Extended Convex Hull. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2006. Lecture Notes in Computer Science, vol 4292. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11919629_14
Download citation
DOI: https://doi.org/10.1007/11919629_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-48626-8
Online ISBN: 978-3-540-48627-5
eBook Packages: Computer ScienceComputer Science (R0)