The Experts below are selected from a list of 4359 Experts worldwide ranked by ideXlab platform
Chin-chen Chang - One of the best experts on this subject based on the ideXlab platform.
-
Efficient QR Code Secret Embedding Mechanism Based on Hamming Code
IEEE Access, 2020Co-Authors: Peng-cheng Huang, Chin-chen Chang, Yung-hui LiAbstract:QR Code is designed as machine readable symbol, which is widely used in various fields of life due to its large message capacity and fast decoding speed. However, as a public standard, it will give rise to the security issue when delivering sensitive information with QR Code. To overcome this weakness, this paper explores the characteristic of QR Code to propose an efficient secret hiding mechanism to protect the sensitive information within QR Code. The secret message would be embedded into cover QR Code based on (8, 4) Hamming Code. The error correction capacity (ECC) of QR Code would correct the errors produced in the secret embedding procedure, and the valid marked QR Code would reduce people's curious. Compared to the state-of-art works, the proposed scheme achieves a better performance on the aspects of secret payload and embedding efficiency.
-
Two-Layer Reversible Data Hiding Based on AMBTC Image With (7, 4) Hamming Code
IEEE Access, 2020Co-Authors: Shaowei Weng, Tiancong Zhang, Bo Ou, Chin-chen ChangAbstract:In Malik et al.'s method, each pixel can be embedded with log23 bits by being modified at most 1. Thus, their method achieves significant hiding capacity while maintaining good visual quality. However, in their method, the first lower and the first upper quantization levels must be excluded from data embedding in order to ensure reversibility. To this end, we propose a two-layer reversible data hiding (RDH) scheme in combination with (7,4) Hamming Code. In the 1st-layer embedding, each block can be embedded with 16 bits. In the 2nd-layer embedding, each already-modified block can carry 6 bits or 12 bits by taking advantage of (7,4) Hamming Code that hides three bits by modifying only one bit. At most 2-bit additional information is needed to help deCoders to correctly extract the original lower and upper quantization levels. By means of two-layer embedding, our method achieves higher embedding capacity while maintaining almost the same visual quality, compared with Malik et al.'s method. Experimental results also demonstrate our effectivity.
-
reversible steganographic scheme for ambtc compressed image based on 7 4 Hamming Code
Symmetry, 2019Co-Authors: Chin-chen ChangAbstract:In recent years, compression steganography technology has attracted the attention of many scholars. Among all image compression method, absolute moment block truncation coding (AMBTC) is a simple and effective compression method. Most AMBTC-based reversible data hiding (RDH) schemes do not guarantee that the stego AMBTC compression Codes can be translated by the conventional AMBTC deCoder. In other words, they do not belong to Type I AMBTC-based RDH scheme and easily attract malicious users’ attention. To solve this problem and enhance the hiding capacity, we used (7,4) Hamming Code to design a Type I AMBTC-based RDH scheme in this paper. To provide the reversibility feature, we designed a prediction method and judgement mechanism to successfully select the embeddable blocks during the data embedding phase and data extraction and recovery phase. In comparing our approach with other BTC-based schemes, it is confirmed that our hiding capacity is increased while maintaining the limited size of the compression Codes and acceptable image quality of the stego AMBTC-compressed images.
-
ambtc based high payload data hiding with modulo 2 operation and Hamming Code
Mathematical Biosciences and Engineering, 2019Co-Authors: Li Li, Min He, Shanqing Zhang, Chin-chen ChangAbstract:An efficient data hiding method with modulo-2 operation and Hamming Code (3, 2) based on absolute moment block truncation coding (AMBTC) is proposed. In order to obtain good data hiding performance, different textures are assigned to different embedding strategies. The AMBTC compressed Codes are divided into smooth and complex blocks according to texture. In the smooth block, the secret data and the four most significant bits plane of the two quantization levels are calculated using modulo-2 operation to replace the bitmap in order to improve the security of data transmission. Moreover, Hamming Code (3, 2) is used to embed the two additional secret bits in the three significant bits planes of the two quantization levels. In the complex block, one secret bit is embedded by swapping the order of two quantization levels and flipping the bitmap. Experimental results show that the proposed method achieves higher capacity than the existing data hiding methods and maintains good visual quality.
-
a secure fragile watermarking scheme based on chaos and Hamming Code
Journal of Systems and Software, 2011Co-Authors: Chin-chen Chang, Kuo Nan ChenAbstract:In this work, a secure fragile watermarking scheme is proposed. Images are protected and any modification to an image is detected using a novel hybrid scheme combining a two-pass logistic map with Hamming Code. For security purposes, the two-pass logistic map scheme contains a private key to resist the vector quantization (VQ) attacks even though the embedding scheme is block independent. To ensure image integrity, watermarks are embedded into the to-be-protected images which are generated using Hamming Code technique. Experimental results show that the proposed scheme has satisfactory protection ability and can detect and locate various malicious tampering via image insertion, erasing, burring, sharpening, contrast modification, and even though burst bits. Additionally, experiments prove that the proposed scheme successfully resists VQ attacks.
Kuo Nan Chen - One of the best experts on this subject based on the ideXlab platform.
-
a secure fragile watermarking scheme based on chaos and Hamming Code
Journal of Systems and Software, 2011Co-Authors: Chin-chen Chang, Kuo Nan ChenAbstract:In this work, a secure fragile watermarking scheme is proposed. Images are protected and any modification to an image is detected using a novel hybrid scheme combining a two-pass logistic map with Hamming Code. For security purposes, the two-pass logistic map scheme contains a private key to resist the vector quantization (VQ) attacks even though the embedding scheme is block independent. To ensure image integrity, watermarks are embedded into the to-be-protected images which are generated using Hamming Code technique. Experimental results show that the proposed scheme has satisfactory protection ability and can detect and locate various malicious tampering via image insertion, erasing, burring, sharpening, contrast modification, and even though burst bits. Additionally, experiments prove that the proposed scheme successfully resists VQ attacks.
-
A secure fragile watermarking scheme based on chaos-and-Hamming Code
Journal of Systems and Software, 2011Co-Authors: Chin-chen Chang, Kuo Nan Chen, Chin-feng Lee, Li Jen LiuAbstract:In this work, a secure fragile watermarking scheme is proposed. Images are protected and any modification to an image is detected using a novel hybrid scheme combining a two-pass logistic map with Hamming Code. For security purposes, the two-pass logistic map scheme contains a private key to resist the vector quantization (VQ) attacks even though the embedding scheme is block independent. To ensure image integrity, watermarks are embedded into the to-be-protected images which are generated using Hamming Code technique. Experimental results show that the proposed scheme has satisfactory protection ability and can detect and locate various malicious tampering via image insertion, erasing, burring, sharpening, contrast modification, and even though burst bits. Additionally, experiments prove that the proposed scheme successfully resists VQ attacks. ?? 2011 Elsevier Inc. All rights reserved.
Li Jen Liu - One of the best experts on this subject based on the ideXlab platform.
-
A secure fragile watermarking scheme based on chaos-and-Hamming Code
Journal of Systems and Software, 2011Co-Authors: Chin-chen Chang, Kuo Nan Chen, Chin-feng Lee, Li Jen LiuAbstract:In this work, a secure fragile watermarking scheme is proposed. Images are protected and any modification to an image is detected using a novel hybrid scheme combining a two-pass logistic map with Hamming Code. For security purposes, the two-pass logistic map scheme contains a private key to resist the vector quantization (VQ) attacks even though the embedding scheme is block independent. To ensure image integrity, watermarks are embedded into the to-be-protected images which are generated using Hamming Code technique. Experimental results show that the proposed scheme has satisfactory protection ability and can detect and locate various malicious tampering via image insertion, erasing, burring, sharpening, contrast modification, and even though burst bits. Additionally, experiments prove that the proposed scheme successfully resists VQ attacks. ?? 2011 Elsevier Inc. All rights reserved.
Chin-feng Lee - One of the best experts on this subject based on the ideXlab platform.
-
A secure fragile watermarking scheme based on chaos-and-Hamming Code
Journal of Systems and Software, 2011Co-Authors: Chin-chen Chang, Kuo Nan Chen, Chin-feng Lee, Li Jen LiuAbstract:In this work, a secure fragile watermarking scheme is proposed. Images are protected and any modification to an image is detected using a novel hybrid scheme combining a two-pass logistic map with Hamming Code. For security purposes, the two-pass logistic map scheme contains a private key to resist the vector quantization (VQ) attacks even though the embedding scheme is block independent. To ensure image integrity, watermarks are embedded into the to-be-protected images which are generated using Hamming Code technique. Experimental results show that the proposed scheme has satisfactory protection ability and can detect and locate various malicious tampering via image insertion, erasing, burring, sharpening, contrast modification, and even though burst bits. Additionally, experiments prove that the proposed scheme successfully resists VQ attacks. ?? 2011 Elsevier Inc. All rights reserved.
L.m. Tombak - One of the best experts on this subject based on the ideXlab platform.
-
An alternative to the Hamming Code in the class of SEC-DED Codes in semiconductor memory
IEEE Transactions on Information Theory, 1991Co-Authors: A.a. Davydov, L.m. TombakAbstract:The Pi Code constructed by V.I. Panchenko (1987) is studied. The Pi Code as an alternative to the Hamming Code in the class of single-error-correcting and double-error-detecting Codes (SEC-DED Codes) is also considered. The Pi Code has a smaller number of words of weight 4 and provides a larger probability of triple-independent-error detection than the shortened Hamming Code with the same parameters. Shortening algorithms for the Pi Code are proposed, and parity check matrices of the (39,32), (72,64), (137,128) shortened Pi Codes are constructed. The obtained Codes can detect byte errors of length 4. The parity check matrices of the Pi Code have more 1's in rows than corresponding matrices of the Hamming Code. The Pi Code is a reasonable alternative to the Hamming Code in the class of SEC-DED Codes.
