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.
The rapid development of networks such as internet, intranet, wireless communication etc., and multimedia techniques has emphasized on the need for copyright protection, authentication and identification and secret sharing of information. Visual cryptography is a secret sharing scheme where a secret binary image (SI) is encoded into n shares of random binary patterns. If the shares are xeroxed onto...
In this paper, an efficient watermarking algorithm for color image is proposed based on HSI color space and Discrete Wavelet Transform (DWT). The color image is firstly converted from RGB to HSI format to obtain the intensity component. Then sub-blocks of intensity are divided and sorted according to the human visual system (HVS) characteristic. Finally, the scrambled binary watermark, which is achieved...
In recent years, digital watermarking technologies are considered to be important means to protect digital image copyrights. In this paper, we combine a non-invertible watermark scheme with an HVS model adaptive watermark. The application of adaptive watermarks improves visual imperceptibility. However, we find that an adversary is able to apply ambiguity attacks on the non-invertible watermark scheme...
In the paper, a new sharing secret algorithm in stego images with authentication is presented. The proposed approach employs a novel secret image sharing scheme based on set partitioning in hierarchical trees (SPIHT) algorithm, uses two stego blocks instead of a single block for authentication, and designs the check bits by effectively combining existing authentication ideas with Hamming codes. As...
Previous proposed steganographic schemes based on tolerable error range (TER) can restrict the distortion caused by data hiding within an acceptable range, but both the stego-image and the original image are necessary for extracting the secret message. This paper presents a novel TER-based steganographic scheme, in which JPEG compression under a certain quality factor is regarded as TER, and the modification...
In this paper, a new image compression scheme by introducing visual patterns to interpolative vector quantization (IVQ) is proposed. The goal is to introduce visual patterns on designing the codebook, where only removed details that contain visual patterns and their original counterparts as pairs are trained. In the proposed scheme first input images are down-sampled by ideal filter. Then, the down...
This paper presents an image coding technique based on contourlet transform. The redundancy of the contourlet transform is eliminated by switching the LP decomposition step to separable wavelet transform. The transform is then optimized through a wavelet coefficient weighting process in order to enhance the visual quality in the image domain, and with that the directional filter bank(DFB) are employed...
The main objective of 3D mesh watermarking is to maximize the watermark strength while minimizing the visual distortion. In this paper, we propose a novel 3D mesh watermarking based on the human visual system and mesh curvature. We analyze the regionpsilas mean curvature and fluctuation of curvature, and then choose the appropriate regions with high visual masking degree, in order to embed the watermark...
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.