By Topic

Color and/or texture segmentation using deterministic relaxation and fast marching algorithms

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

3 Author(s)
Liapis, S. ; Dept. of Comput. Sci., Crete Univ., Greece ; Sifakis, E. ; Tziratas, G.

The segmentation of colored texture images is considered. Either luminance, color, and/or texture features could be used for segmentation. For luminance and color the classes are described using the corresponding empirical probability distributions. The discrete wavelet frames analysis is used for obtaining features of texture patterns. At a first stage, pattern analysis is performed for extracting the features using the Bhattacharya distance. Two labeling algorithms are proposed. A deterministic relaxation algorithm using a likelihood based distance yields the labeling of pixels to the different color-texture patterns. In addition, a multi-label fast marching level set algorithm is utilized for the determination of the segment boundaries

Published in:

Pattern Recognition, 2000. Proceedings. 15th International Conference on  (Volume:3 )

Date of Conference:

2000