Data embedding techniques and applications

2005 ◽  
Author(s):  
Li Yang
Keyword(s):  
Data Embedding

A robust and high capacity data hiding method for JPEG compressed images with SVD-based block selection and advanced error correcting techniques

2021 ◽  
pp. 1-11
Author(s):  
Kusan Biswas
Keyword(s):  
Data Hiding ◽  
High Capacity ◽  
Error Correcting Codes ◽  
Human Vision ◽  
Data Embedding ◽  
Compressed Images ◽  
Matrix Encoding ◽  
Dct Coefficients ◽  
Capacity Data ◽  
Value Decomposition

In this paper, we propose a frequency domain data hiding method for the JPEG compressed images. The proposed method embeds data in the DCT coefficients of the selected 8 × 8 blocks. According to the theories of Human Visual Systems  (HVS), human vision is less sensitive to perturbation of pixel values in the uneven areas of the image. In this paper we propose a Singular Value Decomposition based image roughness measure (SVD-IRM) using which we select the coarse 8 × 8 blocks as data embedding destinations. Moreover, to make the embedded data more robust against re-compression attack and error due to transmission over noisy channels, we employ Turbo error correcting codes. The actual data embedding is done using a proposed variant of matrix encoding that is capable of embedding three bits by modifying only one bit in block of seven carrier features. We have carried out experiments to validate the performance and it is found that the proposed method achieves better payload capacity and visual quality and is more robust than some of the recent state-of-the-art methods proposed in the literature.

scholarly journals Generalized Reversible Data Hiding with Content-Adaptive Operation and Fast Histogram Shifting Optimization

Entropy ◽  
2021 ◽  
Vol 23 (7) ◽  
pp. 917
Author(s):  
Limengnan Zhou ◽  
Hongyu Han ◽  
Hanzhou Wu
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Hot Spot ◽  
Data Embedding ◽  
Histogram Shifting ◽  
Secret Data ◽  
Content Selection ◽  
Wide Range ◽  
Map Generation ◽  
Content Adaptive

Reversible data hiding (RDH) has become a hot spot in recent years as it allows both the secret data and the raw host to be perfectly reconstructed, which is quite desirable in sensitive applications requiring no degradation of the host. A lot of RDH algorithms have been designed by a sophisticated empirical way. It is not easy to extend them to a general case, which, to a certain extent, may have limited their wide-range applicability. Therefore, it motivates us to revisit the conventional RDH algorithms and present a general framework of RDH in this paper. The proposed framework divides the system design of RDH at the data hider side into four important parts, i.e., binary-map generation, content prediction, content selection, and data embedding, so that the data hider can easily design and implement, as well as improve, an RDH system. For each part, we introduce content-adaptive techniques that can benefit the subsequent data-embedding procedure. We also analyze the relationships between these four parts and present different perspectives. In addition, we introduce a fast histogram shifting optimization (FastHiSO) algorithm for data embedding to keep the payload-distortion performance sufficient while reducing the computational complexity. Two RDH algorithms are presented to show the efficiency and applicability of the proposed framework. It is expected that the proposed framework can benefit the design of an RDH system, and the introduced techniques can be incorporated into the design of advanced RDH algorithms.

Bi-color nonlinear data embedding and extraction of handwritten signature

2008 ◽  
Author(s):  
Samir Kumar Bandyopadhyay ◽  
Debnath Bhattacharyya ◽  
Deepsikha Debnath ◽  
Poulami Das
Keyword(s):  
Data Embedding ◽  
Handwritten Signature

scholarly journals A Distortion-Free Data Hiding Scheme for Triangular Meshes Based on Recursive Subdivision

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Yuan-Yu Tsai
Keyword(s):  
Principal Component Analysis ◽  
Data Hiding ◽  
Similarity Transformation ◽  
Principal Component ◽  
Secret Message ◽  
Subdivision Scheme ◽  
Data Embedding ◽  
Embedding Capacity ◽  
Free Data ◽  
Reversible Data Embedding

This study adopts a triangle subdivision scheme to achieve reversible data embedding. The secret message is embedded into the newly added vertices. The topology of added vertex is constructed by connecting it with the vertices of located triangle. For further raising the total embedding capacity, a recursive subdivision mechanism, terminated by a given criterion, is employed. Finally, a principal component analysis can make the stego model against similarity transformation and vertex/triangle reordering attacks. Our proposed algorithm can provide a high and adjustable embedding capacity with reversibility. The experimental results demonstrate the feasibility of our proposed algorithm.

Robust text watermarking based on line shifting

2020 ◽  
Vol 7 (1) ◽  
pp. 3-13
Author(s):  
Alexander Kozachok ◽  
Sergey Kopylov
Keyword(s):  
Block Diagram ◽  
Data Embedding ◽  
Process Data ◽  
Text Data ◽  
Data Format ◽  
Robust Watermark ◽  
Watermark Embedding ◽  
Line Spacing ◽  
On Line

 Abstract— This article presents an approach to protection of printed text data by watermark embedding in the printing process. Data protection is based on robust watermark embedding that is invariant to text data format converting into image. The choice of a robust watermark within the confines of the presented classification of digital watermark is justified. The requirements to developed robust watermark have been formed. According to the formed requirements and existing restrictions, an approach to robust watermark embedding into text data based on a steganographic algorithm of line spacing shifting has been developed. The block diagram and the description of the developed algorithm of data embedding into text data are given. An experimental estimation of the embedding capacity and perceptual invisibility of the developed data embedding approach was carried out. An approach to extract embedded information from images containing a robust watermark has been developed. The limits of the retrieval, extraction accuracy and robustness evaluation of embedded data to various transformations have been experimentally established.Tóm tắt— Bài báo trình bày cách tiếp cận để bảo vệ dữ liệu văn bản in bằng cách nhúng vào văn bản một đoạn thủy vân trong quá trình in. Bảo vệ dữ liệu dựa trên việc sử dụng thủy vân bền vững có khả năng chống lại sự chuyển đổi định dạng dữ liệu văn bản sang dữ liệu hình ảnh. Sau quá trình phân tích các hệ thống thủy vân số hiện có, nhận thấy việc lựa chọn một mô hình thủy vân bền vững là hợp lý. Do yêu cầu thực tế và các hạn chế của phương pháp nhúng thủy vân vào dữ liệu văn bản hiện có, bài báo đưa ra phương pháp nhúng mới được phát triển dựa trên một thuật toán ẩn mã sử dụng cách thay đổi khoảng cách giữa các dòng trong văn bản. Bài báo đưa ra một sơ đồ khối và mô tả thuật toán nhúng thông tin vào dữ liệu văn bản. Các thực nghiệm về khả năng nhúng và khả năng che giấu thông tin với tri giác thông thường của dữ liệu nhúng cũng được trình bày. Bài báo cũng nêu cách tiếp cận để trích xuất thông tin được nhúng từ các hình ảnh có chứa thủy vân bền vững. Bên cạnh đó, chúng tôi cũng đưa ra các giới hạn về khả năng ứng dụng của phương pháp dựa trên các thực nghiệm, các đánh giá về độ chính xác của việc trích xuất được dữ liệu và độ mạnh của phương pháp nhúng mới này đối với các phép biến đổi ảnh khác nhau. 

Sign in / Sign up

Export Citation Format

Share Document