Comparing distributions and shapes using the kernel distance

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2011, Pages 47-56

  Joshi, Sarang ^a   Kommaraju, Raj Varma ^b   Phillips, Jeff M ^a   Venkatasubramanian, Suresh ^a  

^a UNIVERSITY OF UTAH   (United States)

^b MICROSOFT   (United States)

Author keywords

Algorithms; Theory

Indexed keywords

ALGORITHMIC ANALYSIS; COMPLEX OBJECTS; DISTANCE METRICS; GEOMETRIC MEASURE THEORY; ISOMETRIC EMBEDDINGS; KERNEL DISTANCE; NEAR-LINEAR TIME; POINT SET; POLYNOMIAL-TIME ALGORITHMS; QUADRATIC TIME; RICH STRUCTURE; RIGID TRANSFORMATIONS; SHAPE ANALYSIS; SIMILARITY FUNCTIONS; SPARSE REPRESENTATION; THEORY; TWO-POINT;

APPROXIMATION ALGORITHMS; COMPUTATIONAL GEOMETRY;

PROBABILITY DISTRIBUTIONS;

EID: 79960192500     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1998196.1998204     Document Type: Conference Paper

References (48)

1. Noga Alon, Shai Ben-David, Nocolò Cesa-Bianchi, and David Haussler. Scale-sensitive dimensions, uniform convergence, and learnability. Journal of ACM, 44:615-631, 1997. (Pubitemid 127617707)
2. Alexandr Andoni, Khanh Do Ba, Piotr Indyk, and David Woodruff Efficient sketches for Earth-mover distance, with applications. In 50th Annual Symp. Foundations of Computer Science, 2009.
3. Alexandr Andoni and Piotr Indyk. Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In 47th Annual Symp. Foundations of Computer Science, 2006.
4. Alexandr Andoni, Piotr Indyk, and Robert Krauthgamer. Earth mover distance over high-dimensional spaces. In Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms, 2008.
5. N. Aronszajn. Theory of reproducing kernels. Transactions AMS, 68:337-404, 1950.
6. Nikhil Bansal. Constructive algorithms for discrepancy minimization. In Proc. 51st IEEE Symp. Foundations of Computer Science, 2010.
7. Peter L. Bartlett, Philip M. Long, and Robert C. Williamson. Fat-shattering and the learnability of real-valued functions. Journal of Computer and System Sciences, 52(3):434-452, 1996. (Pubitemid 126359770)
8. Sergio Cabello, Panos Giannopoulos, Christian Knauer, and Günter Rote. Matching point sets with respect to the earth mover's distance. Computational Geometry, 39:118-133, 2008. (Pubitemid 350010327)
9. Paul B. Callahan and S. Rao Kosaraju. A decomposition of multidimensional point sets with applicatrions to k-nearest neighbors and n-body potential fields. Journal of ACM, 42:67-90, 1995.
10. Moses Charikar, Alantha Newman, and Aleksandar Nikolov. Tight hardness results for minimizing discrepancy. In Proceedings 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, 2011.
11. Bernard Chazelle. The Discrepancy Method. Cambridge University Press, 2000.
12. Bernard Chazelle and Jiri Matousek. On linear-time deterministic algorithms for optimization problems in fixed dimensions. Journal of Algorithms, 21:579-597, 1996. (Pubitemid 126411479)
13. Bernard Chazelle and Emo Welzl. Quasi-optimal range searching in spaces of Finite VC-dimension. Discrete and Computational Geometry, 4:467-489, 1989.
14. Kenneth L. Clarkson. Fast algorithms for the all nearest neighbors problem. In Proceedings 34th Annual Symposium on Foundations of Computer Science, 1983.
15. Luc Devroye, László Györfi, and Gábor Lugosi. A Probabilistic Theory of Pattern Recognition. Springer-Verlag, 1996.
16. Michel Marie Deza and Monique Laurent. Geometry of Cuts and Metrics. Springer, 1997.
17. Stanley Durrleman, Xavier Pennec, Alain Trouvé, and Nicholas Ayache. Sparse approximation of currents for statistics on curves and surfaces. In 11th International Conference on Medical Image Computing and Computer Assisted Intervention, 2008.
18. Joan Glaunès. Transport par dié;omorphismes de points, de mesures et de courants pour la comparaison de formes et l'anatomie numérique. PhD thesis, Universite Paris 13, 2005.
19. Joan Glaunès and Sarang Joshi. Template estimation form unlabeled point set data and surfaces for computational anatomy. In Math. Found. Comp. Anatomy, 2006.
20. Leslie Greengard and John Strain. The fast Gauss transform. Journal Scientific and Statistical Computing, 12, 1991.
21. Sariel Har-Peled. Approximation Algorithms in Geometry. http://valis.cs.uiuc.edu/~sariel/teach/notes/aprx/.
22. David Haussler. Sphere packing numbers for subsets of the boolean n-cube with bounded Vapnik-Chervonenkis dimension. Journal of Combinatorial Theory, Series A, 69:217-232, 1995.
23. Matrial Hein and Olivier Bousquet. Hilbertian metrics and positive definite kernels on probability measures. In Proceedings 10th International Workshop on Artificial Intelligence and Statistics, 2005.
24. William B. Johnson and Joram Lindenstrauss. Extensions of Lipschitz maps into a Hilbert space. Contemporary Mathematics, 26:189-206, 1984.
25. Michael Kerns and Robert E. Shapire. Efficient distribution-free learning of probabilistic concepts. Journal of Computer and System Sciences, 48:464-497, 1994.
26. Yi Li, Philip M. Long, and Aravind Srinivasan. Improved bounds on the samples complexity of learning. Journal of Computer and System Science, 62:516-527, 2001. (Pubitemid 32444150)
27. Maarten Löffler and Jeff M. Phillips. Shape fitting on point sets with probability distributions. In Proceedings 17th Annual European Symposium on Algorithms, 2009.
28. Jiri Matoušek. Approximations and optimal geometric divide-and-conquer. In Proceedings 23rd Symposium on Theory of Computing, pages 505-511, 1991.
29. Jiri Matoušek. Tight upper bounds for the discrepancy of halfspaces. Discrete and Computational Geometry, 13:593-601, 1995.
30. Jiri Matoušek. Geometric Discrepancy. Springer, 1999.
31. Jiri Matoušek, Emo Welzl, and Lorenz Wernisch. Discrepancy and approximations for bounded VC-dimension. Combinatorica, 13:455-466, 1993.
32. Alfred Müller. Integral probability metrics and their generating classes of functions. Advances in Applied Probability, 29:429-443, 1997. (Pubitemid 127554412)
33. Aleksandar Nikolov. Personal communication, 2011.
34. Jeff M. Phillips. Algorithms for ε-approximations of terrains. In Proceedings 35th International Colloquium on Automata, Languages, and Programming, 2008.
35. Jeff M. Phillips and Suresh Venkatasubramanian. A gentle introduction to the kernel distance. Technical report, arXiv:1103.1625, 2011.
36. Ali Rahimi and Benjamin Recht. Random features for large-scale kernel machines. In Neural Informations Processing Systems, 2007.
37. W. Rudin. Fourier analysis on groups. Wiley-Interscience, 1962.
38. Sameer Shirdhonkar and David W. Jacobs. Approximate Earth mover's distance in linear time. In Proceedings IEEE Conference on Computer Vision and Pattern Recognition, 2008.
39. Alex J. Smola, Arthur Gretton, Le Song, and Bernhard Schölkopf. A Hilbert space embedding for distributions. In Proceedings of Algorithmic Learning Theory, 2007.
40. Le Song, Byron Boots, Sajid Siddiqi, Geoffrey Gordon, and Alex J. Smola. Hilbert space embeddings of hidden markov models. In Proceedings of International Conference on Machine Learning, 2010.
41. Bharath K. Sriperumbudur, Arthur Gretton, Kenji Fukumizu, Bernhard Schölkopf, and Gert R. G. Lanckriet. Hilbert space embeddings and metrics on probability measures. Journal of Machine Learning Research, 11:1517-1561, 2010.
42. Ch. Suquet. Distances Euclidiennes sur les measures signées et application àdes théorèmes de Berry-Esséen. Bulletin Belgium Mathetics Society, 2:161-181, 1995.
43. Subhash Suri, Csaba D. Tóth, and Yunhong Zhou. Range counting over multidimensional data streams. In Proceedings 20th Symposium on Computational Geometry, pages 160-169, 2004.
44. M. Talagrand. Sharper bounds for Gaussian and emperical processes. Annals of Probability, 22:76, 1994.
45. Marc Vaillant and Joan Glaunès. Surface matching via currents. In Proceedings Information Processing in Medical Imaging, volume 19, pages 381-92, 2005. (Pubitemid 41425331)
46. Vladimir Vapnik. Inductive principles of the search for emperical dependencies. In Proceedings of the Second Annual Workshop on Computational Learning Theory, pages 3-21, 1989.
47. Vladimir Vapnik and Alexey Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16:264-280, 1971.
48. C. Yang, R. Duraiswami, N.A. Gumerov, and L. Davis. Improved fast Gauss transform and efficient kernel density estimation. In Proceedings 9th International Conference on Computer Vision, pages 664-671, 2003.