Abstract
The time complexity of the adaptive mean shift is related to the dimension of data and the number of iterations. The amount of computation will increase prohibitively 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. The data-driven bandwidth selection for multivariate data is used in mean shift procedure, and an adaptive mean shift based on LSH with bandwidth estimation (LSH-PE-AMS) algorithm is proposed. 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Optik - International Journal for Light and Electron Optics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
