Article

Learning metrics for content-based medical image retrieval.

ABSTRACT Application of content-based image retrieval (CBIR) to medical image analysis has recently become an active research field. While many previous studies have focused on the feature design, the metric design, another key CBIR component, has not been well investigated in this application context. This paper presents a medical CBIR that adapts its similaritymetric from data by using information theoretic metric learning. Also we systematically compare our SIFT bag-of-words-based system with various plug-in similarity measures available in literature. The proposed systems are evaluated with the ImageCLEF-2011 benchmarking dataset. Our experimental results demonstrate the advantage of the proposed metric learning approach and L1 distance-based measures.

0 Followers
 · 
43 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Presents a review of 200 references in content-based image retrieval. The paper starts with discussing the working conditions of content-based retrieval: patterns of use, types of pictures, the role of semantics, and the sensory gap. Subsequent sections discuss computational steps for image retrieval systems. Step one of the review is image processing for retrieval sorted by color, texture, and local geometry. Features for retrieval are discussed next, sorted by: accumulative and global features, salient points, object and shape features, signs, and structural combinations thereof. Similarity of pictures and objects in pictures is reviewed for each of the feature types, in close connection to the types and means of feedback the user of the systems is capable of giving by interaction. We briefly discuss aspects of system engineering: databases, system architecture, and evaluation. In the concluding section, we present our view on: the driving force of the field, the heritage from computer vision, the influence on computer vision, the role of similarity and of interaction, the need for databases, the problem of evaluation, and the role of the semantic gap
    IEEE Transactions on Pattern Analysis and Machine Intelligence 01/2001; 22(12-22):1349 - 1380. DOI:10.1109/34.895972 · 5.69 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We propose EMD-L1: a fast and exact algorithm for computing the Earth Mover's Distance (EMD) between a pair of histograms. The efficiency of the new algorithm enables its application to problems that were previously prohibitive due to high time complexities. The proposed EMD-L1 significantly simplifies the original linear programming formulation of EMD. Exploiting the L1 metric structure, the number of unknown variables in EMD-L1 is reduced to O(N) from O(N2) of the original EMD for a histogram with N bins. In addition, the number of constraints is reduced by half and the objective function of the linear program is simplified. Formally, without any approximation, we prove that the EMD-L1 formulation is equivalent to the original EMD with a L1 ground distance. To perform the EMD-L1 computation, we propose an efficient tree-based algorithm, Tree-EMD. Tree-EMD exploits the fact that a basic feasible solution of the simplex algorithm-based solver forms a spanning tree when we interpret EMD-L1 as a network flow optimization problem. We empirically show that this new algorithm has an average time complexity of O(N2), which significantly improves the best reported supercubic complexity of the original EMD. The accuracy of the proposed methods is evaluated by experiments for two computation-intensive problems: shape recognition and interest point matching using multidimensional histogram-based local features. For shape recognition, EMD-L1 is applied to compare shape contexts on the widely tested MPEG7 shape data set, as well as an articulated shape data set. For interest point matching, SIFT, shape context and spin image are tested on both synthetic and real image pairs with large geometrical deformation, illumination change, and heavy intensity noise. The results demonstrate that our EMD-L1-based solutions outperform previously reported state-of-the-art features and distance measures in solving the two tasks.
    IEEE Transactions on Pattern Analysis and Machine Intelligence 06/2007; 29(5):840-53. DOI:10.1109/TPAMI.2007.1058 · 5.69 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We introduce a new distance between two distributions that we call the Earth Mover's Distance (EMD), which reflects the minimal amount of work that must be performed to transform one distribution into the other by moving “distribution mass” around. This is a special case of the transportation problem from linear optimization, for which efficient algorithms are available. The EMD also allows for partial matching. When used to compare distributions that have the same overall mass, the EMD is a true metric, and has easy-to-compute lower bounds. In this paper we focus on applications to image databases, especially color and texture. We use the EMD to exhibit the structure of color-distribution and texture spaces by means of Multi-Dimensional Scaling displays. We also propose a novel approach to the problem of navigating through a collection of color images, which leads to a new paradigm for image database search
    Computer Vision, 1998. Sixth International Conference on; 02/1998