Referenced Items are not available for this document.
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
- Page(s):
- 1414 - 1419 vol.2
- Meeting Date :
- 08 Sep 1996-11 Sep 1996
- Print ISBN:
- 0-7803-3645-3
- INSPEC Accession Number:
- 5412222
- Conference Location :
- New Orleans, LA
- Digital Object Identifier :
- 10.1109/FUZZY.1996.552383
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
