| Caching content-based queries for robust and efficient image retrieval |
| Full text |
Pdf
(1.61 MB)
|
| Source
|
Extending Database Technology; Vol. 360
archive
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
table of contents
Saint Petersburg, Russia
SESSION: Research sessions: Caching techniques
table of contents
Pages 780-790
Year of Publication: 2009
ISBN:978-1-60558-422-5
|
|
Authors
|
|
Fabrizio Falchi
|
ISTI-CNR, Pisa, Italy
|
|
Claudio Lucchese
|
ISTI-CNR, Pisa, Italy
|
|
Salvatore Orlando
|
Università Cà Foscari, Venezia, Italy
|
|
Raffaele Perego
|
ISTI-CNR, Pisa, Italy
|
|
Fausto Rabitti
|
ISTI-CNR, Pisa, Italy
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 21, Downloads (12 Months): 77, Citation Count: 0
|
|
|
ABSTRACT
In order to become an effective complement to traditional Web-scale text-based image retrieval solutions, content-based image retrieval must address scalability and efficiency issues. In this paper we investigate the possibility of caching the answers to content-based image retrieval queries in metric space, with the aim of reducing the average cost of query processing, and boosting the overall system throughput. Our proposal exploits the similarity between the query object and the cache content, and allows the cache to return approximate answers with acceptable quality guarantee even if the query processed has never been encountered in the past. Moreover, since popular images that are likely to be used as query have several near-duplicate versions, we show that our caching algorithm is robust, and does not suffer of cache pollution problems due to near-duplicate query objects. We report on very promising results obtained with a collection of one million high-quality digital photos. We show that it is worth pursuing caching strategies also in similarity search systems, since the proposed caching techniques can have a significant impact on performance, like caching on text queries has been proven effective for traditional Web search engines.
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
|
Ritendra Datta , Dhiraj Joshi , Jia Li , James Z. Wang, Image retrieval: Ideas, influences, and trends of the new age, ACM Computing Surveys (CSUR), v.40 n.2, p.1-60, April 2008
[doi> 10.1145/1348246.1348248]
|
 |
7
|
|
 |
8
|
Fabrizio Falchi , Claudio Lucchese , Salvatore Orlando , Raffaele Perego , Fausto Rabitti, A metric cache for similarity search, Proceeding of the 2008 ACM workshop on Large-Scale distributed systems for information retrieval, October 30-30, 2008, Napa Valley, California, USA
[doi> 10.1145/1458469.1458473]
|
| |
9
|
|
 |
10
|
Jun Jie Foo , Justin Zobel , Ranjan Sinha , S. M. M. Tahaghoghi, Detection of near-duplicate images for web search, Proceedings of the 6th ACM international conference on Image and video retrieval, p.557-564, July 09-11, 2007, Amsterdam, The Netherlands
[doi> 10.1145/1282280.1282360]
|
 |
11
|
Jun Jie Foo , Justin Zobel , Ranjan Sinha , S. M. M. Tahaghoghi, Detection of near-duplicate images for web search, Proceedings of the 6th ACM international conference on Image and video retrieval, p.557-564, July 09-11, 2007, Amsterdam, The Netherlands
[doi> 10.1145/1282280.1282360]
|
 |
12
|
|
| |
13
|
ISO/IEC. Information technology - Multimedia content description interfaces. Part 6: Reference Software, 2003. 15938- 6:2003.
|
 |
14
|
|
| |
15
|
P. Lyman and H. R. Varian. How much information, 2003. retrieved from http://www.sims.berkeley.edu/how-much-info-2003.
|
| |
16
|
E. P. Markatos. On Caching Search Engine Query Results. Computer Communications, 24(2):137--143, 2001.
|
| |
17
|
|
| |
18
|
|
 |
19
|
|
| |
20
|
|
| |
21
|
|
| |
22
|
|
| |
23
|
Y. Xie and D. O'Hallaron. Locality in search engine queries and its implications for caching. In Proceedings of IEEE INFOCOM 2002, The 21st Annual Joint Conference of the IEEE Computer and Communications Societies, 2002.
|
| |
24
|
|
|