Back to articles
Volume: 4 | Article ID: art00106
Kernel Based Spectral Image Segmentation
  DOI :  10.2352/CGIV.2008.4.1.art00106  Published OnlineJanuary 2008

In this work, we propose a new algorithm for spectral image segmentation based on the use of a kernel matrix. An efficient multiscale method is presented for accelerating spectral image segmentation. The multiscale strategy uses the lattice geometry of images to construct an image pyramid whose hierarchy provides a framework for rapidly estimating eigenvectors of normalized kernel matrices. To prevent the boundaries from deteriorating, the image size on the top level of the pyramid is generally required to be around 75×75, where the eigenvectors of normalized kernel matrices would be approximately solved by the Nyström method. Within this hierarchical structure, the coarse solution is increasingly propagated to finer levels and is refined using subspace iteration. Experimental results have shown that the proposed method can perform significantly well in spectral image segmentation as well as speed up the approximation of the eigenvectors of normalized kernel matrices.

Subject Areas :
Views 4
Downloads 0
 articleview.views 4
 articleview.downloads 0
  Cite this article 

Hongyu Li, Vladimir Bochko, Timo Jaaskelainen, Jussi Parkkinen, I-Fan Shen, "Kernel Based Spectral Image Segmentationin Proc. IS&T CGIV 2008/MCS'08 4th European Conf. on Colour in Graphics, Imaging, and Vision 10th Int'l Symp. on Multispectral Colour Science,  2008,  pp 494 - 498,

 Copy citation
  Copyright statement 
Copyright © Society for Imaging Science and Technology 2008
Conference on Colour in Graphics, Imaging, and Vision
conf colour graph imag vis
Society of Imaging Science and Technology
7003 Kilworth Lane, Springfield, VA 22151, USA