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 this paper a fuzzy-type-image-fusion technique using hybrid SPIHT and SOMA. This method shows fusion of images and can be used for fusion of multi model image. It is concluded that fusion with advanced single levels offers better fusion quality. This method provides a comparative study between proposed & literature techniques and validation of the projected algorithm as Peak Signal to Noise...
In this paper, we propose a novel method to measure the perceived picture quality of H.264 coded video based on parametric analysis of the coded bitstream. The parametric analysis means that the proposed method utilizes only bitstream parameters, while it does not have any access to the baseband signal (pixel level information) of the decoded video. The proposed method extracts quantiser-scale, slice...
G channel of the RGB color host image was divided into different bit-planes and the watermark is embedded into the lowest one. Then the binary image watermark is processed by using error correcting coding and Arnold transform before embedded. The embed position is chosen according to the secret key obtained during the course of the best scrambling degree calculation in Arnold transform, so the security...
The natural preserve transform (NPT) has been presented as a tool for fuzzy logic watermarking. This paper describes a new image watermarking technique based on naturalness preserving transform (NPT). The proposed watermarking scheme uses NPT to encode a gray scale watermarking logo image or text, into a host image at any location. This paper presents efficient non-blind and quasi-blind watermark...
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 explains algorithm of digital image watermarking using DWT for copyright protection.The detail coefficients of second level host image after taking DWT is used as a watermark key for the watermark logo insertion and extraction process. A watermark image recognition system has been developed that uses new class of local image features.These local features of image are invariant to rotation,scaling...
A novel image watermark scheme based on the shuffled frog leaping (SFL) algorithm is proposed in the paper. The watermark is embedded to the discrete multi wavelet transform (DMT) coefficients larger than some threshold values, and watermark extraction is efficiently performed with SFL algorithm. Experimental results show both the robustness under attacks and the improvement in watermarked image quality...
This paper presents a new robust watermarking scheme for color image based on a block probability inspatial domain. A binary watermark image is permutated using sequence numbers generated by a secret key and Gray code, and then embedded four times in different positions by a secret key. Each bit of the binary encoded watermark is embedded by modifying the intensities of anon-overlapping block of 8*8...
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.