The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In 2010, Chen et al. proposed a data hiding scheme with high payload and good visual quality. The edge information is detected and most of the secret bits are embedded into the edge area. An index pixel is chosen to record the edge information for each block. However, the embedding space will decrease because of the index pixel. Thus, we proposed a data hiding that enhances the visual quality based...
Compression and data-hiding can reduce transmission cost and secure transmissions, respectively, but hiding information directly in the compression codes is one way to meet the two requirements simultaneously. Because of the low redundancy, few lossless compression methods have been applied in the research. Lempel-Ziv-Welch (LZW) coding is a well-known lossless compression algorithm that is simple...
This paper demonstrates an effective lossless data hiding scheme using modified Huffman coding. The binary secret message is concurrently embedded and encoded with a cover medium such as a video file, an audio file, or even a text file. The proposed scheme not only provides good data hiding capacity and data recovery capability, but also being efficient in space saving (the stego medium is much smaller...
In this paper, we propose an information hiding scheme to embed secret information into the compression code of an index table. First, the codewords neighboring the current processed index along with their closest codewords form a state codebook. Two indices of the state codebook are reserved as indicators. Once the current processed index satisfies some pre-defined conditions, the current processed...
This paper proposes a data hiding method by secret sharing. The proposed method embeds a k-bit secret digit in a secret message (i.e., a bit stream, a secret image) into a cover pixel of a grayscale cover image at a time by generating two shadow pixels. The two shadow images produced by the proposed scheme are meaningful. The experimental results show that the proposed scheme achieves good visual...
A new fragile watermarking scheme for image authentication and location of areas that have been tampered with is proposed in this paper. Based on a quadratic-residue theorem, the proposed scheme generates the watermark block-by-block in the cover image. To improve security by preventing malicious attacks, such as the vector quantization attack, a pseudo-random number generator using a private key...
In this paper, two hybrid LSB substitution image hiding methods are proposed. The first method couples two previous works, the optimal LSB substitution and the optimal pixel adjustment process (OPAP), to improve the quality of the stego-image. The second method is a variation of the first one. It replaces the optimal LSB substitution with the worst LSB substitution. Based on the collaboration technologies,...
In this letter, we present a reversible data hiding scheme based on histogram modification. We exploit a binary tree structure to solve the problem of communicating pairs of peak points. Distribution of pixel differences is used to achieve large hiding capacity while keeping the distortion low. We also adopt a histogram shifting technique to prevent overflow and underflow. Performance comparisons...
In this paper, a new oblivious fragile watermarking using discrete cosine transform is proposed. It is inspired by Wong's public key watermarking scheme proposed in 1998 and aims to improve its vulnerability towards possible attacks indicated by Barreto and Holliman. Instead of making use of contextual information and making it an inter-block dependent scheme, as suggested by Barreto, we adopt another...
A high capacity reversible data-hiding scheme for annotation is presented in this paper. The proposed scheme is based on a prediction-based lossless image compression technique. Annotation data are embedded into the predictive error values of a host image during the process of lossless compression of the host image. Annotation data can be exactly extracted and the original host image can be recovered...
In this paper, a novel data hiding method employing reduplicating embedding is proposed. This method uses seven most significant bits to embed two secret digits and sets the least significant bit as an indicator. Therefore, two secret digits can be embedded into one pixel-group without using the original cover-image and extra data. Because of repeating to embed secret data, our method can provide...
Lossless data hiding enables the embedding of messages in a host image without any loss of content. In this paper, we present a lossless data hiding technique based on histogram modification for image authentication that is lossless in the sense that if the marked image is deemed authentic, the embedding distortion can be completely removed from the marked image after the embedded message has been...
A lossless information hiding scheme based on neighboring correlation is proposed in this paper. The scheme hides secret information into gray-level images according to the correlation between neighboring pixels. The performance of the proposed scheme has been evaluated in terms of payload capacity, image distortion, as well as embedding rate, and the experimental results show that the proposed lossless...
In most data-hiding schemes, the area of interest in the cover image should be protected from being modified. In this paper, we propose a data-hiding scheme in which the changeable and unchangeable pixels can be specified by the data-hider. To reduce the size of extra information, the location map used to depict the location information of changeable and unchangeable pixels is compressed by Huffman...
High payload information hiding schemes with the good visual quality of stego images are suitable for steganographic applications such as online content distribution systems. This paper proposes a novel steganographic scheme based on the (7, 4) Hamming code for digital images.The proposed scheme embeds a segment of seven secret bits into a group of seven cover pixels at a time. The experimental results...
This paper proposes a novel codebook clustering method based on the minimum spanning tree (MST). The proposed MST-based method improves stego-image quality using the pairwise nearest clustering embedding (PNCE) method proposed by Lin and Wang. In addition, the proposed method does not take as much running time as the genetic algorithm based method proposed by Wang et al. The experimental results show...
Steganography is the science of secret message delivery using cover media. A digital image is a flexible medium used to carry a secret message because the slight modification of a cover image is hard to distinguish by human eyes. The proposed method is inspired from Zhang and Wang's method and Sudoku solutions. A selected Sudoku solution is used to guide cover pixels' modification in order to imply...
Secret sharing schemes and information hiding schemes have been separately developed by many researchers over years. Some researchers have been integrated information hiding technique into their proposed secret sharing scheme with the purpose of hiding shares and authentication. However, the combination of a secret sharing scheme and an information hiding technique with high embedding capacity is...
Traditional data hiding researches are largely concentrated on the total hiding capacity versus the quality of the resulting stego-image. The aim of which is to achieve higher total hiding capacity while maintaining a less distorted stego-image. This paper is concentrated largely on the capacity-distortion control for data hiding on the VQ compressed domain. The main purpose is to achieve higher quality...
Data embedding is a technique for delivering secret data over Internet. Digital images are widely used cover media for carrying secret data. This is because the distortion of images is hard to distinguish by human eyes. Because of the image property, data embedding method embeds as many secret data as possible. This paper presents a high payload data embedding technique by employing the concepts of...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.