Passer à la navigation principale Passer à la recherche Passer au contenu principal

Theoretical limits in DWT video watermarking

  • CNRS SAMOVAR UMR 5157

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collectionContribution à une conférenceRevue par des pairs

1 Citation (Scopus)

Résumé

Nowadays, nobody doubts about the huge economical benefits the watermarking solutions will one day bring. The paper is devoted to the theoretical evaluation of the watermarking capacity, i.e. devoted to find out with mathematical rigour the maximum amount of information which can be inserted into the DWT of natural video, for prescribed constraints of transparency and robustness. The starting point is the accurate statistical model for the watermarking attacks the authors already reported. In this paper, in addition to the classical Shannon solutions, the capacity is evaluated by two approaches: (1) a method developed in order to increase speed and precision for watermarking evaluations and (2) the general Blahut-Arimoto algorithm, adapted by Justin Dauwels for the discrete case. The experiments are run on a video corpus of 10 video sequences of about 25 minutes each.

langue originaleAnglais
titreMathematics of Data/Image Pattern Recognition, Compression, and Encryption with Applications XI
Les DOIs
étatPublié - 21 nov. 2008
Modification externeOui
EvénementMathematics of Data/Image Pattern Recognition, Compression, and Encryption with Applications XI - San Diego, CA, États-Unis
Durée: 12 août 200813 août 2008

Série de publications

NomProceedings of SPIE - The International Society for Optical Engineering
Volume7075
ISSN (imprimé)0277-786X

Une conférence

Une conférenceMathematics of Data/Image Pattern Recognition, Compression, and Encryption with Applications XI
Pays/TerritoireÉtats-Unis
La villeSan Diego, CA
période12/08/0813/08/08

Empreinte digitale

Examiner les sujets de recherche de « Theoretical limits in DWT video watermarking ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation