Feature selection for the tree-wavelet transform
In this paper we consider the wavelet decomposition of textured images with the aim to segment them. One of the key problems with using the tree-structured wavelet transform of an image is deciding how many branches of the tree are required for the accurate representation of the texture within the image, and which of these branches to use as features when clustering.
We describe here the use of two-point statistics to determine which features to select in the clustering procedure and termination of the wavelet decomposition. We present results on a set of composite Brodatz images.
KeywordsCluster Algorithm Wavelet Decomposition Image Encode Texture Segmentation Tree Wavelet
Unable to display preview. Download preview PDF.
- 1.T. Chang & C.C.J. Kuo, “Texture Analysis and Classification with tree-structured Wavelet transform”, IEEE Trans on Image Proc., 2, pp 429–441, 1993.Google Scholar
- 2.R. Coifman & M.V. Wickerhauser, “Entropy-Based Algorithm for Best Basis Selection”, IEEE Trans on Info Theory, 38, March 1992.Google Scholar
- 3.I. Daubechies, “The Wavelet Transform, Time-Frequency Localization and Signal Analysis”, IEEE Trans on Info Theory, 36, pp 961–1005, 1990.Google Scholar
- 4.I. Daubechies, “Ten Lectures on Wavelets”, SIAM, Philadelphia, 1992.Google Scholar
- 5.Y. Lin, T. Chang & C.C.J. Kuo, “Texture Segmentation Using Wavelet Packets”, SPIE, 2034, Mathematical Imaging, pp 277–286, 1993.Google Scholar
- 6.S. Mallat, “Multifrequency Channel Decomposition of Images and Wavelet Models”, IEEE Trans. on Acoustics, Speech and Sig. Proc., 37, pp 2091–2110, 1989.Google Scholar