Digital Image Watermarking Algorithm Based on Wavelet Transform

A robust digital image watermarking algorithm in wavelet transform domain is proposed. In the algorithm the original gray image is decomposed into some coefficients in different spatial and frequency sub-bands. Using the characteristic that father node is associated with its child nodes, watermark is embedded in the father nodes by establishing a relationship between father node and the average value of its child nodes. The original carrier image is not needed in the process of watermark extraction. The experimental results show that the algorithm is invisible and robust against common image processing and attacks. Performance evaluation of wavelet based image compression using ezw and spiht algorithm Embedded Zero tree Wavelet (EZW) coding is a very effective and computationally simple technique for image compression. This principle is based on partial ordering by magnitude with a set partitioning sorting algorithm, ordered bit plane transmission, and exploitation of selfsimilarity across different scales of an image wavelet transform. Moreover, a new and different implementation based on set partitioning in hierarchical trees (SPIHT) is presented, which provides even better performance than the original EZW. The image coding results, calculated from actual file sizes and images reconstructed by the decoding algorithm, are either comparable to or surpass previous results obtained through much more sophisticated and computationally complex methods. The results for various wavelets on three different images are compared. Automatic Number Plate Recognition Automatic Number Plate Recognition (ANPR) is an image processing technology which uses number (license) plate to identify the vehicle. The objective is to design an efficient automatic authorized vehicle identification system by using the vehicle number plate. The system first captures the vehicle image. Vehicle number plate region is extracted using the image segmentation in an image. Optical character recognition technique is used for the character recognition. The resulting data is stored in text file. The system is implemented and simulated in Matlab, and it performance is tested on real image. It is observed from the experiment that the developed system successfully detects and recognize the vehicle number plate on real images. Region incrementing visual cryptography Region incrementing visual cryptography (RIVC) is a novel visual cryptography scheme used for sharing visual secrets with multiple secrecy levels in a single image. In the proposed n level RIVC scheme, the content of an image S is designated to multiple regions associated with n secret levels, and encoded to n+1 shares with the following features: (a) each share cannot obtain any of the secrets in S, (b) any t(2<t,n+1)shares can be used to reveal t-1 levels of secrets, (c) the number and locations of not-yet-revealed secrets are unknown to users, (d) all secrets in S can be disclosed when all of the n+1 shares are available, and (e) the secrets are recognized by visually inspecting correctly stacked shares without computation. The basis matrices for constructing the proposed-level RIVC with small values of n=2, 3, 4 are introduced, and the results from two experiments are presented. Super Resolution Super resolution is the ability to use multiple noisy and blurred images obtained by resolution camera and together generating a higher resolution image with greater This method is robest and fast. In robust we mean that it is resilient as possible to outliers. The system presents a simple graphical user interface which assists the user in evaluating the super-resolution algorithm and helps him choose the different parameters. Super resolution cannot be achieved when no aliasing exists in the images. The great paradox in super-resolution is that the better

camera you have, the lesser chances are you will be able to obtain more information using the SR techniques. This is due to the Nyquist theorem which in short means that is you sampled the image using a frequency which is more than double the highest frequency in the sampled data, all the information is contained in the sample, and it can be (theoretically) perfectly reconstructed. That is, all the information resides in the sample. In this system the SR algorithm assumes that the geometric motion between all images is known. For this to be true, all images should be registrated to each other. This system implements a registration algorithm based on the pyramidal Lukas-Kanade optical flow algorithm as presented in the work of Jean-Yves Bouguet: Pyramidal Implementation of the Lucas Kanade Feature Tracker, description of the algorithm. Steganography This project performs steganography using a statistical model of the carrier (or cover) media. The methodology is general, and can be applied to virtually any type of media. It can hide a large message without risking detection by certain statistical methods, and achieves maximum capacity. Using the model based methodology, an example steganography method is proposed for JPEG images which achieves a higher embedding efficiency and message capacity than previous methods while remaining secure against first order statistical attacks.