Geometric Distortion Attacks Research Articles

A Novel DIBR 3D Image Hashing Scheme Based on Pixel Grouping and NMF

Most of the traditional 2D image hashing schemes do not take into account the change of viewpoint when constructing the final hash vector. This result in the classification accuracy rate is unsatisfactory when applied for depth-image-based rendering (DBIR) 3D image identification. In this work, pixel grouping based on histogram shape and nonnegative matrix factorization (NMF) are applied to design DIBR 3D image hashing with better robustness resisting to geometric distortions and higher classification accuracy rate for virtual image identification. Experiments show that the proposed hashing is robust against common signal and geometric distortion attacks, such as additive noise, blurring, JPEG compression, scaling, and rotation. Compared with the state-of-art schemes of traditional 2D image hashing, the proposed hashing achieves better performances under above attacks, especially for virtual image identification.

A novel watermarking for DIBR 3D images with geometric rectification based on feature points

Depth-image-based rendering (DIBR) has become an important technology in 3D displaying with its great advantages. As a result, more and more 3D products copyright problems turn out. Since either the center view with depth image or the synthesized virtual views could be illegally distributed, we need to protect not only the center views but also the synthesized virtual views. In this paper, a robust watermarking method for DIBR 3D images is proposed. After applying three-level DWT to the center image, we utilize spread spectrum technology to embed the watermark into suitable coefficients of the sub-blocks of the center image, by this way we make our method robust to typical signal distortions, such as JPEG compression, noise addition and median filter. Meanwhile, in order to make the proposed method robust to some common geometric distortion attacks, SIFT-based feature points are used for geometric rectification to eliminate the effect caused by geometric distortion attacks. As the experimental results shown, the proposed method is much more robust to the common signal distortion attacks with lower BER (bit error rate) compared with existing methods. With geometric rectification, our method also performs good robustness to some simple affine transformations. In addition, the proposed watermarking method also has good robustness to the common operations of DIBR processing system.

A New Image Watermarking Algorithm Using NSCT and Harris Detector in Green Manufacturing

Based on multistage theory and NSCT, a new feature-based image watermarking scheme is proposed in this paper. Firstly, the multistage Harris detector is utilized to extract steady feature points from the host image; then, the local feature regions (LFR) are ascertained adaptively according to the feature scale theory, and they are scaled to a standard size; finally, the digital watermark are embedded into no subsample contour let low frequency area, in the low frequency regions made pseudo-Zernike moment calculation. Experimental results show that the proposed scheme is not only invisible and robust against common signals processing such as median filtering, sharpening, noise adding and JPEG compression et al, but also robust against the unclassified geometric attacks such as rotation, translation, scaling, row or column removal, shearing, local geometric distortion and combination attacks et al.

Optical information encoding and image watermarking scheme based on phase-shifting interferometry and singular value decomposition

A robust image watermarking scheme based on phase-shifting interferometry (PSI) and singular value decomposition (SVD) is proposed, in which, a grayscale image watermark is encrypted into multiple interferograms using the techniques of double random-phase encoding (DRPE) and PSI. By choosing the appropriate weighting factor, the interferograms are embedded in the singular values of the R, G, and B components of the host image. The scheme achieves a high level of security due to DRPE and at the same time preserves high imperceptibility and robustness due to SVD properties. Simulated results of the proposed scheme are provided to demonstrate the high robustness, not only against the geometric distortion attacks but also against general image processing attacks.

A robust digital watermarking algorithm in undecimated discrete wavelet transform domain

In this paper, a robust digital image watermarking algorithm is proposed based on fuzzy support vector machine (FSVM) correction. The significant bitplane image is extracted from original host, and undecimated discrete wavelet transform (UDWT) is performed on the significant bitplane image. The lowpass subband is divided into small blocks, and digital watermark is embedded into original host by adaptively modulating the selected wavelet coefficients in small blocks. In order to resist geometric distortion attacks, FSVM is utilized to learn geometric distortion parameters by using low order Zernike moments. The watermark extraction is carried out after watermarked image has been synchronized without original host. Simulation also shows outstanding robustness of the proposed algorithm against most common image processing operations and geometric distortions.

REGION OF NON-INTEREST BASED DIGITAL IMAGE WATERMARKING USING NEURAL NETWORKS

Copyrights protection of digital data become inevitable in current world. Digital watermarks have been recently proposed as secured scheme for copyright protection, authentication, source tracking, and broadcast monitoring of video, audio, text data and digital images. In this paper a method to embed a watermark in region of non-interest (RONI) and a method for adaptive calculation of strength factor using neural network are proposed. The embedding and extraction processes are carried out in the transform domain by using Discrete Wavelet Transform (DWT). Finally, the algorithm robustness is tested against noise addition attacks and geometric distortion attacks. The results authenticate that the proposed watermarking algorithm does not degrade the quality of cover image as the watermark is inserted only in region of non-interest and is resistive to attacks.

Rotation, scaling and translation resilient digital image watermarking using log-polar mapping

Digital image watermarking or data hiding techniques must resist various attacks such as compression, noising and geometric distortion attacks. Rotation, scaling and translation (RST) in geometric distortion attacks are considered to be more challenging than other attacks. The log-polar mapping (LPM) coordinate is used to analyse the angle of rotation and ratio of scaling between the cover image and the corrupted watermarked image. However, the watermark or secret data are easily destroyed when inverse LPM is applied. Based on LPM, this paper presents a robust digital image watermarking technique. We discuss the appropriate watermark embedding locations in the LPM coordinates. The experiment results show that the proposed method has high wPSNR and low bit error rate (BER), and can withstand RST attacks.

Geometrically invariant watermarking: synchronization through circular Hough transform

This paper addresses a geometrically invariant watermarking method for digital images. Most previous watermarking algorithms perform weakly against geometric distortions, which desynchronize the location for the inserted watermark. Watermark synchronization, which is a process for finding the location for watermark insertion and detection, is crucial for robust watermarking. In this paper, we propose a watermarking method that is robust to geometric distortions. In order to synchronize the location for watermark insertion and detection, we use circular Hough transform, which extracts circular features that are invariant to geometric distortions. The circular features are then watermarked using additive way on the spatial domain. Our method belongs to the category of blind watermarking techniques, because we do not need the original image during detection. Experimental results support the contention that our method is useful and considerably robust against both geometric distortion attacks and signal processing attacks as listed in Stirmark 3.1.

Robust image watermarking using local invariant features and independent component analysis

This paper proposes a novel robust image watermarking scheme for digital images using local invariant features and Independent Component Analysis (ICA). Most present watermarking algorithms are unable to resist geometric distortions that desynchronize the location. The method we propose here is robust to geometric attacks. In order to resist geometric distortions, we use a local invariant feature of the image called the scale invariant feature transform, which is invariant to translation and scaling distortions. The watermark is inserted into the circular patches generated by scale-invariant key point extractor. Rotation invariance is achieved using the translation property of the polar-mapped circular patches. Our method belongs to the blind watermark category, because we use Independent Component Analysis for detection that does not need the original image during detection. Experimental results show that our method is robust against geometric distortion attacks as well as signal-processing attacks.

Robust image watermarking using local invariant features

This paper addresses a novel robust watermarking method for digital images using local invariant features. Most previous watermarking algorithms are unable to resist geometric distortions that desynchronize the location where copyright information is inserted. We propose a watermarking method that is robust to geometric distortions. In order to resist geometric distortions, we use a local invariant feature of the image called the scale-invariant feature transform (SIFT), which is invariant to translation and scaling distortions. The watermark is inserted into the circular patches generated by the SIFT. Rotation invariance is achieved using the translation property of the polar-mapped circular patches. Our method belongs to the blind watermark, because we do not need the original image during detection. We have performed an intensive simulation to show the robustness of the proposed method. The simulation results support the contention that our method is robust against geometric distortion attacks as well as signal-processing attacks. We have compared our results with those of other methods, and our method outperforms them.

Applications of the naturalness preserving transform to image watermarking and data hiding

The paper presents an image watermarking technique using the naturalness preserving transform (NPT). The goal is to produce an invisible and robust watermark that resists signal processing and geometric distortion attacks. Unlike traditional techniques, the proposed algorithm inserts and extracts the watermark via a special orthogonal transform class in between the spatial and frequency representations of the host image data. Two modified forms of the NPT employing the Hartley and discrete cosine transforms, respectively, are presented in order to improve the quality of the transformed image. Enhancements for the quality of the transformed images are achieved via reduction to the artifacts that occur to images transformed via the classical Hadamard-based NPT. The proposed watermark has demonstrated robustness against a variety of image attacks including, JPEG compression, low pass filtering, image cropping, and noise. The marked image must be severely degraded in order to prevent the reconstruction of the watermark.