By Topic

An Efficient Indexing for Content-based Video Search on 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
$33 $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)
Chaiyut Pradidtong-ngam ; Comput. Eng. Dept., Chiang Mai Univ., Chiang Mai, Thailand ; Jaggapong Natwichai

In the past few years, videos become an ordinary communication mean for both personal and business activities. Not only the keyword search that have been utilized widely, but also the video content-based search, i.e. given a query video, the similar video sequences can be retrieved. Meanwhile, the increasing of the video utilization has posed both the computational and communication problem since the quality of service should be considered. In this paper, we address the efficiency issue of content-based video indexing over Peer-to-Peer (P2P) networks. The traditional video index is improved to suit with the P2P computational model. The algorithms to perform the video query based on the content similarity, increase the efficiency when new P2P nodes are to be joined with the network, manage the departure of nodes, and insert the videos, are proposed based on a well-known P2P overlay network. From the experiment results, our proposed approach outperforms a naive approach, which directly applies the P2P model with fully-replication, when a number of P2P nodes to be joined, as well as a number of videos to be inserted, is increased. Meanwhile, the efficiency of our approach in terms of the query answering is bounded by linear complexity.

Published in:

P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC), 2010 International Conference on

Date of Conference:

4-6 Nov. 2010