meanshift算法详解.pptVIP

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Mean-Shift Object TrackingTarget Localization Algorithm Start from the position of the model in the current frame Search in the model’s neighborhood in next frame Find best candidate by maximizing a similarity func. Linear approx. (around y0) Mean-Shift Object TrackingApproximating the Similarity Function Model location: Candidate location: Independent of y Density estimate! (as a function of y) Mean-Shift Object TrackingMaximizing the Similarity Function The mode of = sought maximum Important Assumption: One mode in the searched neighborhood The target representation provides sufficient discrimination Mean-Shift Object TrackingApplying Mean-Shift Original Mean-Shift: Find mode of using The mode of = sought maximum Extended Mean-Shift: Find mode of using Mean-Shift Object TrackingAbout Kernels and Profiles A special class of radially symmetric kernels: The profile of kernel K Extended Mean-Shift: Find mode of using Mean-Shift Object TrackingChoosing the Kernel Epanechnikov kernel: A special class of radially symmetric kernels: Extended Mean-Shift: Uniform kernel: Mean-Shift Object TrackingAdaptive Scale Problem: The scale of the target changes in time The scale (h) of the kernel must be adapted Solution: Run localization 3 times with different h Choose h that achieves maximum similarity Mean-Shift Object TrackingResults Feature space: 16?16?16 quantized RGB Target: manually selected on 1st frame Average mean-shift iterations: 4 Mean-Shift Object TrackingResults Partial occlusion Distraction Motion blur Mean-Shift Object TrackingResults Mean-Shift Object TrackingResults Feature space: 128?128 quantized RG Mean-Shift Object TrackingThe Scale Selection Problem Kernel too big Kernel too small Poor localization h mustn’t get too big or too small! Problem: In uniformly colored regions, similarity is invariant to h Smaller h may achieve better similarity Nothing keeps h