A product code in steganography with improved embedding rate

2016 ◽  
Author(s):  
Lingyu Zhang ◽  
Hongwei Li
Keyword(s):  
Product Code ◽  
Embedding Rate

scholarly journals An Improved Product Code-Based Data Hiding Scheme

2018 ◽  
Vol 8 (11) ◽  
pp. 2119
Author(s):  
Wen-Rong Zhang ◽  
Yuh-Ming Huang
Keyword(s):  
Data Hiding ◽  
The Other ◽  
Two Dimensional ◽  
Optimal Solutions ◽  
Approximation Approach ◽  
One Dimensional ◽  
Product Code ◽  
Embedding Efficiency ◽  
Matrix Embedding ◽  
Embedding Rate

This paper explores the data hiding schemes which are based on the principle of matrix embedding. Under the same embedding rate, the efficiency of each data hiding scheme is evaluated by the metric of average embedding efficiency. In the literature, both the row-column embedding and the weight approximation embedding algorithms are sub-optimal solutions for the product code-based data hiding problem. For the former, it is still based on the concept of one-dimensional (1-D) toggle syndrome, and the concept of two-dimensional (2-D) toggle syndrome is directly adopted for the latter one. Data hiding with multiple embedding channels is the practice of hiding messages into hidden media many times. Here, two multi-channel embedding-based data hiding techniques—one is the 1-D toggle syndrome-based embedding scheme (1DTS-1), and the other is the improved weight approximation-based embedding scheme (2DTS-1), are presented. In the former, the proposed one-off decision technique is used to determine the locations of the required modification bits, and the amount of modification will be reduced through utilizing the characteristics of the linear code. With the technique of the former, in the latter, the amount of modification bits can be further reduced because that a toggle array with better structure is generated, which is more suitable for being assigned as the initial toggle array while applying the weight approximation approach. The experimental results show our proposed hybrid 1-D/2-D toggle syndrome-based embedding scheme (2DTS-1) has increased the embedding efficiency by 0.1149 when compared to the weight approximation embedding algorithm. Further, the embedding efficiency of the latter one can be further and significantly enhanced through the Hamming+1 technique.

Multirate asynchronous optical CDMA system with product code

2002 ◽  
Vol 149 (5) ◽  
pp. 299-304 ◽  
Author(s):  
M.-Y. Liu ◽  
H.-W. Tsao
Keyword(s):  
Optical Cdma ◽  
Cdma System ◽  
Product Code

scholarly journals Separable Reversible Data Hiding in Encryption Image with Two-Tuples Coding

Computers ◽  
2021 ◽  
Vol 10 (7) ◽  
pp. 86
Author(s):  
Jijun Wang ◽  
Soo Fun Tan
Keyword(s):  
Image Quality ◽  
Data Hiding ◽  
Reversible Data Hiding ◽  
High Order ◽  
Coding Method ◽  
Military Applications ◽  
Social Cloud ◽  
Carrier Image ◽  
Security Surveillance ◽  
Embedding Rate

Separable Reversible Data Hiding in Encryption Image (RDH-EI) has become widely used in clinical and military applications, social cloud and security surveillance in recent years, contributing significantly to preserving the privacy of digital images. Aiming to address the shortcomings of recent works that directed to achieve high embedding rate by compensating image quality, security, reversible and separable properties, we propose a two-tuples coding method by considering the intrinsic adjacent pixels characteristics of the carrier image, which have a high redundancy between high-order bits. Subsequently, we construct RDH-EI scheme by using high-order bits compression, low-order bits combination, vacancy filling, data embedding and pixel diffusion. Unlike the conventional RDH-EI practices, which have suffered from the deterioration of the original image while embedding additional data, the content owner in our scheme generates the embeddable space in advance, thus lessening the risk of image destruction on the data hider side. The experimental results indicate the effectiveness of our scheme. A ratio of 28.91% effectively compressed the carrier images, and the embedding rate increased to 1.753 bpp with a higher image quality, measured in the PSNR of 45.76 dB.

scholarly journals A Low-Complexity Region-Based Authentication Algorithm for 3D Polygonal Models

2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Yuan-Yu Tsai ◽  
Tsung-Chieh Cheng ◽  
Yao-Hsien Huang
Keyword(s):  
Three Dimensional ◽  
Low Complexity ◽  
Secret Key ◽  
Authentication Code ◽  
Geometrical Properties ◽  
Property Evaluation ◽  
Adaptive Embedding ◽  
Local Properties ◽  
Embedding Rate ◽  
Polygonal Models

This study proposes a low-complexity region-based authentication algorithm for three-dimensional (3D) polygonal models, based on local geometrical property evaluation. A vertex traversal scheme with a secret key is adopted to classify each vertex into one of two categories: embeddable vertices and reference vertices. An embeddable vertex is one with an authentication code embedded. The algorithm then uses reference vertices to calculate local geometrical properties for the corresponding embeddable vertices. For each embeddable vertex, we feed the number of reference vertices and local properties into a hash function to generate the authentication code. The embeddable vertex is then embedded with the authentication code, which is based on a simple message-digit substitution scheme. The proposed algorithm is of low complexity and distortion-controllable and possesses a higher and more adaptive embedding capacity and a higher embedding rate than most existing region-based authentication algorithms for 3D polygonal models. The experimental results demonstrate the feasibility of the proposed algorithm.

Rethinking household demand for food diversity

2017 ◽  
Vol 119 (6) ◽  
pp. 1176-1188 ◽  
Author(s):  
Andrea M. Leschewski ◽  
Dave D. Weatherspoon ◽  
Annemarie Kuhns
Keyword(s):  
Diversity Index ◽  
Correlation Coefficients ◽  
Household Expenditures ◽  
Content Type ◽  
Product Code ◽  
Food Diversity ◽  
Food Expenditures ◽  
Food And Nutrition ◽  
The Us ◽  
Healthy Food Diversity

Purpose The purpose of this paper is to develop a group-based food diversity index, which represents diversity in household expenditures across food subgroups. The index is compared to a product code-based index and applied to reassess determinants of food diversity demand. Design/methodology/approach A group-based food diversity index is developed by adapting the US Healthy Food Diversity Index. Using Food Acquisition and Purchase Survey data on 4,341 US households, correlation coefficients, descriptive statistics and linear regressions are estimated to compare and reassess the determinants of group and product code-based food diversity demand. Findings Results show that the group and product code indices capture different forms of food diversity. The indices are only moderately correlated and have varying means and skewness. Education, gender, age, household size, race, SNAP and food expenditures are found to significantly affect food diversity. However, the magnitude and direction of the effects vary between group and product code indices. Given these differences, it is essential that studies select a diversity index that corresponds to their objective. Results suggest that group-based indices are appropriate for informing food and nutrition policy, while product code-based indices are ideal for guiding food industry management’s decision making. Originality/value A group-based food diversity index representative of household expenditures across food subgroups is developed.

Sign in / Sign up

Export Citation Format

Share Document