Mean shift is a bound optimization.

Published

Journal Article

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.

Full Text

Duke Authors

Tomasi, Carlo

Cited Authors

Fashing, M; Tomasi, C

Published Date

March 2005

Published In

Ieee Transactions on Pattern Analysis and Machine Intelligence

Volume / Issue

27 / 3

Start / End Page

471 - 474

PubMed ID

15747802

Pubmed Central ID

15747802

Electronic International Standard Serial Number (EISSN)

1939-3539

International Standard Serial Number (ISSN)

0162-8828

Digital Object Identifier (DOI)

10.1109/tpami.2005.59

Language

eng