| Efficient region-based image retrieval |
| Full text |
Pdf
(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 |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 57, Citation Count: 4
|
|
|
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
|
Christos Faloutsos , M. Ranganathan , Yannis Manolopoulos, Fast subsequence matching in time-series databases, Proceedings of the 1994 ACM SIGMOD international conference on Management of data, p.419-429, May 24-27, 1994, Minneapolis, Minnesota, United States
|
| |
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
|
Apostol Natsev , Rajeev Rastogi , Kyuseok Shim, WALRUS: a similarity retrieval algorithm for image databases, Proceedings of the 1999 ACM SIGMOD international conference on Management of data, p.395-406, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
|
| |
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
|
|
|