Mean Shift Is a Bound Optimization.
Lists
Only you see this
Abstract
We build on the current understanding of mean shift as an optimization procedure. We demonstrate that, in the case of piecewise constant kernels, mean shift is equivalent to Newton's method. Further, we prove that, for all kernels, the mean shift procedure is a quadratic bound maximization.
BibTeX
@article{fashing2005mean,
author = {Mark Fashing and Carlo Tomasi},
title = {{Mean Shift Is a Bound Optimization.}},
journal = {IEEE Trans. Pattern Anal. Mach. Intell.},
year = {2005},
url = {https://openreview.net/forum?id=roI-TbBe_pH},
}Loading related content...