Recognition of 3D Object Using Attributed Relation Graph of Silhouette’s Extended Convex Hull

  • Hernsoo Hahn
  • Youngjoon Han
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4292)


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.


Convex Hull Single Camera Concave Shape Relation Graph Convex Object 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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)Google Scholar
  2. 2.
    Besl, P.J., Jain, R.C.: Three dimensional object recognition. Comput. Surveys 17(1), 77–145 (1985)CrossRefGoogle Scholar
  3. 3.
    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)MATHCrossRefGoogle Scholar
  4. 4.
    De Floriani, L.: Feature Extraction from Boundary Models of Three-Dimensional Objects. IEEE Trans. Pattern Matching and Machine Intelligence 11(8), 785–598Google Scholar
  5. 5.
    Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. IEEE Trans. Pattern Analysis and Machine Intelligence 18(4), 377–388 (1996)CrossRefGoogle Scholar
  6. 6.
    Wilson, R.C., Hancock, E.R.: Structural matching by discrete relaxation. IEEE Trans. Pattern Analysis and Machine Intelligence 19(6), 634–647 (1997)CrossRefGoogle Scholar
  7. 7.
    Luo, B., Wilson, R.C., Hancock, E.: Spectral embedding of graphs. Pattern Recognition 36, 2213–2223 (2003)MATHCrossRefGoogle Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Hernsoo Hahn
    • 1
  • Youngjoon Han
    • 1
  1. 1.School of ElectronicsSoongsil UniversitySeoulKorea

Personalised recommendations