AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |
Back to Blog
Visual watermark malware11/28/2023 Compared to the algorithm for embedding watermarks on the 2D-DCT coefficients, its robustness is better, but its computational complexity is higher and it takes a longer time. proposed a watermarking algorithm acting on the 3D-DCT domain. Video is a combination of two-dimensional space and one-dimensional time, and three-dimensional transformation is more comprehensive and more suitable than two-dimensional transformation. proposed a video watermarking algorithm, which can solve the address quality loss of data well however, the algorithm is complex, and the anti-rotation attack performance is poor. ![]() Combining graph-based transformation, singular value decomposition and hyperchaotic encryption, Sharma et al. DWT (Discrete Wavelet Transform), DCT (Discrete Cosine Transform) and SVD (Singular Value Decomposition) are commonly used to transform the image into the transformation domain, which then enables us to embed the watermark in the transform domain. ![]() This kind of algorithm is designed to embed and extract the watermark in the transform domain. Transform domain video watermarking is also an important branch of video experiments, and has a vast range of transform and decomposition methods that can be applied, and that have better robustness. The video watermarking algorithm based on the compressed domain is a branch of video watermarking, which is usually combined with video coding standards, including video watermarking algorithms based on MPEG-X, AVC (Advanced Video Coding)/H.264 standard and HEVC/H.265 standard. However, on the whole, the spatial domain watermarking algorithm has poor anti-attack ability and a narrow application range. For example, proposed a fragile watermarking algorithm based on the logic graph, which embeds the watermark into the least significant components of the modified image pixels. The principle of the video watermarking algorithm in the spatial domain is to embed watermark data on the basis of a processing pixel value of a video frame image. As an effective method for multimedia copyright protection, video watermarking algorithms with better robustness and more comprehensive attack resistance are urgently needed a challenging task to combat the current pervasiveness of a large quantity of digital media and tampering tools.Īt present, the research of digital watermarking technology for video is mainly based on spatial domain, compression domain and transform domain. ![]() The ensuing digital video copyright issues and data security issues frequently occur, and illegal intruders use modern technical means to arbitrarily access, copy, modify and disseminate media files, seriously threatening the legitimate interests of copyright holders, and even causing harm to personal and property safety. In recent years, the number of online videos has escalated, and it is very easy to publish and obtain video resources. The issue that the video watermarking algorithm has poor resistance to various attacks, especially the shearing attack, has been solved in this paper thus, it can be used for digital multimedia video copyright protection. The experimental results show that the algorithm ensures the invisibility of the watermark with a high signal-to-noise ratio of the video, and meanwhile has high ability and robustness against common single and combined attacks, such as filtering, noise, compression, shear, rotation and so on. ![]() Combined with NSCT, 3D-DCT and NMF, the algorithm embeds the encrypted QR code copyright watermark into the NMF base matrix to improve the anti-attack ability of the watermark under the condition of invisibility. In this paper, a video watermarking algorithm based on NSCT, pseudo 3D-DCT and NMF has been proposed. Video watermarking is an important means of video and multimedia copyright protection, but the current watermarking algorithm is difficult to ensure high robustness under various attacks.
0 Comments
Read More
Leave a Reply. |