|
Published Articles >> Table of Contents >> Abstract
15th International Conference on Pattern Recognition (ICPR'00) - Volume 3
p. 3621
Color and/or Texture Segmentation Using Deterministic Relaxation and Fast Marching Algorithms
S. Liapis, University of Crete and FORTH
E. Sifakis, University of Crete and FORTH
G. Tziritas, University of Crete and FORTH
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPR.2000.903621
Send link to a friend
| Abstract |
|
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.
|
 Additional Information
|
Citation:
S. Liapis, E. Sifakis, G. Tziritas,
"Color and/or Texture Segmentation Using Deterministic Relaxation and Fast Marching Algorithms,"
icpr,
p. 3621,
15th International Conference on Pattern Recognition (ICPR'00) - Volume 3,
2000
|
|
