DMCA
Mean shift is a bound optimization (2005)
Cached
Download Links
- [www.cs.duke.edu]
- [www.math.ucf.edu]
- [www.cse.psu.edu]
- DBLP
Other Repositories/Bibliography
by
Mark Fashing
,
Carlo Tomasi
| Venue: | IEEE Transactions on Pattern Analysis and Machine Intelligence |
| Citations: | 46 - 0 self |
BibTeX
@ARTICLE{Fashing05meanshift,
author = {Mark Fashing and Carlo Tomasi},
title = {Mean shift is a bound optimization},
journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
year = {2005},
volume = {27},
pages = {471--474}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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. Index Terms—Mean shift, bound optimization, Newton’s method, adaptive gradient descent, mode seeking.
