EMD

swMATH14902MaRDI QIDQ26797FDOQ26797

Author name not available (Why is that?)

Described by source

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

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

• 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
• A Klein-bottle-based dictionary for texture representation
• 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
• Generalized transportation cost spaces
• 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
• Inference for empirical Wasserstein distances on finite spaces
• Data confidentiality: a review of methods for statistical disclosure limitation and methods for assessing privacy
• Parsimonious representation of nonlinear dynamical systems through manifold learning: a chemotaxis case study
• The mixed Lipschitz space and its dual for tree metrics
• Content-based image collection summarization and comparison using self-organizing maps
• Empirical optimal transport on countable metric spaces: distributional limits and statistical applications
• Metric spaces with expensive distances
• Entropic optimal transport is maximum-likelihood deconvolution
• Automatic artist recognition of songs for advanced retrieval
• Multiscale strategies for computing optimal transport
• The ClasSi coefficient for the evaluation of ranking quality in the presence of class similarities
• Directional differentiability for supremum-type functionals: statistical applications
• A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem
• Synthesizing and mixing stationary Gaussian texture models
• Surface parameterization based on polar factorization
• Unbalanced and partial \(L_1\) Monge-Kantorovich problem: a scalable parallel first-order method
• Conformal Wasserstein distance: II. Computational aspects and extensions
• The uncertainty of conditional returns, volatilities and correlations in DCC models
• CADrx for GBM brain tumors: predicting treatment response from changes in diffusion-weighted MRI
• Image data analysis and classification in marketing
• Content-based image retrieval using growing hierarchical self-organizing quadtree map
• A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming
• A continuous linear optimal transport approach for pattern analysis in image datasets
• Stochastic approximation versus sample average approximation for Wasserstein barycenters
• A comparative evaluation of interactive segmentation algorithms
• Learning distance metric for object contour tracking
• Generalization of the Kullback-Leibler divergence in the Tsallis statistics
• Structure- and Physics-Preserving Reductions of Power Grid Models
• Locally orderless tracking
• Stochastic and fuzzy ordering with the method of minimal transformations
• Regularized optimal transport and the rot mover's distance
• Computer Vision - ECCV 2004
• A Continuous Probabilistic Framework for Image Matching
• Correntropy based feature selection using binary projection
• Impact of data assimilation on cost-accuracy tradeoff in multifidelity models
• Region-based image retrieval with high-level semantics using decision tree learning
• Perceptual metrics for image database navigation. Incl. 1 CD-ROM
• Convex histogram-based joint image segmentation with regularized optimal transport cost
• Image segmentation based on the integration of colour-texture descriptors -- a review
• Attributed relational graph matching based on the nested assignment structure
• Signal ensemble classification using low-dimensional embeddings and earth mover's distance
• Computing the Monge-Kantorovich distance
• A model-based approach to junction detection using radial energy
• A linear approximate algorithm for Eerth mover's distance with thresholded ground distance
• Differentiation and regularity of semi-discrete optimal transport with respect to the parameters of the discrete measure
• The quadratic Wasserstein metric for earthquake location
• Ricci-Ollivier curvature of the rooted phylogenetic subtree-prune-regraft graph
• A multiscale sub-linear time Fourier algorithm for noisy data
• Tracking people across disjoint camera views by an illumination-tolerant appearance representation
• Attention-driven image interpretation with application to image retrieval
• 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
• The response of reduced models of multiscale dynamics to small external perturbations
• Conformal Wasserstein distances: comparing surfaces in polynomial time
• A parallel method for earth mover's distance
• Semidual regularized optimal transport
• Classification in music research
• Bayesian learning of finite generalized Gaussian mixture models on images
• Compensation of domain modelling errors in the inverse source problem of the Poisson equation: application in electroencephalographic imaging
• A Statistical Approach to the Matching of Local Features
• A sparse algorithm for dense optimal transport
• An incremental Bhattacharyya dissimilarity measure for particle filtering
• Unbalanced optimal transport: dynamic and Kantorovich formulations
• Image categorization: Graph edit distance \(+\) edge direction histogram
• Regularization via mass transportation
• Fast transport optimization for Monge costs on the circle
• On the structure of optimal transportation plans between discrete measures
• Entropic approximation of Wasserstein gradient flows
• Smoothing methods for histogram‐valued time series: an application to value‐at‐risk
• Approximating snowflake metrics by trees
• Probability measures on the space of persistence diagrams
• A survey of content-based image retrieval with high-level semantics
• Distributions with maximum spread subject to Wasserstein distance constraints
• Boundary measures for geometric inference
• Scaling algorithms for unbalanced optimal transport problems
• Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
• The pyramid match kernel: efficient learning with sets of features
• 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
• Geodesic methods in computer vision and graphics
• Title not available (Why is that?)
• Differential geometric treewidth estimation in adiabatic quantum computation
• A sparse multiscale algorithm for dense optimal transport
• Gale-Nikaido-Debreu and Milgrom-Shannon: communal interactions with endogenous community structures
• Hölder-Lipschitz norms and their duals on spaces with semigroups, with applications to earth mover's distance

This page was built for software: EMD