By Topic

Two-step similarity matching for Content-Based Video Retrieval in P2P, 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

3 Author(s)
Jin Niu ; Sch. of Inf. Technol., Univ. of Sydney, Sydney, NSW, Australia ; Zhiyong Wang ; Dagan Feng

Multimedia data, particularly, video data, has dominated peer-to-peer (P2P) networks. Therefore, it is demanding to provide content based retrieval in P2P networks. Similarity matching is one of the challenging issues. In this paper, we present a novel two-step method to reduce computational complexity of similarity matching in P2P networks. In the first step, an efficient maximum matching (MM) technique is employed to obtain an initial set of similar video candidates. In the second step, these candidates are further selected with a more accurate, but more computationally expensive optimal matching (OM) technique. In order to further improve the computational efficiency of the proposed method, four other matching techniques are proposed to replace MM technique. Various experimental results indicate that the proposed approach is more effective for CBVR while achieving significantly computational saving.

Published in:

Multimedia and Expo (ICME), 2010 IEEE International Conference on

Date of Conference:

19-23 July 2010