Texture segmentation using hierarchical wavelet decomposition

Texture segmentation deals with identification of regions where distinct textures exist. In this paper, a new scheme for texture segmentation using hierarchical wavelet decomposition is proposed. In the first step, using Daubechies' 4-tap filter, an original image is decomposed into three detailed images and one approximate image. The decomposition can be recursively applied to the approximate image to generate a lower resolution of the pyramid. The segmentation starts at the lowest resolution using the K-means clustering scheme and the result is propagated through the pyramid to a higher one with continuously improving segmentation.

[1]  I. Daubechies Orthonormal bases of compactly supported wavelets , 1988 .

[2]  Alexander A. Sawchuk,et al.  Unsupervised textured image segmentation using feature smoothing and probabilistic relaxation techniques , 1989, Comput. Vis. Graph. Image Process..

[3]  Michael Unser,et al.  Multiresolution Feature Extraction and Selection for Texture Segmentation , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Stéphane Mallat,et al.  A Theory for Multiresolution Signal Decomposition: The Wavelet Representation , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Charles A. Bouman,et al.  Multiple Resolution Segmentation of Textured Images , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Anil K. Jain,et al.  Unsupervised texture segmentation using Gabor filters , 1990, 1990 IEEE International Conference on Systems, Man, and Cybernetics Conference Proceedings.

[7]  S. R. Rotman,et al.  Texture classification using the cortex transform , 1992, CVGIP Graph. Model. Image Process..