Proceedings of the 17th ACM International Conference on Multimedia 2009
DOI: 10.1145/1631272.1631375
|View full text |Cite
|
Sign up to set email alerts
|

A compact, effective descriptor for video copy detection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
14
0
2

Year Published

2011
2011
2016
2016

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 29 publications
(16 citation statements)
references
References 13 publications
0
14
0
2
Order By: Relevance
“…Luminance based descriptors [9], dominant colour [10], gradient based features [11] and texture feature [12] are also attempted. A graph based technique has been explained in [13] to define a spatial correlation descriptor where edges represent the content proximity of the regions in the frame and a node in the graph denotes a region in the frame.…”
Section: Fingerprintmentioning
confidence: 99%
“…Luminance based descriptors [9], dominant colour [10], gradient based features [11] and texture feature [12] are also attempted. A graph based technique has been explained in [13] to define a spatial correlation descriptor where edges represent the content proximity of the regions in the frame and a node in the graph denotes a region in the frame.…”
Section: Fingerprintmentioning
confidence: 99%
“…In turn, such features are usually keypoint-based [11], [12], [13], [14], block-based [2], [15], [16] or global [17], [18]. For keypointbased approaches, SIFT features [14], [19], [20] or local descriptors around Harris interest points [12], [13], [21], [22] are a common design choice.…”
Section: Related Workmentioning
confidence: 99%
“…Such approaches can attain increased robustness to content modifications, but also entail increased computational costs. Block-based approaches [2], [15], [16] involve the calculation of certain properties of pre-defined spatial regions in the frame. Block-based methods typically entail reduced computational costs, but are also less robust to transformations such as scaling and rotation.…”
Section: Related Workmentioning
confidence: 99%
“…반면에 다 이나믹 프로그래밍(dynamic programming)을 기반으로 최 적화 문제를 해결함으로써 더욱 정밀한 프레임 단위의 정 합을 가능하게 하는 기법들도 연구되고 있다 [5][6][7] . 하지만 높 은 연산량과 많은 메모리 공간을 요구하는 단점이 있다.…”
unclassified
“…하지만 높 은 연산량과 많은 메모리 공간을 요구하는 단점이 있다. [5][6][7] 은 전역 최적화 해결방법이 지만 많은 계산량과 메모리를 요구한다. 본 연구에선 초기 정합을 실시한 후 반복적인 정합 갱신을 통해 연산량을 줄 이면서 효과적으로 정합비용 함수를 최소화한다.…”
unclassified