Algorithm of Adaptive Kernel-Bandwidth for Mean-Shift Based on Boundary Force
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    An adaptive scale updating algorithm based on boundary force is presented to improve the deficiency that the kernel-bandwidth of Mean-Shift is not changeable. Based on the analysis of weighted histogram of the target feature, this paper introduces a region likelihood to extract local information of the target. Then, by comparing the region likelihood in successive frames, it constructs a boundary force to locate the boundary points of the target model and updates the bandwidth of kernel-function adaptively. The experimental results show that the proposed method improves the effect of Mean-Shift when the size or shape of target changes and satisfies the real-time request.

    Reference
    Related
    Cited by
Get Citation

覃 剑,曾孝平,李勇明.基于边界力的Mean-Shift 核窗宽自适应算法.软件学报,2009,20(7):1726-1734

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:July 09,2007
  • Revised:February 27,2008
  • Adopted:
  • Online:
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063