The earth mover's distance as a metric for image retrieval

DOI10.1023/A:1026543900054zbMATH Open1012.68705OpenAlexW2143668817WikidataQ61783209 ScholiaQ61783209MaRDI QIDQ1859688FDOQ1859688

Authors: Yossi Rubner, Carlo Tomasi, Leonidas Guibas 

Publication date: 19 February 2003

Published in: International Journal of Computer Vision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1026543900054

Recommendations

• Perceptual metrics for image database navigation. Incl. 1 CD-ROM
• Empirical Evaluation of Dissimilarity Measures for Color and Texture
• Metric-preserving reduction of earth mover's distance
• The tangent earth mover's distance
• A linear approximate algorithm for Eerth mover's distance with thresholded ground distance

zbMATH Keywords

image retrievaltextureearth mover's distancecolorperceptual metrics

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Computing methodologies for image processing (68U10) Machine vision and scene understanding (68T45)

Cited In (only showing first 100 items - show all)

• A Klein-bottle-based dictionary for texture representation
• Ricci-Ollivier curvature of the rooted phylogenetic subtree-prune-regraft graph
• A multiscale sub-linear time Fourier algorithm for noisy data
• Optimal transport: discretization and algorithms
• Tracking people across disjoint camera views by an illumination-tolerant appearance representation
• Multivariate image similarity in the compressed domain using statistical graph matching
• Wasserstein dictionary learning: optimal transport-based unsupervised nonlinear dictionary learning
• Gromov-Wasserstein distances and the metric approach to object matching
• Nonembeddability theorems via Fourier analysis
• Conformal Wasserstein distances: comparing surfaces in polynomial time
• A parallel method for earth mover's distance
• Semidual regularized optimal transport
• Compensation of domain modelling errors in the inverse source problem of the Poisson equation: application in electroencephalographic imaging
• Data confidentiality: a review of methods for statistical disclosure limitation and methods for assessing privacy
• A sparse algorithm for dense optimal transport
• An incremental Bhattacharyya dissimilarity measure for particle filtering
• An adaptive image Euclidean distance
• Image categorization: Graph edit distance \(+\) edge direction histogram
• Regularization via mass transportation
• On the structure of optimal transportation plans between discrete measures
• Entropic approximation of Wasserstein gradient flows
• An endmember-based distance for content based hyperspectral image retrieval
• Metric spaces with expensive distances
• Smoothing methods for histogram‐valued time series: an application to value‐at‐risk
• Approximating snowflake metrics by trees
• Distributions with maximum spread subject to Wasserstein distance constraints
• Boundary measures for geometric inference
• Directional differentiability for supremum-type functionals: statistical applications
• Scaling algorithms for unbalanced optimal transport problems
• Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
• Non-rigid shape correspondence using pointwise surface descriptors and metric structures
• Adapting a classification rule to local and global shift when only unlabelled data are available
• Iterative Bregman projections for regularized transportation problems
• Wasserstein distances in the analysis of time series and dynamical systems
• Multi region based image retrieval system
• EMD
• A sparse multiscale algorithm for dense optimal transport
• Hölder-Lipschitz norms and their duals on spaces with semigroups, with applications to earth mover's distance
• A transportation \(L^p\) distance for signal analysis
• Learning distance metric for object contour tracking
• Generalization of the Kullback-Leibler divergence in the Tsallis statistics
• Image retrieval via isotropic and anisotropic mappings
• Borrowing strength and borrowing index for Bayesian hierarchical models
• Shape classification based on interpoint distance distributions
• Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
• Implementation of transportation distance for analyzing FLIM and FRET experiments
• Sublinear time algorithms for earth mover's distance
• Earth mover's distances on discrete surfaces
• Witnessed \(k\)-distance
• On the Pythagorean Structure of the Optimal Transport for Separable Cost Functions
• Multiple instance classification: review, taxonomy and comparative study
• Type extension trees for feature construction and learning in relational domains
• Signatures versus histograms: definitions, distances and algorithms
• Geometric inference for probability measures
• The ultrametric Gromov-Wasserstein distance
• Data-Driven Reduction for a Class of Multiscale Fast-Slow Stochastic Dynamical Systems
• An algorithm to approximate the optimal expected inner product of two vectors with given marginals
• Perceptual metrics for image database navigation. Incl. 1 CD-ROM
• On optimal partitions, individual values and cooperative games: does a wiser agent always produce a higher value?
• Image segmentation based on the integration of colour-texture descriptors -- a review
• An explicit bound on the transportation cost distance
• Robust Wasserstein profile inference and applications to machine learning
• Moving coins
• EMDUniFrac: exact linear time computation of the UniFrac metric and identification of differentially abundant organisms
• Empirical Evaluation of Dissimilarity Measures for Color and Texture
• Transportation distances on the circle
• A linear optimal transportation framework for quantifying and visualizing variations in sets of images
• Computations of optimal transport distance with Fisher information regularization
• Signature-based perceptual nearness: application of near sets to image retrieval
• Optimal random matchings, tours, and spanning trees in hierarchically separated trees
• Attributed relational graph matching based on the nested assignment structure
• A model-based approach to junction detection using radial energy
• Randomized Wasserstein barycenter computation: resampling with statistical guarantees
• An inexact PAM method for computing Wasserstein barycenter with unknown supports
• Spatial prediction and spatial dependence monitoring on georeferenced data streams
• Spatial arrangement of color in retrieval by visual similarity
• Generalized Sinkhorn iterations for regularizing inverse problems using optimal mass transport
• Knowledge distance measure in multigranulation spaces of fuzzy equivalence relations
• A smoothed dual approach for variational Wasserstein problems
• People mover's distance: class level geometry using fast pairwise data adaptive transportation costs
• Efficient histogram dictionary learning for text/image modeling and classification
• Characterizing the optimal pivots for efficient similarity searches in vector space databases with Minkowski distances
• Deforming surface meshes
• Inference for empirical Wasserstein distances on finite spaces
• Parsimonious representation of nonlinear dynamical systems through manifold learning: a chemotaxis case study
• The mixed Lipschitz space and its dual for tree metrics
• Quantitative and flexible 3D shape dataset augmentation via latent space embedding and deformation learning
• Empirical optimal transport on countable metric spaces: distributional limits and statistical applications
• Privacy-Preserving Computation of the Earth Mover’s Distance
• Entropic optimal transport is maximum-likelihood deconvolution
• Distribution metrics and image segmentation
• Automatic artist recognition of songs for advanced retrieval
• Multiscale strategies for computing optimal transport
• Ellipsoidal conformal and area-/volume-preserving parameterizations and associated optimal mass transportations
• Koopman operator framework for time series modeling and analysis
• The ClasSi coefficient for the evaluation of ranking quality in the presence of class similarities
• A stochastic multi-layer algorithm for semi-discrete optimal transport with applications to texture synthesis and style transfer
• Least action principles for incompressible flows and geodesics between shapes
• Inverse optimal transport
• Surface parameterization based on polar factorization

This page was built for publication: The earth mover's distance as a metric for image retrieval

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