|
Comparison of Automatic Shot Boundary Detection Algorithms
Lienhart, Rainer
|
URL:
|
http://citeseerx.ist.psu.edu/viewdoc/download?doi=...
|
|
Weitere URL:
|
http://vis.uky.edu/~cheung/courses/ee639_fall04/re...
|
|
Dokumenttyp:
|
Konferenzveröffentlichung
|
|
Erscheinungsjahr:
|
1999
|
|
Buchtitel:
|
Storage and Retrieval for Image and Video Databases VII
|
|
Titel einer Zeitschrift oder einer Reihe:
|
Proceedings / SPIE
|
|
Band/Volume:
|
3656
|
|
Herausgeber:
|
Yeung, Minerva M.
|
|
Ort der Veröffentlichung:
|
Bellingham, Wash.
|
|
Verlag:
|
SPIE
|
|
ISBN:
|
0-8194-3127-3
|
|
Sprache der Veröffentlichung:
|
Englisch
|
|
Einrichtung:
|
Fakultät für Wirtschaftsinformatik und Wirtschaftsmathematik > Praktische Informatik IV (Effelsberg 1989-2017)
|
|
Fachgebiet:
|
004 Informatik
|
|
Abstract:
|
Various methods of automatic shot boundary detection have been proposed and claimed to perform reliably. Although the detection of edits is fundamental to any kind of video analysis since it segments a video into its basic components, the shots, only few comparative investigations on early shot boundary detection algorithms have been published. These investigations mainly concentrate on measuring the edit detection performance, however, do not consider the algorithms? ability to classify the types and to locate the boundaries of the edits correctly. This paper extends these comparative investigations. More recent algorithms designed explicitly to detect specific complex editing operations such as fades and dissolves are taken into account, and their ability to classify the types and locate the boundaries of such edits are examined. The algorithms? performance is measured in terms of hit rate, number of false hits, and miss rate for hard cuts, fades, and dissolves over a large and diverse set of video sequences. The experiments show that while hard cuts and fades can be detected reliably, dissolves are still an open research issue. The false hit rate for dis-solves is usually unacceptably high, ranging from 50% up to over 400%. Moreover, all algorithms seem to fail under roughly the same conditions.
|
 | Dieser Eintrag ist Teil der Universitätsbibliographie. |
 Suche Autoren in
Sie haben einen Fehler gefunden? Teilen Sie uns Ihren Korrekturwunsch bitte hier mit: E-Mail
Actions (login required)
 |
Eintrag anzeigen |
|
|
