Share Email Print

Proceedings Paper

Using kernel principal components for color image segmentation
Author(s): Slawo Wesolkowski
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Distinguishing objects on the basis of color is fundamental to humans. In this paper, a clustering approach is used to segment color images. Clustering is usually done using a single point or vector as a cluster prototype. The data can be clustered in the input or feature space where the feature space is some nonlinear transformation of the input space. The idea of kernel principal component analysis (KPCA) was introduced to align data along principal components in the kernel or feature space. KPCA is a nonlinear transformation of the input data that finds the eigenvectors along which this data has maximum information content (or variation). The principal components resulting from KPCA are nonlinear in the input space and represent principal curves. This is a necessary step as colors in RGB are not linearly correlated especially considering illumination effects such as shading or highlights. The performance of the k-means (Euclidean distance-based) and Mixture of Principal Components (vector angle-based) algorithms are analyzed in the context of the input space and the feature space obtained using KPCA. Results are presented on a color image segmentation task. The results are discussed and further extensions are suggested.

Paper Details

Date Published: 21 November 2002
PDF: 10 pages
Proc. SPIE 4790, Applications of Digital Image Processing XXV, (21 November 2002); doi: 10.1117/12.453858
Show Author Affiliations
Slawo Wesolkowski, Univ. of Waterloo (Canada)

Published in SPIE Proceedings Vol. 4790:
Applications of Digital Image Processing XXV
Andrew G. Tescher, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?