A novel approach is presented to select multiple key frames within an isolated video shot where there is camera motion causing significant scene change. This is achieved by determining the dominant motion between frame pairs whose similarities are represented using a directed weighted graph. The shortest path in the graph, found using the A* search algorithm, designates the key frames. The overall method can be applied to extract a set of key frames which portray both the video content and camera motions, all of which are useful features for video indexing and retrieval.
A shortest path representation for video summarisation
2003-01-01
692402 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
A Shortest Path Representation for Video Summarisation
British Library Conference Proceedings | 2003
|Learning from Multiple Sources for Video Summarisation
British Library Online Contents | 2016
|Urban K shortest path obtaining method based on shortest path tree
Europäisches Patentamt | 2024
|Geometric shortest path containers
Tema Archiv | 2004
|A Multiple Pairs Shortest Path Algorithm
British Library Online Contents | 2005
|