Constraint satisfaction programming for video summarization - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Constraint satisfaction programming for video summarization


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 audio-visual 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.
Fichier principal
Vignette du fichier
ISM013.pdf (159.12 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00909370 , version 1 (26-11-2013)


  • HAL Id : hal-00909370 , version 1


Sid-Ahmed Berrani, Mohammed Haykel Boukadida, Patrick Gros. Constraint satisfaction programming for video summarization. IEEE International Symposium on Multimedia, Dec 2013, Anaheim, California, United States. ⟨hal-00909370⟩
187 View
444 Download


Gmail Facebook X LinkedIn More