QQ客服 官方微博 反馈留言

	Fast dynamic Gaussian mean-shift algorithm based on adaptive bandwidth
	Zhou Fang-fang ; Fan Xiao-ping ; Ye Zhen
	2010-10-12 ; 2010-10-12
关键词	Practical Theoretical or Mathematical/ computer vision Gaussian processes image segmentation/ Gaussian mean-shift algorithm adaptive bandwidth Gaussian kernel mean-shift algorithm kernel density estimation adaptive space discretization/ B6135 Optical, image and video signal processing B0240Z Other topics in statistics C5260B Computer vision and image processing techniques C1140Z Other topics in statistics
中文摘要	The Gaussian kernel mean-shift algorithm which is deduced from kernel density estimation has not been widely employed in applications because of its low convergence rate. We propose a dynamic mean-shift algorithm based on adaptive bandwidth. The number of data sets is reduced by adaptive space discretization; the convergence rate is improved by dynamically updating the data set, and the efficiency is promoted by replacing the overlapping points with a special point in the iterations. The anisotropic bandwidth is updated according to the diameter of the data set. Experiments validate the improvement of the convergence rate of Gaussian mean-shift with lower complexity in computation.
语种	中文
出版者	South China University of Technology ; China
内容类型	期刊论文
源URL	[http://hdl.handle.net/123456789/82691]
专题	清华大学
推荐引用方式 GB/T 7714	Zhou Fang-fang,Fan Xiao-ping,Ye Zhen. Fast dynamic Gaussian mean-shift algorithm based on adaptive bandwidth[J],2010, 2010.
APA	Zhou Fang-fang,Fan Xiao-ping,&Ye Zhen.(2010).Fast dynamic Gaussian mean-shift algorithm based on adaptive bandwidth..
MLA	Zhou Fang-fang,et al."Fast dynamic Gaussian mean-shift algorithm based on adaptive bandwidth".(2010).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。