Abstract
A frame-level video matching algorithm, which achieves dense frame matching between near-duplicate videos, is proposed in this work. First, we propose a ternary frame descriptor for the near-duplicate video matching. The ternary descriptor partitions a frame into patches and uses ternary digits to represent relations between pairs of patches. Second, we formulate the frame-level matching problem as the minimization of a cost function, which consists of matching costs and adaptive unmatching costs. We develop an iterative refinement scheme that converges to a local minimum of the cost function. The iterative scheme performs competitively with the global optimization techniques while demands a significantly lower computational complexity. Experimental results show that the proposed algorithm achieves effective frame description and efficient frame matching of near duplicate videos.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - International Conference on Image Processing, ICIP |
| Publisher | IEEE Computer Society |
| Pages | 31-35 |
| Number of pages | 5 |
| Volume | 2015-December |
| ISBN (Print) | 9781479983391 |
| DOIs | |
| Publication status | Published - 2015 Dec 9 |
| Event | IEEE International Conference on Image Processing, ICIP 2015 - Quebec City, Canada Duration: 2015 Sept 27 → 2015 Sept 30 |
Other
| Other | IEEE International Conference on Image Processing, ICIP 2015 |
|---|---|
| Country/Territory | Canada |
| City | Quebec City |
| Period | 15/9/27 → 15/9/30 |
Keywords
- frame-level video matching
- iterative refinement
- Near-duplicate video detection
- ternary frame descriptor
ASJC Scopus subject areas
- Software
- Computer Vision and Pattern Recognition
- Signal Processing