By Topic

Intensity-invariant color image segmentation using MPC algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wesolkowski, S. ; Syst. Design Eng., Waterloo Univ., Ont., Canada ; Jernigan, M.E.

In this paper, two unsupervised color image segmentation methods based on color clustering are explored: k-means (KM) and mixture of principal components (MPC). KM and MPC use respectively the Euclidean distance and the vector angle as color similarly measures. It is shown that the vector angle is an intensity-invariant measure in RGB based on the dichromatic reflectance model. Results are given for various color spaces: RGB, XYZ, rgb (normalized RGB), CIELAB, CIELUV, h1h2h3 (a new space), and l1l2l3. Quantitative and qualitative results show the effectiveness of the MPC algorithm on the RGB, rgb, and XYZ color spaces whereas the KM combination seems most effective in the CIELAB, h1h2h3, and l1l2l3 color spaces. Finally, poor color clustering results with MPC in h1h2h3 and with KM in rgb suggest that some assumptions in deriving a simplified version of Shafer's model for matte surfaces might have been violated.

Published in:

Neural Networks, 2003. Proceedings of the International Joint Conference on  (Volume:1 )

Date of Conference:

20-24 July 2003