No abstract

International audienceThis paper focuses on automatic video summarization. We propose a novel modeling for summary creation using constraint satisfaction programming (CSP). The proposed modeling aims to provide the summarization method with more flexibility. It allows users to easilymodify the expected summary depending on their preferences or the video type. Using this new modeling, constraints become easier to formulate. Moreover, the CSP solver explores more efficiently the search space. It provides more quickly better solutions. Our model is evaluated and compared with an existing modeling on tennis videos

This paper addresses the problem of automatic video summarization. The proposed solution relies on constraint satisfaction programming (CSP). Summary generation rules are expressed as constraints and the summary is created using the CSP solver given the input video, its audiovisual features and possibly user parameters (like the desired duration). The solution clearly separates production rules from the generation algorithm, which in practice allows users to easily express their constraints and preferences and also to modify them w.r.t. the target application. The solution is extensively evaluated in the context of tennis match summarization.

No abstract

No abstract