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.
Many reversible watermarking algorithms have been proposed in the literature, and all of these solutions put emphasis on high embedding capacity with low distortion. In this paper, a novel reversible image watermarking method based on integer transform is presented. Through taking pixel block of arbitrary size as embedding unit, the method can provide a very high embedding capacity. For instance,...
Reversible watermarking is a special watermarking technique which allows one to extract both the hidden data and the exact original signal from the watermarked content. In this paper, a recently introduced reversible image watermarking method based on prediction-error expansion is further investigated and improved. Instead of taking the pixels with small prediction-error as embedding pixels (i.e.,...
In this paper, a recently proposed reversible image watermarking algorithm based on reversible contrast mapping (RCM) is further developed. The integer transform, RCM, which is originally defined on a pair of integers, is extended to integer array of arbitrary length. Based on this generalization, the embedding capacity can be significantly increased. Meanwhile, the embedding distortion is well controlled...
It is well-known that least significant bit (LSB) matching is an excellent steganographic algorithm with advantages of high payload, good visual/statistical imperceptibility and extreme ease of implementation. However, some steganalyzers take advantage of the distortion of one-dimensional histogram of LSB matching and can, to some extent, perceive the covert message. Following Cachin's theory, this...
Generally, the steganographic algorithm randomly selects adequate pixels for data embedding, and the embedding distortion distributes uniformly in cover data. However, uniform embedding is not an ideal approach, because the modification in smooth regions (of an image) is more likely to be perceived than in noisy regions. In this paper, in order to achieve a higher level of security, we propose a novel...
Embedding efficiency is a metric of steganographic security. Higher embedding efficiency is usually desired to get more secure steganography. Matrix embedding is proved an effective way to increase embedding efficiency of steganography, and meanwhile the choice of matrix plays a key role in matrix embedding. Different matrix (with the same dimension) usually results in different embedding efficiency...
In order to enhance the steganographic security, higher embedding efficiency (average number of secret data bits embedded per one embedding change) is desired. Matrix embedding is a well-known steganographic scheme that can improve the embedding efficiency. However, the embedding cost (running time) is expensive when employing high dimensional matrix, while higher dimensional matrix usually provides...
Embedding efficiency, which is defined as the average number of secret data bits embedded per one embedding change, is an important attribute directly influencing the security of steganography. Higher embedding efficiency is usually expected to get more secure steganographic method. In this paper, by incorporating two previously introduced techniques: the ldquosum and difference covering setrdquo...
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.