loading...
Scale-Space Processing of Point-Sampled Geometry for Efficient 3D Object Segmentation
Tokyo, Japan November 18-November 20
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CW.2004.54Third International Conference on Cyb ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Hamid Laga, Tokyo Institute of Technology, Japan
Hiroki Takahashi, Tokyo Institute of Technology, Japan
Masayuki Nakajima, Tokyo Institute of Technology, Japan
In this paper, we present a new framework for analyzing and segmenting point-sampled 3D objects. Our method first computes for each surface point the surface curvature distribution by applying the Principal Component Analysis on local neighborhoods with different sizes. Then we model in the four dimensional space the joint distribution of surface curvature and position features as a mixture of Gaussians using the Expectation Maximization algorithm. Central to our method is the extension of the scale-space theory from the 2D domain into the three-dimensional space to allow feature analysis and classification at different scales.
Our algorithm operates directly on points requiring no vertex connectivity information. We demonstrate and discuss the performance of our framework on a collection of point sampled 3D objects.
Index Terms:
Scale-space, 3D object segmentation, Expectation-Maximization algorithm
Citation:
Hamid Laga, Hiroki Takahashi, Masayuki Nakajima, "Scale-Space Processing of Point-Sampled Geometry for Efficient 3D Object Segmentation," cw, pp.377-383, Third International Conference on Cyberworlds (CW'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.