Fast k-nearest neighbor search algorithm based on pyramid structure of wavelet transform and its application to texture classification

  • Authors:
  • Yu-Long Qiao;Zhe-Ming Lu;Jeng-Shyang Pan;Sheng-He Sun

  • Affiliations:
  • College of Information and Communication Engineering, Harbin Engineering University, Harbin, China and Department of Automatic Test and Control, Harbin Institute of Technology, Harbin, China;School of Aeronautics and Astronautics, Zhejiang University, Hangzhou, China;Department of Electronic Engineering, National Kaohsiung University of Applied Sciences, Taiwan;Department of Automatic Test and Control, Harbin Institute of Technology, Harbin, China

  • Venue:
  • Digital Signal Processing
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.