Fast and accurate kernel density approximation using a divide-and-conquer approach
Fast and accurate kernel density approximation using a divide-and-conquer approach作者机构:School of Electronics and Computer Science and Technology North University of China Taiyuan 030051 China Department of Computer Science and Engineering The Hong Kong University of Science and Technology Hong Kong China Key Laboratory of Instrumentation Science and Dynamic Measurement North University of China Taiyuan 030051 China
出 版 物:《Journal of Zhejiang University-Science C(Computers and Electronics)》 (浙江大学学报C辑(计算机与电子(英文版))
年 卷 期:2010年第11卷第9期
页 面:677-689页
核心收录:
学科分类:0810[工学-信息与通信工程] 081203[工学-计算机应用技术] 08[工学] 0805[工学-材料科学与工程(可授工学、理学学位)] 0835[工学-软件工程] 0812[工学-计算机科学与技术(可授工学、理学学位)]
基 金:Project (No. 9140C1204060809) supported by the National Key Laboratory Foundation of China
主 题:Nonparametric clustering Kernel density estimation Mean shift Image filtering
摘 要:Density-based nonparametric clustering techniques,such as the mean shift algorithm,are well known for their flexibility and effectiveness in real-world vision-based *** underlying kernel density estimation process can be very expensive on large *** this paper,the divide-and-conquer method is proposed to reduce these computational *** dataset is first partitioned into a number of small,compact *** of the kernel estimator in each local cluster are then fit to a single,representative density *** key novelty presented here is the efficient derivation of the representative density function using concepts from function approximation,such that the expensive kernel density estimator can be easily summarized by a highly compact model with very few basis *** proposed method has a time complexity that is only linear in the sample size and data ***,the bandwidth of the resultant density model is adaptive to local data *** on color image filtering/segmentation show that,the proposed method is dramatically faster than both the standard mean shift and fast mean shift implementations based on kd-trees while