%0 Conference Paper
%B Computer Vision, 2003. Proceedings. Ninth IEEE International Conference on
%D 2003
%T Improved fast gauss transform and efficient kernel density estimation
%A Yang,C.
%A Duraiswami, Ramani
%A Gumerov, Nail A.
%A Davis, Larry S.
%K adaptive
%K algorithm;multivariate
%K complexity;computer
%K complexity;Gaussian
%K computational
%K density
%K estimation;mean
%K expansion
%K Gauss
%K processes;computational
%K recognition;quadratic
%K scheme;pattern
%K shift
%K space
%K subdivision
%K technique;computer
%K theory;
%K transform;kernel
%K vision;estimation
%K vision;fast
%X Evaluating sums of multivariate Gaussians is a common computational task in computer vision and pattern recognition, including in the general and powerful kernel density estimation technique. The quadratic computational complexity of the summation is a significant barrier to the scalability of this algorithm to practical applications. The fast Gauss transform (FGT) has successfully accelerated the kernel density estimation to linear running time for low-dimensional problems. Unfortunately, the cost of a direct extension of the FGT to higher-dimensional problems grows exponentially with dimension, making it impractical for dimensions above 3. We develop an improved fast Gauss transform to efficiently estimate sums of Gaussians in higher dimensions, where a new multivariate expansion scheme and an adaptive space subdivision technique dramatically improve the performance. The improved FGT has been applied to the mean shift algorithm achieving linear computational complexity. Experimental results demonstrate the efficiency and effectiveness of our algorithm.
%B Computer Vision, 2003. Proceedings. Ninth IEEE International Conference on
%P 664 -671 vol.1 - 664 -671 vol.1
%8 2003/10//
%G eng
%R 10.1109/ICCV.2003.1238383