Algorithmic Analysis of Invisible Video Watermarking using LSB Encoding Over a Client-Server Framework
Poorna Banerjee Dasgupta

TL;DR
This paper proposes and analyzes a 2-bit LSB-based video watermarking algorithm designed for efficient embedding and distribution over a client-server network, ensuring invisibility and robustness.
Contribution
It introduces a novel 2-bit LSB watermarking method optimized for performance in distributed video sharing environments.
Findings
Enhanced efficiency in watermark embedding and extraction
Maintains invisibility of watermarks in videos
Suitable for real-time distributed video applications
Abstract
Video watermarking is extensively used in many media-oriented applications for embedding watermarks, i.e. hidden digital data, in a video sequence to protect the video from illegal copying and to identify manipulations made in the video. In case of an invisible watermark, the human eye can not perceive any difference in the video, but a watermark extraction application can read the watermark and obtain the embedded information. Although numerous methodologies exist for embedding watermarks, many of them have shortcomings with respect to performance efficiency, especially over a distributed network. This paper proposes and analyses a 2-bit Least Significant Bit (LSB) parallel algorithmic approach for achieving performance efficiency to watermark and distribute videos over a client-server framework.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
