Article
Version 1
Preserved in Portico This version is not peer-reviewed
An Innovative Information Hiding Scheme Based on Block-Wise Pixel Reordering
Version 1
: Received: 30 December 2023 / Approved: 30 December 2023 / Online: 30 December 2023 (16:30:58 CET)
A peer-reviewed article of this Preprint also exists.
Liu, J.-C.; Chi, H.-X.; Chang, C.-C.; Chang, C.-C. An Innovative Information Hiding Scheme Based on Block-Wise Pixel Reordering. Future Internet 2024, 16, 34. Liu, J.-C.; Chi, H.-X.; Chang, C.-C.; Chang, C.-C. An Innovative Information Hiding Scheme Based on Block-Wise Pixel Reordering. Future Internet 2024, 16, 34.
Abstract
Information is uploaded and downloaded through the Internet day in and day out ever since we immersed ourselves in the Internet. Data security becomes an area demanding high attention and one of the efficient techniques to protect data is data hiding. Among various data hiding schemes, more applications prefer the schemes with reversibility. In recent reversible data hiding studies, the indices of a codebook can be reordered to hide secret bits. The hiding capacity of the codeword index reordering scheme increases when the size of the codebook gets larger. Since the codewords in the codebook are not modified, the visual performance of compressed images is retained. We propose a novel scheme making use of the fundamental principle of codeword index reordering technique to hide secret data in encrypted images. By observing our experimental results, the embedding capacity is significantly larger. Secret data can be extracted when a receiver owns a data hiding key and image can be recovered when a receiver owns an encryption key.
Keywords
data hiding; vector quantization; codebook; codeword index reordering
Subject
Computer Science and Mathematics, Signal Processing
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment