A boosting framework for visuality-preserving distance metric learning and its application to medical image retrieval.
Similarity measurement is a critical component in content-based image retrieval systems, and learning a good distance metric can significantly improve retrieval performance. However, despite extensive study, there are several major shortcomings with the existing approaches for distance metric learning that can significantly affect their application to medical image retrieval. In particular, "similarity" can mean very different things in image retrieval: resemblance in visual appearance (e.g., two images that look like one another) or similarity in semantic annotation (e.g., two images of tumors that look quite different yet are both malignant). Current approaches for distance metric learning typically address only one goal without consideration of the other. This is problematic for medical image retrieval where the goal is to assist doctors in decision making. In these applications, given a query image, the goal is to retrieve similar images from a reference library whose semantic annotations could provide the medical professional with greater insight into the possible interpretations of the query image. If the system were to retrieve images that did not look like the query, then users would be less likely to trust the system; on the other hand, retrieving images that appear superficially similar to the query but are semantically unrelated is undesirable because that could lead users toward an incorrect diagnosis. Hence, learning a distance metric that preserves both visual resemblance and semantic similarity is important. We emphasize that, although our study is focused on medical image retrieval, the problem addressed in this work is critical to many image retrieval systems. We present a boosting framework for distance metric learning that aims to preserve both visual and semantic similarities. The boosting framework first learns a binary representation using side information, in the form of labeled pairs, and then computes the distance as a weighted Hamming distance using the learned binary representation. A boosting algorithm is presented to efficiently learn the distance function. We evaluate the proposed algorithm on a mammographic image reference library with an Interactive Search-Assisted Decision Support (ISADS) system and on the medical image data set from ImageCLEF. Our results show that the boosting framework compares favorably to state-of-the-art approaches for distance metric learning in retrieval accuracy, with much lower computational cost. Additional evaluation with the COREL collection shows that our algorithm works well for regular image data sets.
Yang
Liu
L
Machine Learning Department, School of Computer Science, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15231, USA. liuy@cs.cmu.edu
Jin
Rong
R
Mummert
Lily
L
Sukthankar
Rahul
R
Goode
Adam
A
Zheng
Bin
B
Hoi
Steven C H
SC
Satyanarayanan
Mahadev
M
D000465:Algorithms; D019540:Area Under Curve; D001185:Artificial Intelligence; D016208:Databases, Factual; D003952:Diagnostic Imaging / Q000379:methods*; D007091:Image Processing, Computer-Assisted / Q000379:methods*; D016247:Information Storage and Retrieval / Q000379:methods; D008327:Mammography; D008490:Medical Informatics / Q000379:methods; D025341:Principal Component Analysis; D011859:Radiography; D012660:Semantics