Efficient kernel density estimation using the fast gauss transform with applications to color modeling and tracking

@article{citeulike:2755972, abstract = {Many vision algorithms depend on the estimation of a probability density function from observations. Kernel density estimation techniques are quite general and powerful methods for this problem, but have a significant disadvantage in that they are computationally intensive. In this paper, we explore the use of kernel density estimation with the fast Gauss transform (FGT) for problems in vision. The FGT allows the summation of a mixture of ill Gaussians at N evaluation points in O(M+N) time, as opposed to O(MN) time for a naive evaluation and can be used to considerably speed up kernel density estimation. We present applications of the technique to problems from image segmentation and tracking and show that the algorithm allows application of advanced statistical techniques to solve practical vision problems in real-time with today's computers.}, author = {Elgammal, A. and Duraiswami, R. and Davis, L. S. }, booktitle = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, citeulike-article-id = {2755972}, doi = {10.1109/TPAMI.2003.1240123}, journal = {Pattern Analysis and Machine Intelligence, IEEE Transactions on}, keywords = {density, efficient, estimation, fast, gauss, kernel, transform}, number = {11}, pages = {1499--1504}, posted-at = {2008-05-05 11:20:56}, priority = {5}, title = {Efficient kernel density estimation using the fast gauss transform with applications to color modeling and tracking}, url = {http://dx.doi.org/10.1109/TPAMI.2003.1240123}, volume = {25}, year = {2003} }

TY - JOUR ID - citeulike:2755972 L3 - citeulike-article-id:2755972 TI - Efficient kernel density estimation using the fast gauss transform with applications to color modeling and tracking T2 - Pattern Analysis and Machine Intelligence, IEEE Transactions on JF - Pattern Analysis and Machine Intelligence, IEEE Transactions on VL - 25 IS - 11 SP - 1499 EP - 1504 N2 - Many vision algorithms depend on the estimation of a probability density function from observations. Kernel density estimation techniques are quite general and powerful methods for this problem, but have a significant disadvantage in that they are computationally intensive. In this paper, we explore the use of kernel density estimation with the fast Gauss transform (FGT) for problems in vision. The FGT allows the summation of a mixture of ill Gaussians at N evaluation points in O(M+N) time, as opposed to O(MN) time for a naive evaluation and can be used to considerably speed up kernel density estimation. We present applications of the technique to problems from image segmentation and tracking and show that the algorithm allows application of advanced statistical techniques to solve practical vision problems in real-time with today's computers. KW - density KW - efficient KW - estimation KW - fast KW - gauss KW - kernel KW - transform AU - Elgammal, A AU - Duraiswami, R AU - Davis, LS PY - 2003/// UR - http://dx.doi.org/10.1109/TPAMI.2003.1240123 ER -