On Building a Self-organizing Search System for Multimedia Retrieval

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F10%3A00065870" target="_blank" >RIV/00216224:14330/10:00065870 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1109/FUTURETECH.2010.5482652" target="_blank" >http://dx.doi.org/10.1109/FUTURETECH.2010.5482652</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/FUTURETECH.2010.5482652" target="_blank" >10.1109/FUTURETECH.2010.5482652</a>

Jazyk výsledku

angličtina

Název v původním jazyce

On Building a Self-organizing Search System for Multimedia Retrieval

Popis výsledku v původním jazyce

In this paper, we build a self-organizing search system that operates in an unstructured P2P network and allows users to search for multimedia data by their content. In order to efficiently route queries to relevant peers, we define and evaluate severaltechniques for joining new peers to the existing network. These techniques create new relationships between peers --- on the basis of answers returned to queries --- so that a new peer will be able to efficiently forward queries and other peers will be immediately informed about its data. In addition, we demonstrate resilience of the system to sudden peer failures by studying system performance and quality of returned answers after a large number of peers is disconnected. The experiments, evaluated on asynthetic and real-life multimedia dataset, confirm that proposed techniques are suitable for dynamic environments.

Název v anglickém jazyce

On Building a Self-organizing Search System for Multimedia Retrieval

Popis výsledku anglicky

In this paper, we build a self-organizing search system that operates in an unstructured P2P network and allows users to search for multimedia data by their content. In order to efficiently route queries to relevant peers, we define and evaluate severaltechniques for joining new peers to the existing network. These techniques create new relationships between peers --- on the basis of answers returned to queries --- so that a new peer will be able to efficiently forward queries and other peers will be immediately informed about its data. In addition, we demonstrate resilience of the system to sudden peer failures by studying system performance and quality of returned answers after a large number of peers is disconnected. The experiments, evaluated on asynthetic and real-life multimedia dataset, confirm that proposed techniques are suitable for dynamic environments.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2010

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

International Workshop on Multimedia and Semantic Technologies (MUST 2010)

ISBN

9781424469505

ISSN

—

e-ISSN

—

Počet stran výsledku

7

Strana od-do

1-7

Název nakladatele

IEEE Computer Society

Místo vydání

Red Hook, NY 12571, USA

Místo konání akce

Busan, Korea

Datum konání akce

20. 5. 2010

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—