Spectral clustering and path-based clustering are two recently developed clustering approaches that have delivered impressive results in a number of challenging clustering tasks. However, they are not robust enough against noise and outliers in the data. In this paper, based on M-estimation from robust statistics, we develop a robust path-based spectral clustering method by defining a robust path-based similarity measure for spectral clustering. Our method is significantly more robust than spectral clustering and path-based clustering. We have performed experiments based on both synthetic and real-world data, comparing our method with some other methods. In particular, color images from the Berkeley segmentation dataset and benchmark are used in the image segmentation experiments. Experimental results show that our method consistently outperforms other methods due to its higher robustness.
Robust path-based spectral clustering with application to image segmentation
Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 ; 1 ; 278-285 Vol. 1
2005-01-01
501312 byte
Conference paper
Electronic Resource
English
Robust Path-Based Spectral Clustering with Application to Image Segmentation
British Library Conference Proceedings | 2005
|A Spectral Clustering Ensemble Algorithm for Image Segmentation
British Library Online Contents | 2010
|Brain tissue MR-image segmentation via optimum-path forest clustering
British Library Online Contents | 2012
|Unsupervised texture image segmentation using multilayer data condensation spectral clustering
British Library Online Contents | 2010
|