loading...
Segmentation of Range Data Based on A Stochastic Clustering Method with Competitive Process
Cambridge UK August 23-August 26
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPR.2004.133423317th International Conference on Patt ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Makoto Maeda, Kyushu Institute of Technology, Japan
Kousuke Kumamaru, Kyushu Institute of Technology, Japan
Katsuhiro Inoue, Kyushu Institute of Technology, Japan
In this paper, a stochastic clustering method with a competitive process is proposed to segment significantly the entire circumferential range data. The segmentation technique is utilized as the preprocessing of 3-D shape modeling so that the modeling can be more easily achieved for the object that has arbitrary topology, in which the data points are divided into the several subsets that represent the 3-D shapes of different quadric surfaces. The clustering method is implemented by evaluating a distance computed between each data point and each quadric surface. Furthermore, it consists of creation and competitive processes in order to obtain the desirable clusters. Consequently, since the only appropriate clusters are remaining, the segmentation can be achieved by assigning the data points to these clusters.
Citation:
Makoto Maeda, Kousuke Kumamaru, Katsuhiro Inoue, "Segmentation of Range Data Based on A Stochastic Clustering Method with Competitive Process," icpr, vol. 1, pp.624-627, 17th International Conference on Pattern Recognition (ICPR'04) - Volume 1, 2004
Usage of this product signifies your acceptance of the Terms of Use.