Constraint satisfaction programming for video summarization

Sid-Ahmed Berrani 1, * Mohammed Haykel Boukadida 2 Patrick Gros 2
* Corresponding author
2 TEXMEX - Multimedia content-based indexing
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : 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.
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/hal-00909370
Contributor : Patrick Gros <>
Submitted on : Tuesday, November 26, 2013 - 3:46:46 PM
Last modification on : Friday, November 16, 2018 - 1:29:28 AM
Long-term archiving on : Thursday, February 27, 2014 - 9:20:14 AM

File

ISM013.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00909370, version 1

Citation

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⟩

Share

Metrics

Record views

357

Files downloads

448