Stochastic Learning of Multi-Instance Dictionary for Earth Mover's Distance based Histogram Comparison
Dictionary plays an important role in multi-instance data representation. It maps bags of instances to histograms. Earth mover's distance (EMD) is the most effective histogram distance metric for the application of multi-instance retrieval. However, up to now, there is no existing multi-instance dictionary learning methods designed for EMD based histogram comparison. To fill this gap, we develop the first EMD-optimal dictionary learning method using stochastic optimization method. In the stochastic learning framework, we have one triplet of bags, including one basic bag, one positive bag, and one negative bag. These bags are mapped to histograms using a multi-instance dictionary. We argue that the EMD between the basic histogram and the positive histogram should be smaller than that between the basic histogram and the negative histogram. Base on this condition, we design a hinge loss. By minimizing this hinge loss and some regularization terms of the dictionary, we update the dictionary instances. The experiments over multi-instance retrieval applications shows its effectiveness when compared to other dictionary learning methods over the problems of medical image retrieval and natural language relation classification.
Code (0)
등록된 구현이 없습니다.
Tasks
Dictionary LearningImage RetrievalMedical Image RetrievalMulti-Instance RetrievalRelation ClassificationRetrievalStochastic OptimizationTripletSimilar Papers 제목 키워드 기반
H-EMD: A Hierarchical Earth Mover's Distance Method for Instance Segmentation
Deep learning (DL) based semantic segmentation methods have achieved excellent performance in biomedical image segmentation, producing high quality probability maps to allow extraction of rich instance information to fac…
Image SegmentationInstance SegmentationSegmentationSemantic SegmentationSparse Coding with Earth Mover's Distance for Multi-Instance Histogram Representation
Sparse coding (Sc) has been studied very well as a powerful data representation method. It attempts to represent the feature vector of a data sample by reconstructing it as the sparse linear combination of some basic ele…
RetrievalSurrogate-Assisted Framework for SI-Compliant Interconnect Design Optimization Using the Earth Mover's Distance
This work presents a deterministic, machine-assisted framework for SI-compliant PCB design based on the Earth Mover's Distance (EMD). In contrast to conventional surrogate-based optimization methods that rely on iterativ…
Graph Mover's Distance: An Efficiently Computable Distance Measure for Geometric Graphs
Many applications in pattern recognition represent patterns as a geometric graph. The geometric graph distance (GGD) has recently been studied as a meaningful measure of similarity between two geometric graphs. Since com…
Earth Mover's Distance Minimization for Unsupervised Bilingual Lexicon Induction
Cross-lingual natural language processing hinges on the premise that there exists invariance across languages. At the word level, researchers have identified such invariance in the word embedding semantic spaces of diffe…
Bilingual Lexicon InductionCross-Lingual TransferWord Embeddings