Half Quadratic Analysis for Mean Shift: With Extension to a Sequential Data Mode-Seeking Method
Abstract
Theoretical understanding and extension of mean shift procedure has received much attention recently [8, 18, 3]. In this paper, we present a theoretical exploration and an algorithm development on mean shift. In the theory part, we point out that convex profile based mean shift can be justified from the viewpoint of half-quadratic (HQ) optimization. Such analysis facilitates the convergence study and uni-mode bandwidth selection for the latest variation, annealed mean shift [18]. In the algorithm development part of this paper, we extend annealed mean shift inside our HQ framework to a novel method, namely adaptive mean shift (Ada-MS), to detect multiple data modes sequentially from an arbitrary starting point in linear running time. To validate the performance, we couple the investigation with two applications: image segmentation and color constancy. Extensive experiments show that the proposed method is time efficientlycient and initialization invariant.
Cite
Text
Yuan and Li. "Half Quadratic Analysis for Mean Shift: With Extension to a Sequential Data Mode-Seeking Method." IEEE/CVF International Conference on Computer Vision, 2007. doi:10.1109/ICCV.2007.4408979Markdown
[Yuan and Li. "Half Quadratic Analysis for Mean Shift: With Extension to a Sequential Data Mode-Seeking Method." IEEE/CVF International Conference on Computer Vision, 2007.](https://mlanthology.org/iccv/2007/yuan2007iccv-half/) doi:10.1109/ICCV.2007.4408979BibTeX
@inproceedings{yuan2007iccv-half,
title = {{Half Quadratic Analysis for Mean Shift: With Extension to a Sequential Data Mode-Seeking Method}},
author = {Yuan, Xiaotong and Li, Stan Z.},
booktitle = {IEEE/CVF International Conference on Computer Vision},
year = {2007},
pages = {1-8},
doi = {10.1109/ICCV.2007.4408979},
url = {https://mlanthology.org/iccv/2007/yuan2007iccv-half/}
}