Abstract
The retrieval facilities of most peer-to-peer (P2P) systems are limited to queries based on a unique identifier or a small set of keywords. The techniques used for this purpose are hardly applicable for content based image retrieval (CBIR) in a P2P network. Furthermore, we will argue that the curse of dimensionality and the high communication overhead prevent the adaptation of multidimensional search trees or fast sequential scan techniques for P2P CBIR. In the present paper we will propose two compact data representations that can be distributed in a P2P network and used as the basis for a source selection. This allows for communicating with only a small fraction of all peers during query processing without deteriorating the result quality significantly. We will also present experimental results confirming our approach.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aggarwal, C.C., Hinneburg, A., Keim, D.A.: On the surprising behavior of distance metrics in high dimensional space. In: Proceedings of the 8th International Conference on Database Theory (2001)
Balakrishnan, H., Kasshoek, M.F., Karger, D. Morris, R., Stoica, I.: Looking up data in P2P systems. Commun. ACM 46(2), 43–48 (2003)
Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: Proceedings of ACM SIGMOD, Atlantic City, NJ (1990)
Berchtold, S., Keim, D.A., Kriegel, H.-P.: The X-tree: an index structure for high-dimensional data. In: Proceedings of the 22nd International Conference on Very Large Data Bases, San Francisco (1996)
Callan, J.P., Lu, Z., Croft, W.B.: Searching distributed collections with inference networks. In: Proceedings of the 18th ACM SIGIR, Seattle, WA (1995)
Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: a distributed anonymous information storage and retrieval system. In: Federrath, H. (ed.): Designing Privacy Enhancing Technologies. Lecture notes in computer science, vol. 2009. Berlin, Heidelberg, New York: Springer (2000)
Clip2. The Gnutella Protocol Specification v0.4. URL: http://www9.limewire.com/developer/gnutella_protocol_0.4.pdf (2000)
Cuenca-Acuna, F.M., Nguyen, T.D.: Text-based content search and retrieval in ad hoc P2P communities. Technical Report DCS-TR-483, Department of Computer Science, Rutgers University (2002)
Corel Gallery 4.0, Corel Corp., Ottawa, Canada (1999)
Eisenhardt, M., Müller, W., Henrich, A.: Classifying documents by distributed P2P clustering. In: Dittrich, K.R., König, W., Oberweis, A., Rannenberg, K., Wahlster, W. (eds.): GI Jahrestagung (2), GI-Lecture Notes in Informatics, vol. 35 (2003)
Ganesan, P., Yang, B., Garcia-Molina, H.: One torus to rule them all: multi-dimensional queries in P2P systems. In: Proceedings of 7th International Workshop on the Web and Databases. New York: ACM Press (2004)
Gravano, L., Garcia-Molina, H., Tomasic, A.: The effectiveness of GlOSS for the text database discovery problem. In: Proceedings of ACM SIGMOD, Minneapolis, MN (1994)
Hafner, J., Sawhney, H.S., Equitz, W., Flickner, M., Niblack, W.: Efficient color histogram indexing for quadratic form distance functions. IEEE Trans. Pattern Anal. Mach. Intell. 17(7), 729–736 (1995)
Joseph, S.: Adaptive routing in distributed decentralized systems: Neurogrid, gnutella and freenet. In: Proceedings of Workshop on Infrastructure for Agents, MAS, and Scalable MAS, at Autonomous Agents. Montreal (2001)
Müller, W., Eisenhardt, M., Henrich, A.: Efficient content based P2P image retrieval using peer content descriptions. In: Santini, S., Schettini, R. (eds.): Internet Imaging V. SPIE, no. 5304. SPIE/IS&T (2004) GYG2004, MuH2003
Müller, W., Henrich, A.: Fast retrieval of high-dimensional feature vectors in P2P networks using compact peer data summaries. In: Proceedings of the ACM MIR'03 Workshop, Berkeley, CA (2003)
Ng, C.H., Sia, K.C.: Peer clustering and firework query model. In: Poster Proceedings of the 11th Interational World Wide Web Conference, Honululu, HI (2002)
Ng, C.H., Sia, K.C., Chang, C.H.: Advanced peer clustering and firework query model in the peer-to-peer network. Poster in WWW2003 (2003)
Sakurai, Y., Yoshikawa, M., Uemura, S., Kojima, H.: The a-tree: an index structure for high-dimensional spaces using relative approximation. In: Proceedings of the International Conference on Very Large Data Bases, Cairo, Egypt (2000)
Smeulders, A.W., Worring, M., Santini, S., Gupta, A., Jain, R.: Content based retrieval at the end of the early years. IEEE Trans. Pattern Anal. Mach. Intell. 22(12), 1349–1380 (2000)
Tang, C., Xu, Z., Mahalingam, M.: pSearch: information retrieval in structured overlays. In: Proceedings of the 1st Workshop on Hot Topics in Networks (HotNets-I), Princeton, NJ (2002)
Vasconcelos, N.: Bayesian models for visual information retrieval. PhD Thesis, MIT, Cambrdige, MA (2000)
Weber, R., Schek, H.-J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: Proceedings of the International Conference on Very Large Data Bases, New York (1998)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Müller, W., Eisenhardt, M. & Henrich, A. Fast retrieval of high-dimensional feature vectors in P2P networks using compact peer data summaries. Multimedia Systems 10, 464–474 (2005). https://doi.org/10.1007/s00530-005-0175-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00530-005-0175-6