Comparing distributions and shapes using the kernel distance

DOI10.1145/1998196.1998204zbMATH Open1283.68368OpenAlexW2025822499MaRDI QIDQ5404407FDOQ5404407

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

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

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

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)

Cited In (14)

• Title not available (Why is that?)
• A kernel distance-based representative subset selection method
• Title not available (Why is that?)
• Title not available (Why is that?)
• The VC dimension of metric balls under Fréchet and Hausdorff distances
• Title not available (Why is that?)
• Core-Sets: Updated Survey
• Title not available (Why is that?)
• Coresets for kernel clustering
• Confidence sets for persistence diagrams
• Subsampling in Smoothed Range Spaces
• Near-optimal coresets of kernel density estimates
• Distance measures for point sets and their computation
• Coarse geometric kernels for networks embedding

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)