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.
We review the state of the art in DNA micro array image compression. First, we describe the most relevant approaches published in the literature and classify them according to the stage of the typical image compression process where each approach makes its contribution. We then summarize the compression results reported for these specific-specific image compression schemes. In a set of experiments...
Payload and imperceptibility are two important features of the information hiding system, but how to taken care of these two features is the challenge to researchers. In this paper, a new method of information hiding is proposed about visual effects and safety .It doesn't transform the information at first. Transforming the image into cover by traditional Arnold transformation, and the cover is divided...
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,...
In order to solve the copyright issues brought by the distributed rendering system for three-dimensional model, we present this blind watermarking algorithm with high transparency and robustness. In the generation step, we compressed the original watermark information using the UGM model of gray system, for reducing the amount of information embedded in watermark. In the embedding step, we replace...
Zadeh-x transform algorithm is one of the important technologies in lower layer image mining. But during our experiments, we found that the mining with Zadeh-x transform will be failure in images whose gray span is large and gray levels are more than 5. So we have put forward an improved algorithm which we defined as subsection Zadeh-x transform in this paper. We separate the target from the background...
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...
RST invarian watermarking scheme is proposed in this paper based on the SIFT feature points and improved pseudo-Zernike moment. Firstly, feature points are detected using SIFT, and some suitable points are selected to form localized feature regions which are scaled to a standard sized. After computing these regions by the improved pseudo-Zernike moments of these regions , the digital watermark are...
This paper proposes a novel anti-geometrical attacks digital image watermarking scheme. In the scheme, a kind of template watermark is proposed, and we embed template watermark as well as robust watermark into images. The template watermark is designed to detect the geometrical transformation, and the robust watermark is used for labeling the copyright. Given a disputed digital image, we first implement...
Image watermarking is the robust, imperceptible embedding of a small quantity of data into a digital image, and the subsequent recovery of this data, perhaps after the watermarked image has been distorted. We present a new watermarking technique which is robust to many image distortions, in particular arbitrary affine transformations of the image. The method achieves its robustness through the use...
In this paper, we introduce a robust image watermarking method based on bi-dimensional empirical mode decomposition (BEMD) against geometric distortion. Based on the characteristics of the image theory and human visual system, the proposed method makes use of orthogonal properties of empirical mode decomposition to achieve the BEMD transform on the image. The image is decomposed into a series of IMFs...
Traditionally, the problems of applying orthogonal matching pursuit (OMP) to large images are its high computing time and its requirement for a large matrix. In this paper, we propose a fast image recovery algorithm by dividing the image into block of n??n pixels and applying OMP to each n??n block instead of the entire image. The key idea is that small matrix requires less computing time and less...
This paper investigates modified versions of Tian's difference expansion (DE) reversible watermarking scheme. While Tian's DE embeds 1 bit into a pixel pair by increasing two times the difference between adjacent pixels, the modified schemes embed log2 n bits by increasing n times the difference. Bit-rates higher than 1 bpp are obtained in a single embedding stage. Since Tian's DE is limited to 0...
This paper proposes a reversible image watermarking scheme of low distortion and relatively large capacity, wherein prediction-errors are modified at most by 1 to embed secret bits. Different from most existing predictors, where only a partial prediction context is available, we provide a full context for every pixel in our watermarking scheme. Predictors operating on full contexts are preciser and...
In this paper, we experimental investigate if the current reversible data hiding schemes are detectable. By modeling the distributions of horizontal pixel difference of natural image using generalized Gaussian model, we find that the horizontal difference histogram of watermarked image is significantly altered. Furthermore, the difference between the horizontal and the vertical difference histogram...
With the development of 3DTV, the conversion of existing 2D videos to 3D videos becomes an important component of 3D content production. One of the key steps in 2D to 3D conversion is how to generate a dense depth map. In this paper, we propose a novel depth extraction method based on motion and geometric information for 2D to 3D conversion, which consists of two major depth extraction modules, the...
In the digital watermarking technology, often using Arnold transform scrambling watermark images, but Arnold transform is given only one form and it is an open form, so reducing their security. In this paper, a species that contains a lot of FAN transform set, and Arnold transform is only one of a special case. Since the type of transformation is infinite, it will increase the difficulty of cracking...
The pure SVD based watermarking scheme does not have high data payload and high security. In this paper, we proposed a new robust multi image-watermarking scheme based on framelet and SVD. It mainly addresses the multi-user problem in digital rights management. framelet transform (first level) is applied to the gray scale cover image resulting in eight-detailed band (H1L, H2L, LH1, H1H1, H2H1, LH2,...
This paper presents an adaptive JPEG2000 compressed domain watermarking algorithm wherein the rich codestream syntax of the JPEG2000 standard is fully utilized. Firstly, the watermark embedding location is determined by the information contents (IC's for short) of the wavelet subbands, which is defined as the numbers of bytes that JPEG2000 spends to encode corresponding subbands. Then, a reference...
Perceived from the definition of compressed sensing (CS), the sparser the signal is, the better the recovery will be. Meanwhile, the third-generation wavelet-contourlet is able to sparsely represent signals and detect the singularity of smooth curve. Taking into account the mixed noise from random projection of CS model, we are trying to carry out the following: let the image transformed into contourlet...
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.