Improved K-Pass Pixel Value Ordering Based Data Hiding

Weng, Shaowei; Chen, Yi; Ou, Bo; Chang, Chin‐Chen; Zhang, Chunyu

doi:10.1109/access.2019.2904174

Cited by 28 publications

(22 citation statements)

References 31 publications

(39 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A high embedding capacity maintaining satisfying visual quality was achieved thru this aforementioned method. Weng et al [23] proposed an improved k-pass PVO revisable data hiding by utilizing the location relationship of the largest and the second largest or the smallest and the second smallest pixels in a block to increase the number of embeddable pixels. Moreover, the remaining pixels are exploited together with neighbor pixels to increase the estimation accuracy of local complexity.…”

Section: Introductionmentioning

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: Introductionmentioning

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

“…Huang et al proposed a RDH algorithm for QR code [8]. The background image covered by QR code is embedded into other regions of the background image using RDH [9][10][11][12][13][14][15][16]. Once scanned, the QR code can be removed and the background image can be partially recovered.…”

Section: Introductionmentioning

confidence: 99%

Color Visual Secret Sharing for QR Code with Perfect Module Reconstruction

2019

View full text Add to dashboard Cite

Visual secret sharing is a secret sharing scheme where the decryption requires no computation. It has found many applications in online transaction security, privacy protection, and bar code security, etc. Recently, researches have indicated that combining visual secret sharing with the widely used Quick Response code may provide additional security mechanism to online transaction. However, current methods are either pixel-based, which requires high computational complexity or module-based, which sacrifices error correction capability of the original Quick Response code. Designing module-based visual secret sharing for the Quick Response code without sacrificing error correction capability is a challenging problem. To solve this problem, this paper proposes a (3, 3)-threshold visual secret sharing for Quick Response code scheme that fully explores the extra freedom provided by color visual secret sharing and color stacking. The binary secret Quick Response code is encoded into color shares. By stacking all the three shares, a binary color Quick Response code can be reconstructed. After the inherent pre-processing steps in a standard Quick Response code decoder, the original binary secret Quick Response code can be completely reconstructed. Thus, the original error correction capability of the Quick Response code is fully preserved. Theoretical analysis shows that the visual secret sharing for Quick Response code is secure under the condition that the computational device available to the attacker is limited to a decoder for standard Quick Response code. Experimental results verify that the secret Quick Response code cannot be reconstructed from just one share or any two shares. However, it can be 100% reconstructed once the three shares are stacked. The proposed visual secret sharing for Quick Response code is module-based, and it does not sacrifice the error correction capability. Furthermore, No extra pre-processing steps other than the standard Quick Response code decoder are required.

show abstract

“…This characteristic makes RDH suitable for high authentication scenarios, such as medical image processing or military communication. It is widely used in applications such as law forensics [2][3][4], military imagery, medical imagery [5], cloud storage [6,7], copyright protection [8][9][10][11], etc. The traditional RDH schemes can be classified into several categories such as lossless compression [12], difference expansion (DE) [13,14], histogram shifting (HS) [15,16], and pixel prediction [17].…”

Section: Introductionmentioning

confidence: 99%

“…Cover image ← z 1j 37: end function 38: (11) where D 3j is pseudo-random binary matrix generated by K d . Then, read the first four bits of W 2j and convert them to a column vectorz 3j .…”

mentioning

confidence: 99%

Reversible Data Hiding in Encrypted Color Halftone Images with High Capacity

et al. 2019

View full text Add to dashboard Cite

In recent years, reversible data hiding (RDH) has become a research hotspot in the field of multimedia security that has aroused more and more researchers’ attention. Most of the existing RDH algorithms are aiming at continuous-tone images. For RDH in encrypted halftone images (RDH-EH), the original cover image cannot be recovered losslessly after the watermark is extracted. For some application scenarios such as medical or military images sharing, reversibility is critical. In this paper, a reversible data hiding scheme in encrypted color halftone images (RDH-ECH) is proposed. In the watermark embedding procedure, the cover image is copied into two identical images to increase redundancy. We use wet paper code to embed the watermark into the image blocks. Thus, the receiver only needs to process the image blocks by the check matrices in order to extract the watermarks. To increase embedding capacity, we embed three layers in the embedding procedure and combine the resulting images into one image for convenience of transmission. From the experimental results, it can be concluded that the original image can be restored entirely after the watermarks are extracted. Besides, for marked color halftone images, our algorithm can implement high embedding capacity and moderate visual quality.

show abstract

Improved K-Pass Pixel Value Ordering Based Data Hiding

Cited by 28 publications

References 31 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

Color Visual Secret Sharing for QR Code with Perfect Module Reconstruction

Reversible Data Hiding in Encrypted Color Halftone Images with High Capacity

Contact Info

Product

Resources

About