By Topic

Content-Based Image Retrieval On reconfigurable Peer-to-Peer networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chun-Rong Su ; Electr. Eng. Dept., Nat. Taiwan Univ. of Sci. & Technol., Taipei, Taiwan ; Jiann-Jone Chen

Performing Content-Based Image Retrieval (CBIR) from Internet databases connected through Peer-to-Peer (P2P) network, abbreviated as P2P-CBIR, helps to effectively explore the large-scale image database distributed over connected peers. Decentralized unstructured P2P framework is adopted in our system to compromise with the structured one while still reserving flexible routing control when peers join/leave or network fails. The P2P-CBIR search engine is designed to provide multi-instance query with multi-feature types to effectively reduce network traffic and maintain high retrieval accuracy. The proposed P2P-CBIR system is also designed to provide scalable retrieval control, which can adaptively control the query scope and progressively refine the accuracy of retrieved results. We also proposed to provide the most updated local database characteristics for the P2P-CBIR users. By reconfiguring system at each regular interval time, it can effectively reduce trivial peer routing and retrieval operations due to imprecise configuration. Experiments demonstrated that the average recall rate of the proposed P2P-CBIR with reconfiguration is higher than the one without about 20%, and the latter outperforms previous methods, i.e., firework query model (FQM) and breadth-first search (BFS) about 20% and 120%, respectively, under the same range of TTL values.

Published in:

Multimedia Signal Processing (MMSP), 2012 IEEE 14th International Workshop on

Date of Conference:

17-19 Sept. 2012