Fast Computation of Similarity Based on Jaccard Coefficient for Composition-Based Image Retrieval

  • Authors:

  • Michihiro Kobayakawa;Shigenao Kinjo;Mamoru Hoshi;Tadashi Ohmori;Atsushi Yamamoto

  • Affiliations:

  • Graduate School of Information Systems, University of Electoro-Communications, Tokyo, Japan 182-8585;Graduate School of Information Systems, University of Electoro-Communications, Tokyo, Japan 182-8585;Graduate School of Information Systems, University of Electoro-Communications, Tokyo, Japan 182-8585;Graduate School of Information Systems, University of Electoro-Communications, Tokyo, Japan 182-8585;Graduate School of Information Systems, University of Electoro-Communications, Tokyo, Japan 182-8585

  • Venue:
  • PCM '09 Proceedings of the 10th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes an algorithm and data structure for fast computation of similarity based on Jaccard coefficient to retrieve images with regions similar to those of a query image. The similarity measures the degree of overlap between the regions of an image and those of another image. The key idea for fast computation of the similarity is to use the runlength description of an image for computing the number of overlapped pixels between the regions. We present an algorithm and data structure, and do experiments on 30,000 images to evaluate the performance of our algorithm. Experiments showed that the proposed algorithm is 5.49 (2.36) times faster than a naive algorithm on the average (the worst). And we theoretically gave fairly good estimates of the computation time.