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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A shortest path representation for video summarisation


    Contributors:
    Porter, S.V. (author) / Mirmehdi, M. (author) / Thomas, B.T. (author)


    Publication date :

    2003-01-01


    Size :

    692402 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    A Shortest Path Representation for Video Summarisation

    Porter, S. / Mirmehdi, M. / Thomas, B. et al. | British Library Conference Proceedings | 2003


    Learning from Multiple Sources for Video Summarisation

    Zhu, X. / Loy, C. C. / Gong, S. | British Library Online Contents | 2016


    Urban K shortest path obtaining method based on shortest path tree

    DING JIANXUN / YANG BEINUO / DUAN RUI et al. | European Patent Office | 2024

    Free access

    Geometric shortest path containers

    Wagner, Dorothea / Wilhalm, Thomas / Zaroliagis, Christos | Tema Archive | 2004


    A Multiple Pairs Shortest Path Algorithm

    Wang, I.-L. / Johnson, E. L. / Sokol, J. S. | British Library Online Contents | 2005