A novel modeling for video summarization using constraint satisfaction programming

5Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This 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 easily modify 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.

Cite

CITATION STYLE

APA

Boukadida, H., Berrani, S. A., & Gros, P. (2014). A novel modeling for video summarization using constraint satisfaction programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8888, pp. 208–219). Springer Verlag. https://doi.org/10.1007/978-3-319-14364-4_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free