ACM Home Page
Please provide us with feedback. Feedback
Spectral clustering ensemble for image segmentation
Full text PdfPdf (778 KB)
Source
ACM/SIGEVO Summit on Genetic and Evolutionary Computation archive
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation table of contents
Shanghai, China
SESSION: Full papers table of contents
Pages 415-420  
Year of Publication: 2009
ISBN:978-1-60558-326-6
Authors
Xiuli Ma  Shanghai University, Shanghai, China
Wanggen Wan  Shanghai University, Shanghai, China
Licheng Jiao  Xidian University, Xi'an, China
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 22,   Downloads (12 Months): 70,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1543834.1543890
What is a DOI?

ABSTRACT

To make full use of information included in a dataset, a multiway spectral clustering algorithm with joint model is applied to image segmentation. To overcome the sensitivity of the joint model-based multiway spectral clustering to kernel parameter and to produce the robust and stable segmentation results, spectral clustering ensemble algorithm is proposed in this paper, which can make full use of the built-in randomness of spectral clustering and the inaccuracy of Nystrom approximation to produce diversity. Experiments on UCI dataset, textural and SAR images show that, after cluster ensemble, the new algorithm is not only more robust but also better quality. Therefore, the new algorithm is effective.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
Verma, D. and Meila, M. 2005. A comparison of spectral clustering algorithms. Technical report, Department of CSE University of Washington Seattle, WA 98195--2350.
 
4
Brand, M. and Huang, K. 2003. A unifying theorem for spectral embedding and clustering. In Proceedings of the 9th International Conference on Artificial Intelligence and Statistics, Key West, Florida.
 
5
Meila, M. and Shi, J. B. 2001. A random walks view of spectral segmentation. In Proceedings of Eighth International Conference on Artificial Intelligence and Statistics, Key West, FL, January 4--7.
 
6
 
7
Luxburg, U. V., Bousquet, O., and Belkin, M. 2005. Limits of spectral clustering. Advances in Neural Information Processing Systems. Vol.17, pp.857--864.
 
8
 
9
 
10
 
11
 
12
Haralick, R. M., Shanmugam, K., and Dinstein, I. 1973. Texture features for image classification. IEEE Transactions on Systems, Man and Cybernet. pp.610--621.
 
13
Hu, Z. L., Guo, D. Z., and Sheng, Y. H. 2001. Extracting textural information of satellite SAR image based on wavelet decomposition. Journal of Remote Sensing. Vol.5, No.6, pp.423--427.
 
14

Collaborative Colleagues:
Xiuli Ma: colleagues
Wanggen Wan: colleagues
Licheng Jiao: colleagues