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.
With the rapid development of the Internet, the transmission of information between people has become simple and convenient. In the public Internet, the confidentiality of information is an important issue. This problem can be solved easily by using steganography, which also is referred to as 'data hiding.' In 2006, Zhang and Wang proposed an 'exploiting modification direction' (EMD) scheme in which...
Secret sharing is a technique that can distribute partial secret information (also called 'shares') to a specific group member. These individual shares are of no use on their own, but they can reconstruct the original secret information when the members collect all of the shares. In this paper, we proposed a novel, polynomial-based, secret sharing scheme using the absolute moment block truncation...
Steganographic coding is an important technique for ensuring the security of steganography. It allows more secret messages to be embedded with a few modifications. As a typical representative of steganographic coding, the mechanism of extended matrix coding is described in detail. And a mathematical analysis is carried out when the secret message is a 0–1 random signal. According to the hierarchical...
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...
We proposed a visual cryptography scheme based on Tu and Houpsilas visual cryptographic method to enhance the contrast and visibility for gray-level images. With more detailed distribution of codebooks, we could get good identification for those vertical edges of secret image. Especially, the smaller the image size, the better the contrast. Besides strengthening the reorganization, ours proposed scheme...
Secret information protection has received increasing attention from the information technology community. Proposing a novel information hiding scheme to effectively conceal secret information in various applications is encouraged. In this paper, we proposed a novel reversible information hiding scheme by embedding secret information into dual image. The proposed scheme first converts the secret bit...
This paper presents a reversible data embedding scheme with prediction and dissimilar techniques for palette-based images. Two embedding rules are imported in the proposed method, and no extra bit map is required to indicate which rules are applied in which pixels to embed secrets. As the experimental results show, when the hiding capacity is 255 Kb, the visual quality of the decoded image for our...
In most data-hiding schemes, the area of interest in the cover image cannot 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 Run Length...
In this paper, the code transformation algorithms between the fixed binary linear quadtree scheme (FBLQ)and the constant bit-length linear quadtree scheme(CBLQ) are proposed. There exists no code transformation algorithm between FBLQ and CBLQ. To solve this problem that when one receives a FBLQ or CBLQ code and does not have the corresponding decoding program, with our new code transformation algorithms...
The encoding process of vector quantization (VQ) is computational complex and time consuming. Compared with traditional Euclidean distance computation, some geometric properties can generate approximations with simpler computation and filter out impossible codevectors to reduce computation time. In this paper, we introduce a new approximation adopting orthogonal projection on a hyperplane for speed-up...
In this paper, a new adaptive image compression scheme based on JPEG was proposed to improve the image quality of the JPEG baseline sequential image compression codec. In this scheme, the Hough transformation technique is employed as an edge-oriented classifier to categorize image blocks into four classes. Different types of image blocks are processed by different quantization and encoding ways for...
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.