Zum Inhalt springen

Nur-Lesen-Fassung: Das Forschungsinformationssystem (FIS) ist aus Sicherheitsgründen vorübergehend durch diese Nur-Lesen-Fassung ersetzt. Alle öffentlichen Inhalte und Volltexte sind weiterhin abrufbar; Anmeldung, Bearbeitung, Einreichung und Statistiken stehen nicht zur Verfügung. Bei Fragen: fis@uni-bamberg.de

Start › Publikationen › Clustering-Based Source Selection for Efficient Image Retrieval in Peer-to-Peer Networks

Publikation

Clustering-Based Source Selection for Efficient Image Retrieval in Peer-to-Peer Networks

Eisenhardt, Martin; Müller, Wolfgang; Henrich, Andreas; u. a. (2025): Clustering-Based Source Selection for Efficient Image Retrieval in Peer-to-Peer Networks, in: Bamberg: Otto-Friedrich-Universität, S. 1–6.

Details

Fakultät/Lehrstuhl
Autorin(nen)/Autor(en)
Eisenhardt, Martin
Blank, Daniel
El Allali, Soufyane
Verlagsangabe
Otto-Friedrich-Universität : Bamberg
Erscheinungsjahr
2025
Quelle/Weitere Ausgabe
Proceedings : ISM 2006, Eighth IEEE International Symposium on Multimedia : 11 - 13 December 2006, San Diego, CA, Los Alamitos, Calif.: IEEE, 2006, S. 823–830
Jahr der Erstpublikation
2006
Sprache(n)
Deutsch
Anmerkungen

Included in the proceedings are papers presented in the following workshops and special tracks: IEEE-MIPR 2005 - 2005 IEEE International Workshop on Multimedia Information Processing and Retrieval, IEEE- WMoW 2005 - 2005 IEEE International Workshop on Multimedia Technologies over Wireless Networks, IEEE-MultiSec 2005 - 2005 IEEE International Workshop on Security and Pervasive Multimedia Environments, special track: Advances in Digital Audio Processing with Applications in Multimedia Systems

Lizenz
URN
Abstract

In peer-to-peer (P2P) networks, computers with equal rights form a logical (overlay) network in order to provide a common service that lies beyond the capacity of every single participant. Efficient similarity search is generally recognized as a frontier in research about P2P systems. One way to address it is using data source selection based approaches where peers summarize the data they contribute to the network, generating typically one summary per peer. When processing queries, these summaries are used to choose the peers (data sources) that are most likely to contribute to the query result. Only those data sources are contacted. There are two main contributions of this paper. We extend earlier work, adding a data source selection method for high-dimensional vector data, comparing different peer ranking schemes. More importantly, we present a method that uses progressive stepwise data exchange between peers to better each peer's summary and therefore improve the system's performance.

Freie Schlagwort(e)
Efficient Image Retrieval
Peer-to-Peer Networks
Dokumenttyp
Konferenzveröffentlichung
URI
Datum der Freischaltung
10.11.2025

Permalink: https://fis.uni-bamberg.de/handle/uniba/106883 · Daten als JSON · Zitieren: BibTeX · RIS

Datenstand: 15.11.2026

Eingeschränkter Lesezugriff: Anmeldung, Bearbeitung und Einreichung sind vorübergehend deaktiviert.