The Most Common Characteristics of Fragile Video Watermarking: A Review

The progress of network and multimedia technologies has been phenomenal during the previous two decades. Unauthorized users will be able to copy, retransmit, modify reproduction, and upload the contents more easily as a result of this innovation. Malicious attackers are quite concerned about the development and widespread use of digital video. Digital watermarking technology gives solutions to the aforementioned problems. Watermarking methods can alleviate these issues by embedding a secret watermark in the original host data, allowing the genuine user or file owner to identify any manipulation. In this study, lots of papers have been analyzed and studied carefully, in the period 2011–2022. The historical basis of the subject should not be forgotten so studying old research will give a clear idea of the topic. To aid future researchers in this subject, we give a review of fragile watermarking approaches and some related papers presented in recent years. This paper presents a comparison of many relevant works in this field based on some of the outcomes and improvements gained in these studies, which focuses on the common characteristics that increase the effect of watermarking techniques such as invisibility, tamper detection, recovery, and security &nbsp

Digital watermarking by utilizing the properties of self-organization map based on least significant bit and most significant bit

Information security is one of the most important branches concerned with maintaining the confidentiality and reliability of data and the medium for which it is transmitted. Digital watermarking is one of the common techniques in this field and it is developing greatly and rapidly due to the great importance it represents in the field of reliability and security. Most modern watermarking systems, however, use the self-organization map (SOM), which is safer than other algorithms because an unauthorized user cannot see the result of the SOM's training. Our method presents a semi-fragile watermark under spatial domain using least significant bit (LSB) and by relying on most significant bit (MSB) when the taken values equal to (2 or 4 bits) depending on the characteristics of SOM through developing the so-called best matching unit (BMU) which working to determine the best location for concealment. As a result, it shows us the ability of the proposed method to maintain the quality of the host with the ability to retrieve data, whether it is a binary image or a secret message

Tamper detection of qur'anic text watermarking scheme based on vowel letters with Kashida using exclusive-or and queueing technique

The most sensitive Arabic text available online is the digital Holy Qur’an. This sacred Islamic religious book is recited by all Muslims worldwide including the non-Arabs as part of their worship needs. It should be protected from any kind of tampering to keep its invaluable meaning intact. Different characteristics of the Arabic letters like the vowels ( أ . و . ي ), Kashida (extended letters), and other symbols in the Holy Qur’an must be secured from alterations. The cover text of the al-Qur’an and its watermarked text are different due to the low values of the Peak Signal to Noise Ratio (PSNR), Embedding Ratio (ER), and Normalized Cross-Correlation (NCC), thus the location for tamper detection gets low accuracy. Watermarking technique with enhanced attributes must therefore be designed for the Qur’an text using Arabic vowel letters with Kashida. Most of the existing detection methods that tried to achieve accurate results related to the tampered Qur’an text often show various limitations like diacritics, alif mad surah, double space, separate shapes of Arabic letters, and Kashida. The gap addressed by this research is to improve the security of Arabic text in the Holy Qur’an by using vowel letters with Kashida. The purpose of this research is to enhance Quran text watermarking scheme based on exclusive-or and reversing with queueing techniques. The methodology consists of four phases. The first phase is pre-processing followed by the embedding process phase to hide the data after the vowel letters wherein if the secret bit is ‘1’, insert the Kashida but do not insert it if the bit is ‘0’. The third phase is extraction process and the last phase is to evaluate the performance of the proposed scheme by using PSNR (for the imperceptibility), ER (for the capacity), and NCC (for the security of the watermarking). The experimental results revealed the improvement of the NCC by 1.77 %, PSNR by 9.6 %, and ER by 8.6 % compared to available current schemes. Hence, it can be concluded that the proposed scheme has the ability to detect the location of tampering accurately for attacks of insertion, deletion, and reordering

A recent survey of self-embedding fragile watermarking scheme for image authentication with recovery capability

Abstract The rapid developments of storage technology and information exchange encourage the development of research in the field of information security. In the process of sending information, tamper and issues about data ownership may occur. The fragile watermarking is one technique that can overcome the problem, in which this technique exploits sensitivity to tamper with the inserted watermark components. Therefore, it is not tolerable to change even only one bit. Self-embedding can be defined as some important features obtained from a selected image as a watermark by modifying the pixel value of the original image. Once a picture which has been inserted with a watermark is modified by other users, it can be used for tamper detection and recovery images. Due to the importance of this fragile watermarking scheme, this paper discusses the principles and characteristics of a fragile watermarking algorithm. The main contribution of this paper survey is that it summarises the current mechanisms of selection, generation, method of watermark insertion, detection and tamper localisation and recovery procedures. Comparison of several watermarking techniques was analysed and presented in tabular form, as well as experimental evaluation of four watermarking schemes in many graphs to show the performance of the self-embedding fragile watermarking scheme