An improved video key-frame extraction algorithm leads to video watermarking
The epidemic growth of internet services has created a broad attention on digital content authentication and copyright protection. Heading the issue we are going to propose a DCT based novel approach on invisible video watermarking along with an improved video key-frame extraction algorithm. In this...
Gespeichert in:
Veröffentlicht in: | International journal of information technology (Singapore. Online) 2018-03, Vol.10 (1), p.21-34 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The epidemic growth of internet services has created a broad attention on digital content authentication and copyright protection. Heading the issue we are going to propose a DCT based novel approach on invisible video watermarking along with an improved video key-frame extraction algorithm. In this article first the key-frames (video bookmarks) of the video sequence are being extracted. In order to identify the video bookmarks, a novel method is proposed based on boundary luminosity analysis that is proven efficient regarding fast camera movement and moving objects in the video frames. A pair of secret keys will be applied during the watermark embedding phase. Our framework embeds watermarks in only those video frames which have been identified as key-frames of that video stream because, the key-frames are mostly kept as it is in different compression algorithms. The low frequency DCT coefficients of key-frames are chosen for watermarking, that again offers robustness to the compression algorithms. Instead of embedding watermark bits directly, a new method is proposed- scaled average. The watermark is perceptually invisible in the video key-frames according to human visual system. At last uncompressed video is re-reconstructed with all frames of the video in appropriate order of appearance. The watermark extraction is blind i.e., except the keys nothing is needed for watermark extraction. |
---|---|
ISSN: | 2511-2104 2511-2112 |
DOI: | 10.1007/s41870-017-0054-3 |