Data Hiding Based on a Two-Layer Turtle Shell Matrix

Xie, Xiaozhu; Lin, Chia-Chen; Chang, Chin‐Chen

doi:10.3390/sym10020047

Cited by 25 publications

(18 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The experimental results and analysis imply that our approach outperforms other existing related methods in terms of embedding capacity and visual quality. In the future, a more efficient and lossless hiding method coworking with different kinds of matrix coding or turtle shelling matrix [41], [42] could be further explored.…”

Section: Discussionmentioning

confidence: 99%

ABMC-DH: An Adaptive Bit-Plane Data Hiding Method Based on Matrix Coding

Lin

Chang

2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

This paper proposes a novel adaptive image steganography method combining matrix coding, which can achieve better visual quality according to the given embedding rate compared with other existing schemes. The embedding processes are divided into two phases: preparation and implementation. In the preparation phase, all 128 combinations of a 7-bit binary number are classified into eight groups by a parity check matrix based on matrix coding. Thus, each group corresponds to an octal number, and contains 16 candidates. Correspondingly, all pixels of a cover image are classified into three categories by a predefined embedding rate level: low, middle, and high. In the implementation phase, each pixel in the high level can be embedded with 3 bits by substituting its 7 LSBs (Least Significant Bit) using a close candidate from the group determined by the to-be-embedded 3 bits. For the middle level, pixel pairs are used to hide 3-bit data by substituting its (3, 4) LSBs combination using a close candidate form the group determined by the to-be-embedded 3 bits. For pixels in the low level, a triple pixel combination is used to embed 3-bit data by substituting its (2, 2, 3) LSBs combination using a close candidate form the group determined by the to-be-embedded 3 bits. The experimental results indicate that the proposed scheme is optimal compared to other existing matrix-coding data hiding schemes in terms of visual quality, while providing an identical embedding capacity. INDEX TERMS Adaptive data hiding, steganography, matrix coding, optimal visual quality.

show abstract

Section: Discussionmentioning

confidence: 99%

ABMC-DH: An Adaptive Bit-Plane Data Hiding Method Based on Matrix Coding

Lin

Chang

2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

show abstract

“…From Fig. 2, we can easily find three labeled 1 grids, i.e., MG (6,8), MG(9, 7), MG (12,13), from SB c1 , SB c2 and SB c3 . Finally, according to Eq.…”

Section: ) the First Examplementioning

confidence: 99%

“…Some scholars introduced the magic matrix into data hiding schemes for increasing the payload, and thus, several types of magic matrix-based data hiding schemes were proposed, including the turtle-shell-based data hiding schemes [10]- [13], the Sudoku-based data hiding schemes [14]- [17], the squared-magic-based data hiding schemes [18]. Among these schemes, Chang et al's method [14] could embed a digit in the base-9 numeral system into one pixel pair by combining Sudoku.…”

Section: Introductionmentioning

confidence: 99%

Multi-Layer Mini-Sudoku Based High-Capacity Data Hiding Method

et al. 2020

Self Cite

View full text Add to dashboard Cite

The main purpose of data hiding is to hide secret data imperceptibly into multimedia, ensuring secure data transmission. Existing magic matrix-based data hiding schemes cannot achieve satisfactory visual quality for a given low payload because they adopt a single-layer embedding (i.e., the fixed-sized reference matrix (RM) embedding), rather than adaptive multi-layer embedding (i.e., variable-sized RM embedding). To this end, we propose an adaptive data hiding scheme by constructing multi-layer RM using mini-Sudoku. Our scheme can adjust the number of layers (e.g., one, two, or more) of the RM to obtain the desired payload (i.e., low, moderate, or large payloads). In addition, our method also has the capability of obtaining the optimal number of layers of RM achieving the highest visual quality for a given payload. For each pixel pair, our scheme selects the optimal pair having the smallest Euclidean distance with this pair as its stego pair, resulting in a large decrease in distortion. Experimental results show that our proposed scheme can obtain various payloads, and more importantly, it can achieve better or comparable rate-distortion performance than several existing magic matrix-based data hiding schemes.

show abstract

“…In this experiment, the structural similarity index measurement (SSIM) was employed to weigh the similarity between the original image and the distorted image obtained by injecting noise according to JND value generated by JND model. The SSIM index is calculated on the blocks x and y of an image [26].…”

Section: Evaluation Of the Proposed Structural Regularity-based Jnd Mmentioning

confidence: 99%

Robust Image Watermarking via Perceptual Structural Regularity-based JND Model

Wang¹,

Xu²,

Wan³

et al. 2019

KSII TIIS

View full text Add to dashboard Cite

A better tradeoff between robustness and invisibility will be realized by using the just noticeable (JND) model into the quantization-based watermarking scheme. The JND model is usually used to describe the perception characteristics of human visual systems (HVS). According to the research of cognitive science, HVS can adaptively extract the structure features of an image. However, the existing JND models in the watermarking scheme do not consider the structure features. Therefore, a novel JND model is proposed , which includes three aspects: contrast sensitivity function, luminance adaptation, and contrast masking (CM). In this model, the CM effect is modeled by analyzing the direction features and texture complexity, which meets the human visual perception characteristics and matches well with the spread transform dither modulation (STDM) watermarking framework by employing a new method to measure edge intensity. Compared with the other existing JND models, the proposed JND model based on structural regularity is more efficient and applicable in the STDM watermarking scheme. In terms of the experimental results, the proposed scheme performs better than the other watermarking scheme based on the existing JND models.

show abstract

Data Hiding Based on a Two-Layer Turtle Shell Matrix

Cited by 25 publications

References 24 publications

ABMC-DH: An Adaptive Bit-Plane Data Hiding Method Based on Matrix Coding

ABMC-DH: An Adaptive Bit-Plane Data Hiding Method Based on Matrix Coding

Multi-Layer Mini-Sudoku Based High-Capacity Data Hiding Method

Robust Image Watermarking via Perceptual Structural Regularity-based JND Model

Contact Info

Product

Resources

About