A Robust Image Hashing Algorithm Resistant Against Geometrical Attacks

This paper proposes a robust image hashing method which is robust against common image processing attacks and geometric distortion attacks. In order to resist against geometric attacks, the log-polar mapping (LPM) and contourlet transform are employed to obtain the low frequency sub-band image. Then the sub-band image is divided into some non-overlapping blocks, and low and middle frequency coefficients are selected from each block after discrete cosine transform. The singular value decomposition (SVD) is applied in each block to obtain the first digit of the maximum singular value. Finally, the features are scrambled and quantized as the safe hash bits. Experimental results show that the algorithm is not only resistant against common image processing attacks and geometric distortion attacks, but also discriminative to content changes

Integration and optimization of collusion secure fingerprinting in image watermarking

Estágio realizado na Fraunhofer SIT - e orientado pelo Dr. Huajian Liu e pelo Dr. Marcel SchäferTese de mestrado integrado. Engenharia Electrotécnica e de Computadores. Faculdade de Engenharia. Universidade do Porto. 201

A single watermark based scheme for both protection and authentication of identities

The security of a watermarking scheme is mainly categorised as either robust or fragile. The former can withstand an authorised alteration/attack, primarily used in copyright protection. The latter follows a zero tolerance towards any modification, used primarily in content authentication processes. The existing literature in the field projects that two separate watermarks are required to make a watermarking scheme robust and fragile, thus making the overall process cumbersome and complex. A novel image watermarking scheme that uses only one watermark while achieving both goals of copyright protection and authentication of identities is presented. An unconventional concept of checkpointing is introduced, which equips the proposed scheme to be either robust or fragile, making it superior in its application versatility. First, watermark embedding within the host/original image is achieved by a combination of transform domain techniques along with a novel median-based embedding block selection procedure. Second, checkpointing is performed in the spatial domain. The watermarked image in the absence of an attack is correlated to the one that is being attacked, using the template energy comparison-based approach. In the case of the robust watermark, such checkpointing can establish whether the carried out attack is authorised or not, determining the successful recovery of the watermark or vice-versa. Moreover, in the case of the fragile watermark, a sole confirmation of the occurrence of an attack is sufficient to make the watermark recovery impossible. Finally, the experimental analysis of the proposed scheme illustrates its excellent performance and superiority over state-of-the-art methods within the field

A Review of 2D &3D Image Steganography Techniques

This examination displays an outline of different three-dimensional (3D) picture steganography methods from overview perspective. This paper exhibit scientific categorization of 3D picture steganography systems and distinguish the ongoing advances in this field. Steganalysis and assaults on 3D picture steganography calculations have likewise been examined. 3D picture steganography strategies in all the three spaces: geometrical, topological and portrayal areas have been contemplated and thought about among each other on different parameters, for example, inserting limit, reversibility and reaction towards assaults. A few difficulties which restrain the advancement of 3D steganography calculations have been recognized. This investigation finishes up with some valuable discoveries at last

A Localized Geometric-Distortion Resilient Digital Watermarking Scheme Using Two Kinds of Complementary Feature Points

With the rapid development of digital multimedia and internet techniques in the last few years, more and more digital images are being distributed to an ever-growing number of people for sharing, studying, or other purposes. Sharing images digitally is fast and cost-efficient thus highly desirable. However, most of those digital products are exposed without any protection. Thus, without authorization, such information can be easily transferred, copied, and tampered with by using digital multimedia editing software. Watermarking is a popular resolution to the strong need of copyright protection of digital multimedia. In the image forensics scenario, a digital watermark can be used as a tool to discriminate whether original content is tampered with or not. It is embedded on digital images as an invisible message and is used to demonstrate the proof by the owner. In this thesis, we propose a novel localized geometric-distortion resilient digital watermarking scheme to embed two invisible messages to images. Our proposed scheme utilizes two complementary watermarking techniques, namely, local circular region (LCR)-based techniques and block discrete cosine transform (DCT)-based techniques, to hide two pseudo-random binary sequences in two kinds of regions and extract these two sequences from their individual embedding regions. To this end, we use the histogram and mean statistically independent of the pixel position to embed one watermark in the LCRs, whose centers are the scale invariant feature transform (SIFT) feature points themselves that are robust against various affine transformations and common image processing attacks. This watermarking technique combines the advantages of SIFT feature point extraction, local histogram computing, and blind watermark embedding and extraction in the spatial domain to resist geometric distortions. We also use Watson’s DCT-based visual model to embed the other watermark in several rich textured 80×80 regions not covered by any embedding LCR. This watermarking technique combines the advantages of Harris feature point extraction, triangle tessellation and matching, the human visual system (HVS), the spread spectrum-based blind watermark embedding and extraction. The proposed technique then uses these combined features in a DCT domain to resist common image processing attacks and to reduce the watermark synchronization problem at the same time. These two techniques complement each other and therefore can resist geometric and common image processing attacks robustly. Our proposed watermarking approach is a robust watermarking technique that is capable of resisting geometric attacks, i.e., affine transformation (rotation, scaling, and translation) attacks and other common image processing (e.g., JPEG compression and filtering operations) attacks. It demonstrates more robustness and better performance as compared with some peer systems in the literature

A Novel DWT-Based Watermarking for Image with The SIFT

A kind of scale invariant features transformation (SIFT for short) operators on DWT domain are proposed for watermarking algorithm. Firstly, the low frequency of the image is obtained by DWT. And then the SIFT transformation is used to calculate the key feature points for the low frequency sub-image. Based on the chosen space’s key points with moderate scale, a circular area as watermark embedding area is constructed. According to the research and final results, the novel digital watermark algorithm is proposed benefiting from the characteristics of SIFT’s key points and local time-frequency of DWT. The algorithm not only has good robustness to resist on such operations as compression, shearing, noise addition, median filtering and scaling, but also has good inhibition to possible watermark fake verification

Assessment of 3D mesh watermarking techniques

With the increasing usage of three-dimensional meshes in Computer-Aided Design (CAD), medical imaging, and entertainment fields like virtual reality, etc., the authentication problems and awareness of intellectual property protection have risen since the last decade. Numerous watermarking schemes have been suggested to protect ownership and prevent the threat of data piracy. This paper begins with the potential difficulties that arose when dealing with three-dimension entities in comparison to two-dimensional entities and also lists possible algorithms suggested hitherto and their comprehensive analysis. Attacks, also play a crucial role in deciding a watermarking algorithm so an attack based analysis is also presented to analyze resilience of watermarking algorithms under several attacks. In the end, some evaluation measures and potential solutions are brooded over to design robust and oblivious watermarking schemes in the future