Near-Duplicate Keyframe Retrieval by Semi-Supervised Learning and Nonrigid Image Matching
Jianke Zhu, Steven C. H. Hoi, Michael R. Lyu and Shuicheng Yan
Updated on Nov. 22, 2008. Before downloading the material, please read and agree to the terms of using our datasets
and/or implementation. "Near-Duplicate Keyframe Retrieval by Nonrigid Image Matching," "Near-Duplicate Keyframe Retrieval by Semi-Supervised Learning and Nonrigid Image Matching," Experiments are updated. Acknowledgments: Columbia dataset, CityU dataset, SURF library, SIFT, OpenCV, and Peter Kovesi's Functions for Computer Vision Requirement: Matlab 7.3 or above, no other requirement for Experiment 3 and 4. For other experiments, OpenCV library is necessary. The NIM code is built by MSVC 9.0 in Windows, and Matlab 7.4 in Mac OSX 10.5.1. We have included the pre-built OpenCV library for windows version. As for Mac OSX, you need install OpenCV according to this guide. (**NIM may fail to be recognized as an MEX routine on previous version Matlab and MSVC in Windows, need fix in future ) Source code for the extended version with updated experiments. Feature extraction toolbox. Download Code. Archived code and data for ACM MM'08. Bug reports are welcome. Please contact Jianke Zhu (jianke.zhu_at_gmail.com).
Manuscript
Jianke Zhu, Steven C.H. Hoi, Michael R. Lyu and Shuicheng Yan
ACM Multimedia 2008, pp. 41-50. (PDF, PPT)
Jianke Zhu, Steven C.H. Hoi, Michael R. Lyu and Shuicheng Yan
CUHK technical report.
Implementation
Experiments 1
We compare the the total number of inlier matches with each of three methods: projective geometry, OOS-SIFT (with pattern entropy) and our NIM method on the SIFT features.
Note that Columbia dataset is needed for running this examples. Due to copyright permission issue, we can not provide the image files.
Experiments 2: Case Study for NIM method. [All 150 near-duplicate pairs in Columbia dataset]
Some NIM detection results on various near-duplicate keyframe cases. All 150 near-duplicate pairs in Columbia dataset can be found here.
Note that Columbia dataset is needed to run this examples. Due to copyright permission issue, we can not provide the image files.




Viewpoint changes
Viewpoint changes
Object movements
Object movements




Lens changes
Lens changes
Subimage duplicates
Subimage duplicates




Small regional changes
Small regional changes
Object movements
Object movements
Experiments 3: Ranking on the global features. [Source Code]
To examine how effective the global features are, we measure the retrieval performance of different distance measures with global features. In addition, we also asses the performance of each component of the global features as well as the combined features.
Note that we only provide the extracted features from the Columbia dataset.
Experiments 4: Performance of the Semi-supervised SVM Ranking. [Source Code]
We compare the proposed semi-supervised ranking approach using S3VM method with the conventional approaches, such as color histogram and color moments.
Note that we only provide the extracted features from the Columbia dataset.
Experiments 5: Re-ranking with NIM on Local features.[Source Code]
We evaluate the proposed NIM re-ranking method for NDK retrieval using local features. First, we study the parameter choices for the NIM ranking, then plot the comparison results with the OOS, VK method.
Experiments 6: Computational cost evaluation on NIM.[Source Code]
Finally, we empirically examine the efficiency performance of the proposed NIM and Semi-Supervised SVM method.
Back to Jianke Zhu's Home