Ten lectures on wavelets
Texture Features for Browsing and Retrieval of Image Data
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Fast Algorithm for the Nearest-Neighbor Classifier
IEEE Transactions on Pattern Analysis and Machine Intelligence
A fast vector quantization encoding method using wavelet transform
Pattern Recognition Letters
Vector quantization for multiple classes
Information Sciences: an International Journal
Texture classification using non-separable two-dimensional wavelets
Pattern Recognition Letters
A Fast Nearest-Neighbor Algorithm Based on a Principal Axis Search Tree
IEEE Transactions on Pattern Analysis and Machine Intelligence
Properties of the multiscale maxima and zero-crossingsrepresentations
IEEE Transactions on Signal Processing
Statistical texture characterization from discrete wavelet representations
IEEE Transactions on Image Processing
A fast search algorithm for vector quantization using L2-norm pyramid of codewords
IEEE Transactions on Image Processing
Fast-searching algorithm for vector quantization using projection and triangular inequality
IEEE Transactions on Image Processing
Spectral clustering with fuzzy similarity measure
Digital Signal Processing
Hierarchical Correlation of Multi-Scale Spatial Pyramid for Similar Mammogram Retrieval
International Journal of Digital Library Systems
Hi-index | 0.00 |
Traditional fast k-nearest neighbor search algorithms based on pyramid structures need either many extra memories or long search time. This paper proposes a fast k-nearest neighbor search algorithm based on the wavelet transform, which exploits the important information hiding in the transform coefficients to reduce the computational complexity. The study indicates that the Haar wavelet transform brings two kinds of important pyramids. Two elimination criteria derived from the transform coefficients are used to reject those impossible candidates. Experimental results on texture classification verify the effectiveness of the proposed algorithm.