Abstract
Mean shift is an effective iterative algorithm widely used in clustering, tracking, segmentation, discontinuity preserving smoothing, filtering, edge detection, and information fusion etc. However, its convergence, a key property of any iterative method, has not been rigorously proved till now. In this paper, the traditional mean shift algorithm is first extended to account for both the local property at different sampling points and the anisotropic property at differe nt directions, then a rigorous convergence proof is provided under these extended conditions. Finally, some approaches to adaptively selecting the algorithm's parameters are outlined. The results in this paper contribute substantially to the establishment of a sound theoretical foundation for the 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 callDisclaimer: 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.
