Bag-of-words representation with visual keypoints has recently emerged as an attractive approach for video search. In this paper, we study the degree of improvement when point-to-point (P2P) constraint is imposed on the bag-of-words. We conduct investigation on two tasks: near-duplicate keyframe (NDK) retrieval, and high-level concept classification, covering parts of TRECVID 2003 and 2005 datasets. In P2P matching, we propose a one-to-one symmetric keypoint matching strategy to diminish the noise effect during keyframe comparison. In addition, a new multi-dimensional index structure is proposed to speed up the matching process with keypoint filtering. Through experiments, we demonstrate that P2P constraint can significantly boost the performance of NDK retrieval, while showing competitive accuracy in concept classification of broadcast domain. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Zhao, W., Jiang, Y. G., & Ngo, C. W. (2006). Keyframe retrieval by keypoints: Can point-to-point matching help? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4071 LNCS, pp. 72–81). Springer Verlag. https://doi.org/10.1007/11788034_8
Mendeley helps you to discover research relevant for your work.