Improved fast gauss transform and efficient kernel density estimation
The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
Mean shift: a robust approach toward feature space analysis
Comaniciu, D., & Meer, P. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.1000236 · Cited by 11,305
On Estimation of a Probability Density Function and Mode
Parzen, E. (1962) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177704472 · Cited by 10,585
A fast algorithm for particle simulations
Greengard, L., & Rokhlin, V (1987) · Journal of Computational Physics · doi:10.1016/0021-9991(87)90140-9 · Cited by 4,868
Remarks on Some Nonparametric Estimates of a Density Function
Rosenblatt, M. (1956) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177728190 · Cited by 4,547
Learning With Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Williams, C. K. I. (2003) · Journal of the American Statistical Association · doi:10.1198/jasa.2003.s269 · Cited by 4,281
Mean shift, mode seeking, and clustering
Cheng, Y. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.400568 · Cited by 3,856
Abe, S. (2001) · Springer eBooks · doi:10.1007/978-1-4471-0285-4 · Cited by 3,721
Cited by
Point Set Registration: Coherent Point Drift
Myronenko, A., & Song, X. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.46 · Cited by 2,762
Accelerating t-SNE using tree-based algorithms
van der Maaten, L. (2014) · doi:10.5555/2627435.2697068 · Cited by 2,226
Robust Point Set Registration Using Gaussian Mixture Models
Jian, B., & Vemuri, B. C. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.223 · Cited by 975
Classification using intersection kernel support vector machines is efficient
Maji, S., Berg, A. C., & Malik, J. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587630 · Cited by 940
Quick Shift and Kernel Methods for Mode Seeking
Vedaldi, A., & Soatto, S. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88693-8_52 · Cited by 890
A Geodesic Framework for Fast Interactive Image and Video Segmentation and Matting
Bai, X., & Sapiro, G. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408931 · Cited by 438
“, PF (x) = Pr(x|F) Pr(x|F)+Pr(x|B) , where Pr(x|F) is the color PDF of ΩF , obtained via the fast kernel density estimation ([21]) (same process for the background PDF).”
MethodFast High‐Dimensional Filtering Using the Permutohedral Lattice
Adams, A., Baek, J., & Davis, M. A. (2010) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2009.01645.x · Cited by 394
Entropy Minimization for Shadow Removal
Finlayson, G. D., Drew, M. S., & Lu, C. (2009) · International Journal of Computer Vision · doi:10.1007/s11263-009-0243-z · Cited by 349
Image and Video Matting: A Survey
Wang, J., & Cohen, M. F. (2007) · Foundations and Trends® in Computer Graphics and Vision · doi:10.1561/0600000019 · Cited by 329
Efficient Mean-Shift Tracking via a New Similarity Measure
Yang, C., Duraiswami, R., & Davis, L. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.139 · Cited by 313
Geodesic Matting: A Framework for Fast Interactive Image and Video Segmentation and Matting
Bai, X., & Sapiro, G. (2009) · International Journal of Computer Vision · doi:10.1007/s11263-008-0191-z · Cited by 304
Independent Component Analysis-Based Background Subtraction for Indoor Surveillance
Tsai, D.-M., & Lai, S.-C. (2009) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.2007558 · Cited by 279
A new method for the registration of three-dimensional point-sets: The Gaussian Fields framework
Boughorbel, F., Mercimek, M., Koschan, A., & Abidi, M. (2010) · Image and Vision Computing · doi:10.1016/j.imavis.2009.05.003 · Cited by 31
“Published by Elsevier B.V.”
Zhang, J., Nolte, N., Sadhukhan, R., Chen, B., & Bottou, L. (2024) · arXiv · doi:10.48550/arxiv.2405.06394 · Cited by 10
Metadata
- Authors
- Yang, Duraiswami, Gumerov, & Davis
- Venue
- Proceedings Ninth IEEE International Conference on Computer Vision
- Publisher
- IEEE
- Published
- 2003
- Pages
- 664-671 vol.1
- OpenAlex
- W2097998671
- Cited by
- 399
- References
- 20
- FWCI
- 11.01
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.