Proceedings of the 2nd International Workshop on Computer Vision Meets Databases 2005
DOI: 10.1145/1160939.1160947
|View full text |Cite
|
Sign up to set email alerts
|

A fast shot matching strategy for detecting duplicate sequences in a television stream

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
7
0

Year Published

2006
2006
2013
2013

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 31 publications
(7 citation statements)
references
References 11 publications
0
7
0
Order By: Relevance
“…al. [18] propose a method based on signatures generated from DCT of frames and hashing. First of all, shots are extracted from videos.…”
Section: Related Workmentioning
confidence: 99%
“…al. [18] propose a method based on signatures generated from DCT of frames and hashing. First of all, shots are extracted from videos.…”
Section: Related Workmentioning
confidence: 99%
“…Current methods for solving the video retrieval/localization problem can be grouped in two main groups with distinct approaches: (i) computation of video signatures after temporal video segmentation, as described in [5], [6]; and (ii) use of matching algorithms after transformation of the video frame content into a feature vector or symbolic representation, as described in [4], [7].…”
Section: Introductionmentioning
confidence: 99%
“…Alike the method proposed in this paper, their major approach is to take a two step detection strategy; fast but rough detection in the first step, and slow but accurate confirmation in the second step. Sekimoto hash indices of features represented by DCT coefficients [5]. Yamagishi et al proposes a method that compares frames by normalized cross correlation (NCC) of their intensity histograms, accelerated by the SR-Tree indexing method [6].…”
Section: Introductionmentioning
confidence: 99%