By Topic

Surface approximation and range image segmentation through robust competitive clustering

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
H. Frigui ; Dept. of Comput. Eng. & Comput. Sci., Missouri Univ., Columbia, MO, USA ; R. Krishnapuram

Algorithms that perform segmentation and surface approximation of range images need to be robust since real range data tends to be noisy. In this paper, we present a robust clustering algorithm and show how it can be used to obtain an approximation of a range image in terms of quadric surface patches. The proposed algorithm does not assume that the number of surface patches is known a priori, and performs well even when the data set is contaminated by noise and outliers

Published in:

Fuzzy Systems, 1996., Proceedings of the Fifth IEEE International Conference on  (Volume:2 )

Date of Conference:

8-11 Sep 1996