The Experts below are selected from a list of 3990 Experts worldwide ranked by ideXlab platform
Chinchen Chang - One of the best experts on this subject based on the ideXlab platform.
-
An adaptive reversible Data Hiding Scheme based on prediction error histogram shifting by exploiting signed-digit representation
Multimedia Tools and Applications, 2020Co-Authors: Xiao-zhu Xie, Chinchen ChangAbstract:A prediction error histogram shifting (PEHS)-based reversible Data Hiding Scheme is proposed in this paper. A novel representation for the secret stream, called signed-digit representation, is proposed to improve the image quality. The secret binary stream is first converted into a signed-digit stream, which results in a high occurrence of ‘0’. Meanwhile, a block-wise-based prediction is performed on the original image to generate prediction errors, which lead to a sharp prediction error histogram. Then, the converted signed-digit stream is embedded into the prediction errors according to the improved histogram shifting (HS)-based Scheme with multiple selected peak points, resulting in an adaptive embedding capacity. The experimental results validate that the proposed Scheme outperforms state-of-the-art Schemes in terms of embedding capacity while maintaining a good image quality.
-
an efficient Data Hiding Scheme based on multidimensional mini sudoku
Sensors, 2020Co-Authors: Jihwei Horng, Chinchen Chang, Chingchun ChangAbstract:The massive Internet of Things (IoT) connecting various types of intelligent sensors for goods tracking in logistics, environmental monitoring and smart grid management is a crucial future ICT. High-end security and low power consumption are major requirements in scaling up the IoT. In this research, we propose an efficient Data-Hiding Scheme to deal with the security problems and power saving issues of multimedia communication among IoT devises. Data Hiding is the practice of Hiding secret Data into cover images in order to conceal and prevent secret Data from being intercepted by malicious attackers. One of the established research streams of Data-Hiding methods is based on reference matrices (RM). In this study, we propose an efficient Data-Hiding Scheme based on multidimensional mini-SuDoKu RM. The proposed RM possesses high complexity and can effectively improve the security of Data Hiding. In addition, this study also defines a range locator function which can significantly improve the embedding efficiency of multidimensional RM. Experimental results show that our Data-Hiding Scheme can not only obtain better image quality, but also achieve higher embedding capacity than other related Schemes.
-
An efficient general Data Hiding Scheme based on image interpolation
Journal of Information Security and Applications, 2020Co-Authors: Yong-qing Chen, Chinchen Chang, Wei-jiao Sun, Xu WangAbstract:Abstract Information exchange through public networks has the risk of information disclosure, making Data Hiding an important technique to protect privacy. Image interpolation is also a common technique in image processing. Recent years, research on Data Hiding based on image interpolation have matured. In this paper, we propose an efficient Data Hiding Scheme based on image interpolation that can be adopted into different image interpolation techniques. Different from other Schemes, the converted decimal secret Data is embedded into the cover image by adding or subtracting the cover pixels according to whether the current pixel value is lower or higher than the original pixel value and is embedded following the block complexity from high to low. Therefore, our proposed Scheme keeps a relative balance between Hiding capacity and image quality that can increase the stego-image quality and obtain a relatively higher image quality when the embedded bits are lower. The experimental results show that our proposed Scheme has a relatively higher Hiding capacity and can achieve almost a 1.6 dB increase on average compared with other Schemes. The visual effect is also superior under the different image interpolation techniques.
-
Separable Data-Hiding Scheme for Encrypted Image to Protect Privacy of User in Cloud
MDPI AG, 2019Co-Authors: Li Liu, Lifang Wang, Yun-qing Shi, Chinchen ChangAbstract:As cloud computing becomes popular, the security of users’ Data is faced with a great threat, i.e., how to protect users’ privacy has become a pressing research topic. The combination of Data Hiding and encryption can provide dual protection for private Data during cloud computing. In this paper, we propose a new separable Data-Hiding Scheme for encrypted images based on block compressive sensing. First, the original uncompressed image is compressed and encrypted by block compressive sensing (BCS) using a measurement matrix, which is known as an encryption key. Then, some additional Data can be hidden into the four least significant bits of measurement using the Data-Hiding key during the process of encoding. With an encrypted image that contains hidden Data, the receiver can extract the hidden Data or decrypt/reconstruct the protected private image, according to the key he/she possesses. This Scheme has important features of flexible compression and anti-Data-loss. The image reconstruction and Data extraction are separate processes. Experimental results have proven the expected merits of the proposed Scheme. Compared with the previous work, our proposed Scheme reduces the complexity of the Scheme and also achieves better performance in compression, anti-Data-loss, and Hiding capacity
-
Dual-image-based reversible Data Hiding Scheme with integrity verification using exploiting modification direction
'Springer Science and Business Media LLC', 2019Co-Authors: Jiang-yi Lin, Yu Chen, Chinchen ChangAbstract:Abstract(#br)In this paper, a novel dual-image-based reversible Data Hiding Scheme using exploiting modification direction (EMD) is proposed. This Scheme embeds two 5-base secret digits into each pixel pair of the cover image simultaneously according to the EMD matrix to generate two stego-pixel pairs. By shifting these stego-pixel pairs to the appropriate locations in some cases, two meaningful shadows are produced. The secret Data can be extracted accurately, and the cover image can be reconstructed completely in the Data extraction and the image reconstruction procedure, respectively. Experimental results show that our Scheme outperforms the comparative methods in terms of image quality and embedding ratio. Pixel-value differencing (PVD) histogram analysis reveals that our Scheme..
Chiachen Lin - One of the best experts on this subject based on the ideXlab platform.
-
a novel reversible Data Hiding Scheme based on ambtc compression technique
Multimedia Tools and Applications, 2015Co-Authors: Chiachen Lin, Xiaolong Liu, Weiliang Tai, Shyanming YuanAbstract:Data Hiding encompasses a wide range of applications for embedding messages in content. However, Hiding Data inevitably destroys the host image, even though the distortion is imperceptible. To enhance the Hiding capacity and maintain the quality of the host image after embedding hidden Data, in this paper, we present a high payload reversible Data Hiding Scheme that is based on the absolute moment block truncation coding (AMBTC) compression domain. We explore the redundancy in a block of AMBTC-compressed images to determine if a block is embeddable or non-embeddable. Next, we create four disjoint sets for embeddable blocks to embed Data using different combinations of the mean value and the standard deviation. Performance comparisons with other BTC-based Schemes are provided to demonstrate the superiority of the proposed Scheme.
-
a high capacity Data Hiding Scheme for binary images based on block patterns
Journal of Systems and Software, 2014Co-Authors: Chungchuan Wang, Chinchen Chang, Yafen Chang, Jinnke Jan, Chiachen LinAbstract:Abstract This paper proposes a high capacity Data Hiding Scheme for binary images based on block patterns, which can facilitate the authentication and annotation of scanned images. The Scheme proposes block patterns for a 2 × 2 block to enforce specific block-based relationship in order to embed a significant amount of Data without causing noticeable artifacts. In addition, two kinds of matching pair (MP) methods, internal adjustment MP and external adjustment MP, are designed to decrease the embedding changes. Shuffling is applied before embedding to reduce the distortion and improve the security. Experimental results show that the proposed Scheme gives a significantly improved embedding capacity than previous approaches in the same level of embedding distortion. We also analyze the perceptual impact and discuss the robustness and security issues.
-
a novel vq based reversible Data Hiding Scheme by using hybrid encoding strategies
Journal of Systems and Software, 2013Co-Authors: Chinchen Chang, Thaison Nguyen, Chiachen LinAbstract:Highlights? The secret Data can be embedded into the transformed index table of a cover image. ? The average compression rate of our Scheme is 0.325bpp and it is much better than Chen and Huang's and Chang et al.'s Schemes. ? Our embedding and extracting times are 5.491s and 0.352s. Reversible Data Hiding is a special algorithm that not only guarantees the confidential Data will be extracted accurately but also allows the original cover image to be reconstructed without distortion after the confidential Data are completely extracted. This paper proposes a new index compression and reversible Data Hiding Scheme based on side-match vector quantization (SMVQ) and search order coding (SOC). In this proposed Scheme, the confidential Data are embedded into the transformed index table of a cover image. During the extracting phase, simple steps are employed to extract the confidential Data and reconstruct the original cover image. The experimental results show that with a codebook size of 256, the average compression rate of the proposed Scheme is 0.325bpp, which is superior to that of the methods proposed by Chen and Huang (0.426bpp) and Chang et al. (0.429bpp). Additionally, the embedding and extracting times of our Scheme are 5.491s and 0.352s, respectively, demonstrating that the execution time of the proposed Scheme is much faster than that of the methods of Chen and Huang and Chang et al. Moreover, our Scheme achieves better performance than other selected reversible Data Hiding Schemes with respect to the Data embedding and Data compression rates.
-
a reversible Data Hiding Scheme for vq indices using locally adaptive coding
Journal of Visual Communication and Image Representation, 2011Co-Authors: Chinchen Chang, Thaison Nguyen, Chiachen LinAbstract:Data Hiding is designed to solve the problem of secure information exchange through public networks such as Internet. In this paper, we present an improved reversible Data Hiding Scheme that can recover original VQ indices after Data extraction. As with Chang et al.'s Scheme, our proposed Scheme also depends on the locally adaptive coding Scheme. However, experimental results confirm that the Hiding capacity of our proposed Scheme is around 1.36 bpi in most digital images, which is typically higher than that of Chang et al.'s [17]. Moreover, the average compression rate that can be achieved with our proposed Scheme is 0.49 bpp, which outperforms both Lin and Chang's Scheme (0.50bpp), Tsai (0.50 bpp), Chang et al.'s Scheme (0.53 bpp), and Yang and Lin's Scheme (0.53 bpp).
-
dct based reversible Data Hiding Scheme
Journal of Software, 2010Co-Authors: Chiachen Lin, Peifeng ShiuAbstract:To enhance the Hiding capacity of Chang et al.’s reversible DCT-based Data Hiding Scheme, in this paper we propose another method called a layer-1 Data embedding strategy. Our proposed layer-1 strategy considers some areas not used by Chang et al.’s Scheme, which we call layer-2 Data embedding. To achieve our objective, we applied Tian’s pixel expansion method to design our layer-1 Data embedding strategy. Experimental results confirm that the Hiding capacity provided by combining our strategy with Chang et al.’s is higher than that provided by the Chang et al. approach alone. Moreover, the image quality of stego-images with our proposed Scheme remains above 30 dB for most test images, which is better than the best image quality offered by Chang et al.’s Scheme. Finally, the security and reversibility of Chang et al.’s Scheme is unaffected when their layer-2 Scheme is combined with our proposed layer-1 Scheme.
Bin Yang - One of the best experts on this subject based on the ideXlab platform.
-
a high capacity reversible Data Hiding Scheme based on generalized prediction error expansion and adaptive embedding
Signal Processing, 2014Co-Authors: Xinlu Gui, Bin YangAbstract:In this paper, a high capacity reversible image Data Hiding Scheme is proposed based on a generalization of prediction-error expansion (PEE) and an adaptive embedding strategy. For each pixel, its prediction value and complexity measurement are firstly computed according to its context. Then, a certain amount of Data bits will be embedded into this pixel by the proposed generalized PEE. Here, the complexity measurement is partitioned into several levels, and the embedded Data size is determined by the complexity level such that more bits will be embedded into a pixel located in a smoother region. The complexity level partition and the embedded Data size of each level are adaptively chosen for the best performance with an advisable parameter selection strategy. In this way, the proposed Scheme can well exploit image redundancy to achieve a high capacity with rather limited distortion. Experimental results show that the proposed Scheme outperforms the conventional PEE and some state-of-the-art algorithms by improving both marked image quality and maximum embedding capacity.
-
high fidelity reversible Data Hiding Scheme based on pixel value ordering and prediction error expansion
Signal Processing, 2013Co-Authors: Bin YangAbstract:This paper presents a high-fidelity reversible Data Hiding Scheme for digital images based on a new prediction strategy called pixel-value-ordering (PVO) and the well-known prediction-error expansion (PEE) technique. Specifically, a host image is first divided into non-overlapped equal-sized blocks. Then the maximum and minimum values of each block are predicted by other pixels of the block according to their pixel value orders. With such a PVO-based predictor, Data embedding is implemented via PEE. The incorporation of PVO into PEE has an advantage in reducing the number of shifted pixels, and thus it can alleviate the degradation in image quality. Consequently, the proposed method can embed adequate Data into a host image with rather limited distortion. The PSNR of a marked image versus its original one is guaranteed to be above 51.14dB. In addition, a solution is provided to further improve the embedding performance by priorly using the flat blocks to embed Data while leaving the rough ones unchanged. We demonstrate the proposed method outperforms some advanced prior arts with abundant experimental results.
Biswapati Jana - One of the best experts on this subject based on the ideXlab platform.
-
directional pvo for reversible Data Hiding Scheme with image interpolation
Multimedia Tools and Applications, 2018Co-Authors: Sudipta Meikap, Biswapati JanaAbstract:Pixel Value Ordering (PVO) is an efficient Data Hiding Scheme where pixels are ranked in ascending order within an image block and then modify minimum and maximum pixel value to embed secret Data. The embedding capacity of existing PVO based Data Hiding Schemes were limited to embed only two bits in a row of any block and unable to perform repeated embedding. To solve the existing problem, we have proposed a generalized directional PVO (DPVO) with varying block size. The original image is partitioned into blocks and then enlarged using image interpolation. A new parameter (α) is introduced and added with maximum pixel value and subtracted from minimum pixel value to maintain the order of the rank which is dependent on the size of the image block. To improve Data Hiding capacity, overlapped embedding has been considered in three different directions (1) Horizontal, (2) Vertical and (3) Diagonal of each block. Experiments show that the proposed Scheme has a good margin of performance compared with the state-of-the-art methods. Several steganographic analysis deemed robust against several attacks.
-
reversible Data Hiding Scheme using sub sampled image exploiting lagrange s interpolating polynomial
Multimedia Tools and Applications, 2018Co-Authors: Biswapati JanaAbstract:In this paper, a new reversible Data Hiding Scheme has been proposed using lagrange’s interpolating polynomial on interpolated sub-sampled images. First, we generate sub-sampled images from original image and enlarge its size using image interpolation. Now, we convert secret message using lagrange interpolating polynomial and generate new secret message. The new secret message is divided and stored within interleaved pixel of each interpolated sub-sampled images. At the receiver end, new secret message is extracted from interleaved pixel of each sub-sampled stego images and then lagrange’s interpolation is applied to generate original secret message. The security has been enhanced due to the distributive nature of hidden Data within multiple images. The original pixels are not effected during Data embedding which assure reversibility. The proposed Scheme provides average embedding capacity with good visual quality measured by peak signal to noise ratio (PSNR) which is greater than 50 dB. It is observed that the proposed Scheme provides better performance than other existing Data Hiding Schemes in terms of Data embedding capacity, visual quality and security. We have analyzed our stego images through RS analysis, calculate relative entropy, standard deviation and correlation coefficient of original and stego image to show the robustness under various steganographic attacks.
-
dual image based reversible Data Hiding Scheme using 7 4 hamming code
Multimedia Tools and Applications, 2018Co-Authors: Biswapati Jana, Debasis Giri, Shyamal Kumar MondalAbstract:In this paper, we propose a new dual-image based reversible Data Hiding Scheme through (7,4) Hamming code (RDHHC) using shared secret key. A block of seven pixels are collected from cover image and copied into two arrays then it is adjusted redundant Least Significant Bits (LSBs) using odd parity such that any error creation is encountered at the sender end and recovered at the receiver end. Before Data embedding, we first complement the bit at shared secret position. After that, secret message bit is embedded by error creation caused by tamper in any suitable position except secret position and that error is detected as well as corrected at the receiver end using Hamming error correcting code. One shared secret position κ and one shared secret key ξ help to perform Data embedding, Data extraction and recovery of the original image. The secret Data and original cover image are successfully recovered at the receiver end from dual stego image. Finally, we compare our Scheme with other state-of-the-art methods and obtain reasonably better performance in terms of PSNR.
-
partial reversible Data Hiding Scheme using 7 4 hamming code
Multimedia Tools and Applications, 2017Co-Authors: Biswapati Jana, Debasis Giri, Shyamal Kumar MondalAbstract:In this paper, we propose a partial reversible Data Hiding Scheme using (7,4) Hamming code (PRDHHC) with secret position (κ). In this Scheme, we partition the original cover image into (7 × 7) pixel block and adjust redundant LSB bits of each row using odd parity. Then we calculate secret position κ = (δ mod 7) + 1, where δ is a shared secret key. The bit at position κ and a suitable location for hidden message bit is modified through error creation caused by tamper in each row of the selected block. For the next row, the κ is updated by the Data embedding position (ω) of the previous row. We repeat this process to embed secret message bits within the selected block. For each new block, the κ is updated by κi+1 = (κi × δ × ω) mod 7 + 1, where i = 0, 1, 2, 3, . . . , number of blocks. At the receiver end, we complement the bit at position κ then retrieve the secret message bit by applying Hamming error correcting code. The extraction process will be stopped when we find continuous no error within stego image. The propose PRDHHC Scheme extract the hidden message successfully and recover hamming adjusted cover image by complement bits at both the κ and ω positions but can not recover original cover image, that is to say, our Scheme is partial reversible. Finally, we compared our Scheme with other state-of-the-art methods and obtained reasonably better performance in terms of visual quality (measured by PSNR). Also we analyze our generated stego image using some steganalysis techniques which give promising results.
-
dual image based reversible Data Hiding Scheme using pixel value diffierence expansion
International Journal of Network Security, 2016Co-Authors: Biswapati Jana, Debasis Giri, Shyamal Kumar MondalAbstract:In this paper, we propose a dual-image based reversible Data Hiding Scheme. Here, we divide a secret message into sub-stream of size n bits, where n-1 bits are embedded using Pixel Value Diffierencing (PVD) and 1 bit is embedded using Diffierence Expansion (DE). We consider two consecutive pixels from cover image, calculate the difference between them and then embed n-1 bits secret message by modifying the pixel pair. Again, we consider that modified pixel pair to embed 1 bit secret message using embedding function. After that, we distribute these two stego pixel pairs among dual image depending on a shared secret key bit stream. At the receiver end, we ex- tract the secret message successfully and recover original cover image from dual stego image without any distortion. Finally, we compare our Scheme with other state-of-the-art methods and obtain reasonably better performance in terms of Data embedding capacity.
Thaison Nguyen - One of the best experts on this subject based on the ideXlab platform.
-
high capacity reversible Data Hiding Scheme for encrypted images
Signal Processing-image Communication, 2016Co-Authors: Thaison Nguyen, Chinchen Chang, Wenchi ChangAbstract:Reversible Data Hiding is a technique that allows embedding additional Data into encrypted images without knowing the content of the original image. The additional embedded Data can be extracted exactly and the encrypted image can be reconstructed precisely to its original version. In this paper, a novel, reversible Data Hiding technique is proposed for encrypted images. In the proposed Scheme, half of the pixels are used to classify the rest of the pixels into smooth and complex regions to provide room for embedding additional Data. The proposed Scheme can achieve complete reversibility, i.e., the Data extraction and image reconstruction are error-free. Our experimental results indicated that the proposed Scheme significantly outperforms existing Schemes in terms of embedding capacity and the visual quality of the marked decrypted image. The Scheme achieves the complete reversibility.None of incorrect bits are incurred by the proposed SchemeThe Scheme improves the visual quality of marked embedded imagesHigh embedding capacity is obtained
-
a reversible Data Hiding Scheme based on the sudoku technique
Displays, 2015Co-Authors: Thaison Nguyen, Chinchen ChangAbstract:Abstract Data Hiding, also known as information Hiding, plays an important role in information security for various purposes. Reversible Data Hiding is a technique that allows distortion-free recovery of both the cover image and the secret information. In this paper, we propose a new, reversible Data Hiding Scheme that is based on the Sudoku technique and can achieve higher embedding capacity. The proposed Scheme allows embedding more secret bits into a pair of pixels while guaranteeing the good quality of the stego-image. The experimental results showed that the proposed Scheme obtained higher embedding capacity than some other previous Schemes. In addition, our proposed Scheme maintained the good visual quality of the stego-image (i.e., PSNR > 46 dB), which outperforms some existing Schemes.
-
adaptive lossless Data Hiding Scheme for smvq compressed images using soc coding
The Smart Computing Review, 2014Co-Authors: Thaison Nguyen, Chinchen ChangAbstract:Lossless Data Hiding recovers original images precisely after secret Data are extracted. Therefore, it has received considerable attention among researchers. This paper offers an adaptive lossless Data Hiding Scheme that is based on the search-order coding (SOC) algorithm for side match vector quantization (SMVQ) compressed images. By combining SOC coding with the SMVQ algorithm, compression performance is further improved while a large amount of free space is generated to hide secret Data during the Data embedding phase. In the extracting phase, simple steps are used to extract that embedded secret Data. The same index table can be reconstructed on the receiver side, which ensures that this proposed Scheme can restore the original cover image exactly. Experimental results have demonstrated that the proposed Scheme yields a higher embedding rate and a lower compression rate than other related VQ and SMVQ based Data Hiding Schemes.
-
a novel vq based reversible Data Hiding Scheme by using hybrid encoding strategies
Journal of Systems and Software, 2013Co-Authors: Chinchen Chang, Thaison Nguyen, Chiachen LinAbstract:Highlights? The secret Data can be embedded into the transformed index table of a cover image. ? The average compression rate of our Scheme is 0.325bpp and it is much better than Chen and Huang's and Chang et al.'s Schemes. ? Our embedding and extracting times are 5.491s and 0.352s. Reversible Data Hiding is a special algorithm that not only guarantees the confidential Data will be extracted accurately but also allows the original cover image to be reconstructed without distortion after the confidential Data are completely extracted. This paper proposes a new index compression and reversible Data Hiding Scheme based on side-match vector quantization (SMVQ) and search order coding (SOC). In this proposed Scheme, the confidential Data are embedded into the transformed index table of a cover image. During the extracting phase, simple steps are employed to extract the confidential Data and reconstruct the original cover image. The experimental results show that with a codebook size of 256, the average compression rate of the proposed Scheme is 0.325bpp, which is superior to that of the methods proposed by Chen and Huang (0.426bpp) and Chang et al. (0.429bpp). Additionally, the embedding and extracting times of our Scheme are 5.491s and 0.352s, respectively, demonstrating that the execution time of the proposed Scheme is much faster than that of the methods of Chen and Huang and Chang et al. Moreover, our Scheme achieves better performance than other selected reversible Data Hiding Schemes with respect to the Data embedding and Data compression rates.
-
a reversible Data Hiding Scheme for vq indices using locally adaptive coding
Journal of Visual Communication and Image Representation, 2011Co-Authors: Chinchen Chang, Thaison Nguyen, Chiachen LinAbstract:Data Hiding is designed to solve the problem of secure information exchange through public networks such as Internet. In this paper, we present an improved reversible Data Hiding Scheme that can recover original VQ indices after Data extraction. As with Chang et al.'s Scheme, our proposed Scheme also depends on the locally adaptive coding Scheme. However, experimental results confirm that the Hiding capacity of our proposed Scheme is around 1.36 bpi in most digital images, which is typically higher than that of Chang et al.'s [17]. Moreover, the average compression rate that can be achieved with our proposed Scheme is 0.49 bpp, which outperforms both Lin and Chang's Scheme (0.50bpp), Tsai (0.50 bpp), Chang et al.'s Scheme (0.53 bpp), and Yang and Lin's Scheme (0.53 bpp).
