Caching content-based queries for robust and efficient image retrieval (Contributo in atti di convegno)

Type
Label
  • Caching content-based queries for robust and efficient image retrieval (Contributo in atti di convegno) (literal)
Anno
  • 2009-01-01T00:00:00+01:00 (literal)
Alternative label
  • Falchi F.; Lucchese C.; Orlando S.; Perego R.; Rabitti F. (2009)
    Caching content-based queries for robust and efficient image retrieval
    in 12th International Conference on Extending Database Technology: Advances in Database Technology, EDBT'09, Saint-Petersburg, Russia, 24-26 Marzo 2009
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Falchi F.; Lucchese C.; Orlando S.; Perego R.; Rabitti F. (literal)
Pagina inizio
  • 780 (literal)
Pagina fine
  • 790 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
  • In: EDBT 2009 - 12th International Conference on Extending Database Technology: Advances in Database Technology (Saint-Petersburg, Russia, 23-26 Marzo 2009). Proceedings, pp. 780 - 790. (Extending Database Technology, vol. 360). ACM, 2009. (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#descrizioneSinteticaDelProdotto
  • ABSTRACT: In order to become an e?ective complement to traditional Web-scale text-based image retrieval solutions, content-based image retrieval must address scalability and e?ciency 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 su?er 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 phot (literal)
Note
  • Scopu (literal)
  • Google Scholar (literal)
  • PuMa (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • CNR-ISTI, Pisa, Università di Venezia (literal)
Titolo
  • Caching content-based queries for robust and efficient image retrieval (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#isbn
  • 978-1-60558-422-5 (literal)
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 effciency 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 signicant impact on performance, like caching on text queries has been proven effective for traditional Web search engines. (literal)
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Autore CNR di
Prodotto
Insieme di parole chiave di
data.CNR.it