Quick and Easy Implementation of Approximate Similarity Search with Lucene

  • Giuseppe Amato
  • Paolo Bolettieri
  • Claudio Gennaro
  • Fausto Rabitti
Part of the Communications in Computer and Information Science book series (CCIS, volume 354)

Abstract

Similarity search technique has been proved to be an effective way for retrieving multimedia content. However, as the amount of available multimedia data increases, the cost of developing from scratch a robust and scalable system with content-based image retrieval facilities is quite prohibitive.

In this paper, we propose to exploit an approach that allows us to convert low level features into a textual form. In this way, we are able to easily set up a retrieval system on top of the Lucene search engine library that combines full-text search with approximate similarity search capabilities.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Amato, G., Savino, P.: Approximate similarity search in metric spaces using inverted files. In: Proceedings of the 3rd International Conference on Scalable Information Systems (InfoScale 2008), pp. 1–10. ICST (2008)Google Scholar
  2. 2.
    Batko, M., Kohoutkova, P., Novak, D.: Cophir image collection under the microscope. In: International Workshop on Similarity Search and Applications, pp. 47–54 (2009)Google Scholar
  3. 3.
    Bolettieri, P., Esuli, A., Falchi, F., Lucchese, C., Perego, R., Rabitti, F.: Enabling content-based image retrieval in very large digital libraries. In: Second Workshop on Very Large Digital Libraries (VLDL 2009), pp. 43–50. DELOS (2009)Google Scholar
  4. 4.
    Chavez, E., Figueroa, K., Navarro, G.: Effective proximity retrieval by ordering permutations. IEEE Transactions on Pattern Analysis and Machine Intelligence 30, 1647–1658 (2007)Google Scholar
  5. 5.
    Esuli, A.: Pp-index: Using permutation prefixes for efficient and scalable approximate similarity search. In: Proceedings of the 7th Workshop on Large-Scale Distributed Systems for Information Retrieval (LSDS-IR 2009), pp. 17–24 (2009)Google Scholar
  6. 6.
    Esuli, A.: Use of permutation prefixes for efficient and scalable approximate similarity search. Information Processing & Management (2011)Google Scholar
  7. 7.
    Fagin, R., Kumar, R., Sivakumar, D.: Comparing top-k lists. SIAM J. of Discrete Math. 17(1), 134–160 (2003)MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Giuseppe Amato
    • 1
  • Paolo Bolettieri
    • 1
  • Claudio Gennaro
    • 1
  • Fausto Rabitti
    • 1
  1. 1.ISTI - CNRPisaItaly

Personalised recommendations