A Fast and Efficient Framework for Indexing and Detection of Modified Copies in Video In this paper, we propose a framework for detecting near duplicate copies of a video based on an ordinal method. The framework also incorporates a bitmap indexing structure instead of a typical indexing structure used in the previous published work. Using this method, two levels of indices are constructed. The first level of this process groups each input video (represented by their key frames) into k clusters. These clusters and the associated key frames are then used to construct the first level index. The second level of this process converts ordinalbased video signatures (generated using the technique developed in earlier work) into bitmap vectors. By adopting this twolevel indexing scheme, query processing times are significantly reduced. This is because, the system is required to match only videos in the clusters that are relevant to the query and not all the videos in the database. Additionally, the technique implemented utilizes a bitmap structure for indexing, resulting in less storage space. Furthermore, we are able to employ lowcost Boolean operations such as AND, OR, and XOR in the matching process instead of Euclidean distance or other similar matching algorithms. This helps to reduce the computational time for video matching. The system has demonstrated to effectively reduce the space needed to store collections of video signatures in a database, as well as improving the overall system performance. In addition, initial results show that the system is effective and robust to several transformations such as changes in brightness, color, contrast, resolution (reduction) as well as the addition of noise.

Detection of Illegal transfer of Videos over the Internet In this paper, a method for detecting infringements or modifications of a video in realtime is proposed. The method first segments a video stream into shots, after which it extracts some reference frames as keyframes. This process is performed employing a Singular Value Decomposition (SVD) technique developed in this work. Next, for each input video (represented by its keyframes), ordinalbased signature and SIFT (Scale Invariant Feature Transform) descriptors are generated. The ordinalbased method employs a twolevel bitmap indexing scheme to construct the index for each video signature. The first level clusters all input keyframes into k clusters while the second level converts the ordinalbased signatures into bitmap vectors. On the other hand, the SIFTbased method directly uses the descriptors as the index. Given a suspect video (being streamed or transferred on the Internet), we generate the signature (ordinal and SIFT descriptors) then we compute similarity between its signature and those signatures in the database based on ordinal signature and SIFT descriptors separately. For similarity measure, besides the Euclidean distance, Boolean operators are also utilized during the matching process. We have tested our system by performing several experiments on 50 videos (each about 12 hour in duration) obtained from the TRECVID 2006 data set. For experiments set up, we refer to the conditions provided by TRECVID 2009 on Contentbased copy detection task. In addition, we also refer to the requirements issued in the call for proposals by MPEG standard on the similar task. Initial result shows that our framework is effective and robust. As compared to our previous work, on top of the achievement we obtained by reducing the storage space and time taken in the ordinal based method, by introducing the SIFT features, we could achieve an overall accuracy in F 1  measure of about 96% (improved about 8%).