scholarly journals Screen-Shooting Resilient Watermarking Scheme via Learned Invariant Keypoints and QT

Sensors ◽  
2021 ◽  
Vol 21 (19) ◽  
pp. 6554
Author(s):  
Li Li ◽  
Rui Bai ◽  
Shanqing Zhang ◽  
Chin-Chen Chang ◽  
Mengtao Shi
Keyword(s):  
Neural Networks ◽  
Fourier Transform ◽  
Discrete Fourier Transform ◽  
Tensor Decomposition ◽  
Experimental Results ◽  
Robust Watermark ◽  
Watermark Embedding ◽  
Extraction Stage ◽  
Watermarking Scheme ◽  
Watermark Algorithm

This paper proposes a screen-shooting resilient watermarking scheme via learned invariant keypoints and QT; that is, if the watermarked image is displayed on the screen and captured by a camera, the watermark can be still extracted from the photo. A screen-shooting resilient watermarking algorithm should meet the following two basic requirements: robust keypoints and a robust watermark algorithm. In our case, we embedded watermarks by combining the feature region filtering model to SuperPoint (FRFS) neural networks, quaternion discrete Fourier transform (QDFT), and tensor decomposition (TD). First we applied FRFS to locate the embedding feature regions which are decided by the keypoints that survive screen-shooting. Second, we structured watermark embedding regions centered at keypoints. Third, the watermarks were embedded by the QDFT and TD (QT) algorithm, which is robust for capturing process attacks. In a partial shooting scenario, the watermark is repeatedly embedded into different regions in an image to enhance robustness. Finally, we extracted the watermarks from at least one region at the extraction stage. The experimental results showed that the proposed scheme is very robust for camera shooting (including partial shooting) different shooting scenarios, and special attacks. Moreover, the efficient mechanism of screen-shooting resilient watermarking could have propietary protection and leak tracing applications.

A Reversible Watermarking Algorithm Resistant to Image Geometric Transformation

2019 ◽  
Vol 11 (1) ◽  
pp. 100-113
Author(s):  
Jian Li ◽  
Jinwei Wang ◽  
Shuang Yu ◽  
Xiangyang Luo
Keyword(s):  
High Performance ◽  
Side Information ◽  
Jpeg Compression ◽  
Reversible Watermarking ◽  
Experimental Results ◽  
Geometric Transformation ◽  
Original Image ◽  
Robust Watermark ◽  
Watermark Embedding ◽  
Watermarking Scheme

This article proposes a novel robust reversible watermarking algorithm. The proposed watermarking scheme is reversible because the original image can be recovered after extracting watermarks from the watermarked image, as long as it is not processed by an attacker. The scheme is robust because watermarks can still be extracted from watermarked images, even if it is undergone some malicious or normal operations like rotation and JPEG compression. It first selects two circles, which are centred at the centroid and the centre of image. Then, statistic quantities of these two circles are employed for robust watermark embedding by altering the pixels' value. The side information generated by above embedding process will be embedded as fragile watermarks at another stage to ensure the recovery of original image. Experimental results verify the high performance of the proposed algorithm in resisting various attacks, including JPEG compression and geometric transformation.

scholarly journals A Watermarking Scheme for Color Image Using Quaternion Discrete Fourier Transform and Tensor Decomposition

2021 ◽  
Vol 11 (11) ◽  
pp. 5006
Author(s):  
Li Li ◽  
Rui Bai ◽  
Jianfeng Lu ◽  
Shanqing Zhang ◽  
Ching-Chun Chang
Keyword(s):  
Fourier Transform ◽  
Discrete Fourier Transform ◽  
Color Image ◽  
Image Watermarking ◽  
Tensor Decomposition ◽  
Geometric Distortion ◽  
Support Vector ◽  
Third Order ◽  
Order Tensor ◽  
Watermarking Scheme

To protect the copyright of the color image, a color image watermarking scheme based on quaternion discrete Fourier transform (QDFT) and tensor decomposition (TD) is presented. Specifically, the cover image is partitioned into non-overlapping blocks, and then QDFT is performed on each image block. Then, the three imaginary frequency components of QDFT are used to construct a third-order tensor. The third-order tensor is decomposed by Tucker decomposition and generates a core tensor. Finally, an improved odd–even quantization technique is employed to embed a watermark in the core tensor. Moreover, pseudo-Zernike moments and multiple output least squares support vector regression (MLS–SVR) network model are used for geometric distortion correction in the watermark extraction stage. The scheme utilizes the inherent correlations among the three RGB channels of a color image, and spreads the watermark into the three channels. The experimental results indicate that the proposed scheme has better fidelity and stronger robustness for common image-processing and geometric attacks, can effectively resist each color channel exchange attack. Compared with the existing schemes, the presented scheme achieves better performance

DISTRIBUTED MULTIRESOLUTION DISCRETE FOURIER TRANSFORM AND ITS APPLICATION TO WATERMARKING

2010 ◽  
Vol 08 (02) ◽  
pp. 225-241 ◽  
Author(s):  
GAURAV BHATNAGAR ◽  
BALASUBRAMANIAN RAMAN
Keyword(s):  
Signal Processing ◽  
Fourier Transform ◽  
Discrete Fourier Transform ◽  
Digital Watermarking ◽  
Singular Values ◽  
Experimental Results ◽  
The Core ◽  
Core Idea ◽  
The Fourier Transform ◽  
Watermarking Scheme

The Fourier transform is undoubtedly one of the most valuable and frequently used tools in signal processing and analysis but it has some limitations. In this paper, we rectify these limitations by proposing a newer version of Fourier transform, namely, Distributed Multiresolution Discrete Fourier Transform (D-MR-DFT) and its application in digital watermarking. The core idea of the proposed watermarking scheme is to decompose an image into four frequency sub-bands using D-MR-DFT and then singular values of every sub-band are modified with the singular values of the watermark. The experimental results show better visual imperceptibility and resiliency of the proposed scheme against intentional or unintentional variety of attacks.

DFT TECHNIQUES FOR SIZE ESTIMATION OF DATABASE JOIN OPERATIONS

1999 ◽  
Vol 10 (01) ◽  
pp. 81-102 ◽  
Author(s):  
KAMİl SARAÇ ◽  
ÖMER EĞECİOĞLU ◽  
AMR EL ABBADI
Keyword(s):  
Fourier Transform ◽  
Discrete Fourier Transform ◽  
Frequency Distribution ◽  
Fourier Coefficients ◽  
Experimental Results ◽  
Direct Approach ◽  
Size Estimation ◽  
Logarithmic Space ◽  
Novel Algorithms ◽  
Special Case

Novel algorithms based on the Discrete Fourier Transform (DFT) are proposed to estimate the size of relations resulting from join operations. We start with an approach in which the frequency distribution values are transformed using the DFT and the Fourier coefficients are used to construct histograms. Our main contribution is a direct approach which uses the amplitudes of the DFT coefficients iteratively. The proposed algorithm gives the exact join size using logarithmic space for the special case of self join. A generalization to compute the join of arbitrary relations is then used to develop two tree-based techniques that provide a spectrum of algorithms which interpolate storage requirements versus accuracy of the estimation obtained. Finally, we present experimental results to exhibit the effectiveness of our approach.

scholarly journals LRW-CRDB: Lossless Robust Watermarking Scheme for Categorical Relational Databases

Symmetry ◽  
2021 ◽  
Vol 13 (11) ◽  
pp. 2191
Author(s):  
Chia-Chen Lin ◽  
Thai-Son Nguyen ◽  
Chin-Chen Chang
Keyword(s):  
Data Hiding ◽  
Relational Database ◽  
Relational Databases ◽  
Experimental Results ◽  
Robust Watermarking ◽  
Watermark Embedding ◽  
Lossless Watermarking ◽  
Watermarking Scheme ◽  
Reversible Watermark

In 2002, Agrawal and Kiernan defined six basic requirements, including preventing illegal watermark embedding and authentication, reversibility, robustness, and others, which must be satisfied when a reversible watermark is designed for relational databases. To meet these requirements, in this paper, a lossless watermarking scheme for a categorical relational database called LRW-CRDB (lossless robust watermarking for categorical relational databases) is proposed. In our LRW-CRDB scheme, the database owner needs to generate two secret embedding keys, K1 and K2, in advance. Then, two reference sets are generated based on two different secret embedding keys and a symmetry-based data hiding strategy, and then these are used for the watermark embedding phases. Experimental results confirmed that our LRW-CRDB scheme successfully detects 100% of hidden watermarks, even when more than 95% of the watermarked relational database has been deleted. In other words, the robustness of our proposed LRW-CRDB scheme outperforms other existing schemes under a variety of possible attacks, such as alteration, sorting, deletion, and mix-match attacks.

A DFT-Based Analysis to Discern Between Camera and Scanned Images

2012 ◽  
pp. 1-8
Author(s):  
Roberto Caldelli ◽  
Irene Amerini ◽  
Francesco Picchioni
Keyword(s):  
Fourier Transform ◽  
Discrete Fourier Transform ◽  
Digital Images ◽  
Experimental Results ◽  
Digital Photo ◽  
Geometrical Features ◽  
Pattern Noise ◽  
Photo Camera ◽  
Sensor Pattern Noise ◽  
Scanned Images

Digital images are generated by different sensors, understanding which kind of sensor has acquired a certain image could be crucial in many application scenarios where digital forensic techniques operate. In this paper a new methodology which permits to establish if a digital photo has been taken by a photo-camera or has been scanned by a scanner is presented. The specific geometrical features of the sensor pattern noise introduced by the sensor are investigated by resorting to a DFT (Discrete Fourier Transform) analysis and consequently the origin of the digital content is assessed. Experimental results are provided to witness the reliability of the proposed technique.

Sign in / Sign up

Export Citation Format

Share Document