Two Embedding Algorithms in Schur-Based Image Watermarking Scheme

Digital watermarking is a potential technique for copyright protection purposes that has been widely developed in recent years. In image watermarking schemes, the embedding algorithm plays an essential role in the process of embedding and extracting information. This paper presents a Schur-based image watermarking scheme with two different embedding algorithms. The first algorithm embeds the watermark into two components of the orthogonal matrix, while the second algorithm considers the embedding element. To increase the security of the proposed scheme, the watermark image (WMI) is encoded by the Arnold transform before it is embedded into the host image. The achieved outcomes reveal that both algorithms have good performance in terms of invisibility and robustness. Besides that, the two embedding algorithms are analyzed and compared by data and illustrative examples to see the difference between them as well as their advantages and disadvantages in the watermarking scheme based on Schur decomposition (SDC).