Distributed content-based visual information retrieval system on peer-to-peer networks

King, Irwin; Ng, Cheuk Hang; Sia, Ka Cheung

doi:10.1145/1010614.1010619

Cited by 55 publications

(33 citation statements)

References 25 publications

(21 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [5], the Firework Query Model for CBP2PIR is proposed. The main idea is to cluster peers with similar resources, using the set of feature vectors, as signature value of a peer, in order to measure similarity.…”

Section: P2p For Multimedia Content Managementmentioning

confidence: 99%

Enhanced P2P Services Providing Multimedia Content

Ardizzone

Gatani

Cascia

et al. 2007

Advances in Multimedia

View full text Add to dashboard Cite

The retrieval facilities of most Peer-to-Peer (P2P) systems are limited to queries based on unique identifiers or small sets of keywords. Unfortunately, this approach is very inadequate and inefficient when a huge amount of multimedia resources is shared. To address this major limitation, we propose an original image and video sharing system, in which a user is able to interactively search interesting resources by means of content-based image and video retrieval techniques. In order to limit the network traffic load, maximizing the usefulness of each peer contacted in the query process, we also propose the adoption of an adaptive overlay routing algorithm, exploiting compact representations of the multimedia resources shared by each peer. Experimental results confirm the validity of the proposed approach, that is capable of dynamically adapting the network topology to peer interests, on the basis of query interactions among users.

show abstract

Section: P2p For Multimedia Content Managementmentioning

confidence: 99%

Enhanced P2P Services Providing Multimedia Content

Ardizzone

Gatani

Cascia

et al. 2007

Advances in Multimedia

View full text Add to dashboard Cite

show abstract

“…There are many methods employing this model, such as SETS (Bawa et al 2003), metric space (Vlachou et al 2012), interesting-based location solution (Sripanidkulchai et al 2003), DISCOVIR (King et al 2004), P2P-CBIRM (Chen et al 2008), and SWIM (Androutsos et al 2006). Bawa et al (2003) propose a topic-segmented overlay which assigns nodes with similar content (topic) to the same group.…”

Section: Related Workmentioning

confidence: 99%

A scalable approach for content based image retrieval in cloud datacenter

Liao

Yang

et al. 2013

Inf Syst Front

View full text Add to dashboard Cite

The emergence of cloud datacenters enhances the capability of online data storage. Since massive data is stored in datacenters, it is necessary to effectively locate and access interest data in such a distributed system. However, traditional search techniques only allow users to search images over exact-match keywords through a centralized index. These techniques cannot satisfy the requirements of content based image retrieval (CBIR). In this paper, we propose a scalable image retrieval framework which can efficiently support content similarity search and semantic search in the distributed environment. Its key idea is to integrate image feature vectors into distributed hash tables (DHTs) by exploiting the property of locality sensitive hashing (LSH). Thus, images with similar content are most likely gathered into the same node without the knowledge of any global information. For searching semantically close images, the relevance feedback is adopted in our system to overcome the gap between low-level features and high-level features. We show that our approach yields high recall rate with good load balance and only requires a few number of hops.

show abstract

“…Inter-cloud routing is based on the fireworks query routing algorithm [17]. A peer P receiving message msg computes the similarity sim(q, profile(P)) between q and its profile.…”

Section: Query Routingmentioning

confidence: 99%

Anonymity and Censorship Resistance in Unstructured Overlay Networks

Backes

Hamerlik

Linari

et al. 2009

On the Move to Meaningful Internet Systems: OTM 2009

View full text Add to dashboard Cite

Abstract. This paper presents Clouds, a peer-to-peer protocol that guarantees both anonymity and censorship resistance in semantic overlay networks. The design of such a protocol needs to meet a number of challenging goals: enabling the exchange of encrypted messages without assuming previously shared secrets, avoiding centralised infrastructures, like trusted servers or gateways, and guaranteeing efficiency without establishing direct connections between peers. Anonymity is achieved by cloaking the identity of protocol participants behind groups of semantically close peers. Censorship resistance is guaranteed by a cryptographic protocol securing the anonymous communication between the querying peer and the resource provider. Although we instantiate our technique on semantic overlay networks to exploit their retrieval capabilities, our framework is general and can be applied to any unstructured overlay network. Experimental results demonstrate the security properties of Clouds under different attacks and show the message overhead and retrieval effectiveness of the protocol.

show abstract

Distributed content-based visual information retrieval system on peer-to-peer networks

Cited by 55 publications

References 25 publications

Enhanced P2P Services Providing Multimedia Content

Enhanced P2P Services Providing Multimedia Content

A scalable approach for content based image retrieval in cloud datacenter

Anonymity and Censorship Resistance in Unstructured Overlay Networks

Contact Info

Product

Resources

About