An Adaptive Mean Shift Algorithm Based on LSH

The time complexity of the adaptive mean shift is related to the dimension of data and the number of iterations. The computational complexity will increase proportionally with the increase of the data dimension. An approximate neighborhood queries method is presented for the computation of high dimensional data, in which, the locality-sensitive hashing (LSH) is used to reduce the computational complexity of the adaptive mean shift algorithm. Experimental results show that the proposed algorithm can reduce the complexity of the adaptive mean shift algorithm and can produce a more accurate classification than the fixed bandwidth mean shift algorithm.