ACM Home Page
Please provide us with feedback. Feedback
Efficient region-based image retrieval
Full text PdfPdf (380 KB)
Source Conference on Information and Knowledge Management archive
Proceedings of the twelfth international conference on Information and knowledge management table of contents
New Orleans, LA, USA
SESSION: Information retrieval session 2: non-text retrieval table of contents
Pages: 69 - 76  
Year of Publication: 2003
ISBN:1-58113-723-0
Authors
Roger Weber  Swiss Federal Institute of Technology (ETH), Zurich, Switzerland
Michael Mlivoncic  Swiss Federal Institute of Technology (ETH), Zurich, Switzerland
Sponsors
ACM: Association for Computing Machinery
SIGMIS: ACM Special Interest Group on Management Information Systems
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 57,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/956863.956878
What is a DOI?

ABSTRACT

Region-based image retrieval(RBIR) was recently proposed as an extension of content-based image retrieval(CBIR). An RBIR system automatically segments images into a variable number of regions, and extracts for each region a set of features. Then, a dissimilarity function determines the distance between a database image and a set of reference regions. Unfortunately, the large evaluation costs of the dissimilarity function are restricting RBIR to relatively small databases. In this paper, we apply a multi-step approach to enable region-based techniques for large image collections. We provide cheap lower and upper bounding distance functions for a recently proposed dissimilarity measure. As our experiments show, these bounding functions are so tight, that we have to evaluate the expensive distance function for less than 0.5\%of the images. For a typical image database with more than 370,000images, our multi-step approach improved retrieval performance by a factor of more than5 compared to the currently fastest methods.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
 
5
 
6
 
7
8
9
 
10
 
11
J. Hebborn. Decision Maths 2, chapter 2. Allocation (assignment) problems, p. 29--45. Heinemann Modular Maths for Edexcel AS and A-level. Heinemann, 2001.
 
12
 
13
D. E. Knuth. The Stanford Graph Base, p. 77--89. 1993.
 
14
15
 
16
Y. Rui, T. S. Huang, and S.-F. Chang. Image Retrieval: Current Techniques, Promising Directions and Open Issues. Journal of Visual Communication and Image Representation, 10(4):39--62, 1999.
17
 
18
M. A. Stricker and M. Orengo. Similarity of Color Images. In Storage and Retrieval for Image and Video Databases, volume 2420 of SPIE Proceedings, p. 381--392, San Diego/La Jolla, CA, USA, 1995.
 
19
 
20


Collaborative Colleagues:
Roger Weber: colleagues
Michael Mlivoncic: colleagues