loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
15th International Conference on Pattern Recognition (ICPR'00) - Volume 3
Color and/or Texture Segmentation Using Deterministic Relaxation and Fast Marching Algorithms
Barcelona, Spain
September 03-September 08
ISBN: 0-7695-0750-6
S. Liapis, University of Crete and FORTH
E. Sifakis, University of Crete and FORTH
G. Tziritas, University of Crete and FORTH
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 likelihood based distance yields the labeling of pixels to the different color-texture patterns. In addition, a new multi-label fast marching level set algorithm is utilized for the determination of the segment boundaries.
Citation:
S. Liapis, E. Sifakis, G. Tziritas, "Color and/or Texture Segmentation Using Deterministic Relaxation and Fast Marching Algorithms," icpr, vol. 3, pp.3621, 15th International Conference on Pattern Recognition (ICPR'00) - Volume 3, 2000
Usage of this product signifies your acceptance of the Terms of Use.