Discriminative Features for Texture Retrieval Using Wavelet Packets

Abstract

Wavelet Packets (WPs) bases are explored seeking new discriminative features for texture indexing. The task of WP feature design is formulated as a learning decision problem by selecting the filter-bank structure of a basis (within a WPs family) that offers an optimal balance between estimation and approximation errors. To address this problem, a computationally efficient algorithm is adopted that uses the tree-structure of the WPs collection and the Kullback-Leibler divergence as a discrimination criterion. The adaptive nature of the proposed solution is demonstrated in synthetic and real data scenarios. With synthetic data, we demonstrate that the proposed features can identify discriminative bands, which is not possible with standard wavelet decomposition. With data with real textures, we show performance improvements with respect to the conventional Wavelet-based decomposition used under the same conditions and model assumptions.

Keywords

• Texture indexing
• wavelet packets
• minimum probability of error
• complexity regularization
• minimum cost tree pruning