The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
The effectiveness of GIOSS for the text database discovery problem
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Searching distributed collections with inference networks
SIGIR '95 Proceedings of the 18th annual international ACM SIGIR conference on Research and development in information retrieval
Content-Based Image Retrieval at the End of the Early Years
IEEE Transactions on Pattern Analysis and Machine Intelligence
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Looking up data in P2P systems
Communications of the ACM
Efficient Color Histogram Indexing for Quadratic Form Distance Functions
IEEE Transactions on Pattern Analysis and Machine Intelligence
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Complex Queries in DHT-based Peer-to-Peer Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Bayesian models for visual information retrieval
Bayesian models for visual information retrieval
Scalable summary based retrieval in P2P networks
Proceedings of the 14th ACM international conference on Information and knowledge management
PRISM: indexing multi-dimensional data in P2P networks using reference vectors
Proceedings of the 13th annual ACM international conference on Multimedia
Content-based multimedia information retrieval: State of the art and challenges
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Novel applications of information retrieval techniques to peer-to-peer file-sharing systems
P2PIR '06 Proceedings of the international workshop on Information retrieval in peer-to-peer networks
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of the international workshop on Workshop on multimedia information retrieval
Enhanced P2P services providing multimedia content
Advances in Multimedia
A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Designing a Peer-to-Peer Architecture for Distributed Image Retrieval
Adaptive Multimedial Retrieval: Retrieval, User, and Semantics
A Combined Fuzzy and Probabilistic Data Descriptor for Distributed CBIR
WILF '09 Proceedings of the 8th International Workshop on Fuzzy Logic and Applications
Aspects of adaptivity in P2P information retrieval
AMR'06 Proceedings of the 4th international conference on Adaptive multimedia retrieval: user, context, and feedback
A p2p architecture for multimedia content retrieval
MMM'07 Proceedings of the 13th international conference on Multimedia Modeling - Volume Part I
Supporting information access in next generation digital library architectures
DELOS'04 Proceedings of the 6th Thematic conference on Peer-to-Peer, Grid, and Service-Orientation in Digital Library Architectures
| Hi-index | 0.00 |
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 which can be distributed in a P2P network and used as the basis for a source selection. This allows to communicate only with a small fraction of all peers during query processing without deteriorating the result quality significantly. We will also present experimental results confirming our approach.