Comparing distributions and shapes using the kernel distance

DOI10.1145/1998196.1998204MaRDI QIDQ5404407zbMATH OpenOpenAlexFDO

Authors Raj Varma Kommaraji, Jeff M. Phillips, Suresh Venkatasubramanian, Sarang Joshi

Publication date 24 March 2014

Published in Proceedings of the twenty-seventh annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1998196.1998204

zbMATH Keywords

distributionsmetricsshape matchingkernel distance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• A spectral notion of Gromov-Wasserstein distance and related methods
• Gromov-Wasserstein distances and the metric approach to object matching
• Computing the Monge-Kantorovich distance
• Computable Elastic Distances Between Shapes
• scientific article; zbMATH DE number 2209711

Cited in

(25)

• Continuous Procrustes distance between two surfaces
• scientific article; zbMATH DE number 7559228 (Why is no real title available?)
• A kernel distance-based representative subset selection method
• scientific article; zbMATH DE number 7758314 (Why is no real title available?)
• scientific article; zbMATH DE number 1844598 (Why is no real title available?)
• The VC dimension of metric balls under Fréchet and Hausdorff distances
• Witnessed \(k\)-distance
• scientific article; zbMATH DE number 2062646 (Why is no real title available?)
• A learning shape distance based on mean first-passage time
• Subsampling in smoothed range spaces
• Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points
• Coresets for kernel clustering
• Confidence sets for persistence diagrams
• A spectral notion of Gromov-Wasserstein distance and related methods
• A Euclidean embedding for computing persistent homology with Gaussian kernels
• Distances and means of direct similarities
• Near-optimal coresets of kernel density estimates
• Approximating \(L_1\)-distances between mixture distributions using random projections
• WFEM heat kernel: Discretization and applications to shape analysis and retrieval
• Near-optimal coresets of kernel density estimates
• Dimension-independent kernel -covers
• Distance measures for point sets and their computation
• Coarse geometric kernels for networks embedding
• Mixed-type distance shrinkage and selection for clustering via kernel metric learning
• Core-sets: updated survey

This page was built for publication: Comparing distributions and shapes using the kernel distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404407)