Pages that link to "Item:Q1859688"

The following pages link to The earth mover's distance as a metric for image retrieval (Q1859688):

Displaying 50 items.

• EMD (Q26797) (← links)
• On the Pythagorean Structure of the Optimal Transport for Separable Cost Functions (Q93069) (← links)
• An algorithm to approximate the optimal expected inner product of two vectors with given marginals (Q136014) (← links)
• A multiscale sub-linear time Fourier algorithm for noisy data (Q262947) (← links)
• Shape classification based on interpoint distance distributions (Q268763) (← links)
• Compensation of domain modelling errors in the inverse source problem of the Poisson equation: application in electroencephalographic imaging (Q284924) (← links)
• Hölder-Lipschitz norms and their duals on spaces with semigroups, with applications to earth mover's distance (Q305688) (← links)
• Adapting a classification rule to local and global shift when only unlabelled data are available (Q319045) (← links)
• A sparse multiscale algorithm for dense optimal transport (Q334276) (← links)
• An explicit bound on the transportation cost distance (Q380692) (← links)
• Optimal random matchings, tours, and spanning trees in hierarchically separated trees (Q388460) (← links)
• Implementation of transportation distance for analyzing FLIM and FRET experiments (Q486629) (← links)
• Multiple instance classification: review, taxonomy and comparative study (Q490423) (← links)
• Type extension trees for feature construction and learning in relational domains (Q490428) (← links)
• On optimal partitions, individual values and cooperative games: does a wiser agent always produce a higher value? (Q506382) (← links)
• Conformal Wasserstein distances: comparing surfaces in polynomial time (Q544003) (← links)
• Wasserstein distances in the analysis of time series and dynamical systems (Q617532) (← links)
• Sublinear time algorithms for earth mover's distance (Q633770) (← links)
• Gromov-Wasserstein distances and the metric approach to object matching (Q647419) (← links)
• Geometric inference for probability measures (Q656818) (← links)
• Approximating snowflake metrics by trees (Q723016) (← links)
• Multi region based image retrieval system (Q746581) (← links)
• Learning distance metric for object contour tracking (Q903090) (← links)
• A Klein-bottle-based dictionary for texture representation (Q903458) (← links)
• Generalization of the Kullback-Leibler divergence in the Tsallis statistics (Q905978) (← links)
• Image categorization: Graph edit distance \(+\) edge direction histogram (Q936445) (← links)
• An incremental Bhattacharyya dissimilarity measure for particle filtering (Q962663) (← links)
• Boundary measures for geometric inference (Q967203) (← links)
• Automatic artist recognition of songs for advanced retrieval (Q999174) (← links)
• A comparative evaluation of interactive segmentation algorithms (Q1037815) (← links)
• Spatial arrangement of color in retrieval by visual similarity (Q1601587) (← links)
• Entropic optimal transport is maximum-likelihood deconvolution (Q1632830) (← links)
• Computations of optimal transport distance with Fisher information regularization (Q1651332) (← links)
• Unbalanced and partial \(L_1\) Monge-Kantorovich problem: a scalable parallel first-order method (Q1651333) (← links)
• CADrx for GBM brain tumors: predicting treatment response from changes in diffusion-weighted MRI (Q1662515) (← links)
• A continuous linear optimal transport approach for pattern analysis in image datasets (Q1669731) (← links)
• Surface parameterization based on polar factorization (Q1675355) (← links)
• Ricci-Ollivier curvature of the rooted phylogenetic subtree-prune-regraft graph (Q1675925) (← links)
• Convex histogram-based joint image segmentation with regularized optimal transport cost (Q1703945) (← links)
• A transportation \(L^p\) distance for signal analysis (Q1703946) (← links)
• A linear approximate algorithm for Eerth mover's distance with thresholded ground distance (Q1718297) (← links)
• Differentiation and regularity of semi-discrete optimal transport with respect to the parameters of the discrete measure (Q1719564) (← links)
• Efficient histogram dictionary learning for text/image modeling and classification (Q1741297) (← links)
• The mixed Lipschitz space and its dual for tree metrics (Q1742818) (← links)
• Parsimonious representation of nonlinear dynamical systems through manifold learning: a chemotaxis case study (Q1742825) (← links)
• A parallel method for earth mover's distance (Q1747622) (← links)
• The ClasSi coefficient for the evaluation of ranking quality in the presence of class similarities (Q1762222) (← links)
• EMDUniFrac: exact linear time computation of the UniFrac metric and identification of differentially abundant organisms (Q1784414) (← links)
• A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming (Q1789641) (← links)
• Locally orderless tracking (Q1799931) (← links)