Compressed Sensing Based on the Single Layer Wavelet Transform for Image Fusion

In this paper, a new method of combination single layer wavelet transform and compressive sensing is proposed for image fusion. In which only measured the high-pass wavelet coefficients of the image but preserved the low-pass wavelet coefficient. Then, fuse the low-pass wavelet coefficients and the measurements of high-pass wavelet coefficient with different schemes. For the reconstruction, by using the minimization of total variation algorithm (TV), high-pass wavelet coefficients could be recovered by the fused measurements. Finally, the fused image could be reconstructed by the inverse wavelet transform. The experiments show the proposed method provides promising fusion performance with a low computational complexity.

Authentication Method Using a Discrete Wavelet Transform for a Digital Moving Image

Recently, several digital watermarking techniques have been proposed for hiding data in the frequency domain of moving image files to protect their copyrights. However, in order to detect the water marking sufficiently after heavy compression, it is necessary to insert the watermarking with strong intensity into a moving image, and this results in visible deterioration of the moving image. We previously proposed an authentication method using a discrete wavelet transform for a digital static image file. In contrast to digital watermarking, no additional information is inserted into the original static image in the previously proposed method, and the image is authenticated by features extracted by the wavelet transform and characteristic coding. In the present study, we developed an authentication method for a moving image by using the previously proposed method for astatic image and a newly proposed method for selecting several frames in the moving image. No additional information is inserted into the original moving image by the newly proposed method or into the original static image by the previously proposed method. The experimental results show that the proposed method has a high tolerance of authentication to both compressions and vicious attacks.

A NEW FRACTAL ZEROTREE CODING FOR WAVELET IMAGE

Based on the mechanisms underlying the performance of fractal and Discrete Wavelet Transform(DWT), one method using fractal-based self-quantization coding way to code different subband coefficients of DWT is presented. Within this method finer coefficients are fractal encoded according to the successive coarser ones. Self-similarities inherent between parent and their children at the same spatial location of the adjacent scales of similar orientation are exploited to predict variation of information across wavelet scales. On the other hand, with respect to Human Visual System(HVS) model, we assign different error thresholds to different decomposition scales, and different shape of range blocks to different orientations of the same scale, by which the perceptually lossless high compression ratio can be achieved and the matching processing can be quickened dramatically.

Quantization-Based Robust Image Watermarking Using the Dual Tree Complex Wavelet Transform

Conventional quantization index modulation (QIM) watermarking uses the fixed quantization step size for the host signal.This scheme is not robust against geometric distortions and may lead to poor fidelity in some areas of content.Thus,we proposed a quantization-based image watermarking in the dual tree complex wavelet domain.We took advantages of the dual tree complex wavelets (perfect reconstruction,approximate shift invariance,and directional selectivity).For the case of watermark detecting,the probability of false alarm and probability of false negative were exploited and verified by simulation.Experimental results demonstrate that the proposed method is robust against JPEG compression,additive white Gaussian noise (AWGN),and some kinds of geometric attacks such as scaling,rotation,etc.

New Edge-Directed Interpolation Based-Lifting DWT and MSPIHT Algorithm for Image Compression

The amount of image data generated in multimedia applications is ever increasing. The image compression plays vital role in multimedia applications. The ultimate aim of image compression is to reduce storage space without degrading image quality. Compression is required whenever the data handled is huge they may be required to sent or transmitted and also stored. The New Edge Directed Interpolation (NEDI)-based lifting Discrete Wavelet Transfrom (DWT) scheme with modified Set Partitioning In Hierarchical Trees (MSPIHT) algorithm is proposed in this paper. The NEDI algorithm gives good visual quality image particularly at edges. The main objective of this paper is to be preserving the edges while performing image compression which is a challenging task. The NEDI with lifting DWT has achieved 99.18% energy level in the low frequency ranges which has 1.07% higher than 5/3 Wavelet decomposition and 0.94% higher than traditional DWT. To implement this NEDI with Lifting DWT along with MSPIHT algorithm which gives higher Peak Signal to Noise Ratio (PSNR) value and minimum Mean Square Error (MSE) and hence better image quality. The experimental results proved that the proposed method gives better PSNR value (39.40 dB for rate 0.9 bpp without arithmetic coding) and minimum MSE value is 7.4.

Entropy of images after wavelet transform

We studied the variation of image entropy before and after wavelet decomposition, the optimal number of wavelet decomposition layers, and the effect of wavelet bases and image frequency components on entropy. Numerous experiments were done on typical images to calculate (using Matlab) the entropy before and after wavelet transform. It was verified that, to obtain minimal entropy, a three-layer decomposition should be adopted rather than higher orders. The result achieved by using biorthogonal wavelet decomposition is better than that of the orthogonal wavelet decomposition. The results are not directly proportional to the vanishing moment, however.

An Improved EZW Hyperspectral Image Compression

The paper describes an efficient lossy and lossless three dimensional (3D) image compression of hyperspectral images. The method adopts the 3D spatial-spectral hybrid transform and the proposed transform-based coder. The hybrid transforms are that Karhunen-Loève Transform (KLT) which decorrelates spectral data of a hyperspectral image, and the integer Discrete Wavelet Transform (DWT) which is applied to the spatial data and produces decorrelated wavelet coefficients. Our simpler transform-based coder is inspired by Shapiro’s EZW algorithm, but encodes residual values and only implements dominant pass incorporating six symbols. The proposed method will be examined on AVIRIS images and evaluated using compression ratio for both lossless and lossy compression, and signal to noise ratio (SNR) for lossy compression. Experimental results show that the proposed image compression not only is more efficient but also has better compression ratio.

A hyperspectral image compression algorithm based on wavelet transformation and fractal composition (AWFC)

Starting with a fractal-based image-compression algorithm based on wavelet transformation for hyperspectral images, the authors were able to obtain more spectral bands with the help of of hyperspectral remote sensing. Because large amounts of data and limited bandwidth complicate the storage and transmission of data measured by TB-level bits, it is important to compress image data acquired by hyperspectral sensors such as MODIS, PHI, and OMIS; otherwise, conventional lossless compression algorithms cannot reach adequate compression ratios. Other loss-compression methods can reach high compression ratios but lack good image fidelity, especially for hyperspectral image data. Among the third generation of image compression algorithms, fractal image compression based on wavelet transformation is superior to traditional compression methods,because it has high compression ratios and good image fidelity, and requires less computing time. To keep the spectral dimension invariable, the authors compared the results of two compression algorithms based on the storage-file structures of BSQ and of BIP, and improved the HV and Quadtree partitioning and domain-range matching algorithms in order to accelerate their encode/decode efficiency. The authors' Hyperspectral Image Process and Analysis System (HIPAS) software used a VC++6.0 integrated development environment (IDE), with which good experimental results were obtained. Possible modifications of the algorithm and limitations of the method are also discussed.

An Improved SPIHT Algorithm for Image Compression in Low Bit Rate

Aiming at shortage of the SPIHT algorithm, an improved image compression algorithm is proposed, in order to overcome the shortcomings of decoding image quality and coding time, LS9/7 lifting wavelet transform is adopted. According to the characteristics of the human visual system (HVS), the scanning mode and the method to determine the threshold of algorithm are changed to improve the quality of reconstruction image. On the question of repeating scan of SPIHT algorithm, using maximum list thought, greatly reduce the computation and save operating time. The experimental results have proved that the improved algorithm of image decoding time and the quality of reconstruction images are better than the original algorithm , especially in the case of low bit rate.

Meaningful image encryption algorithm based on compressive sensing and integer wavelet transform

A new meaningful image encryption algorithm based on compressive sensing(CS)and integer wavelet transformation(IWT)is proposed in this study.First of all,the initial values of chaotic system are encrypted by RSA algorithm,and then they are open as public keys.To make the chaotic sequence more random,a mathematical model is constructed to improve the random performance.Then,the plain image is compressed and encrypted to obtain the secret image.Secondly,the secret image is inserted with numbers zero to extend its size same to the plain image.After applying IWT to the carrier image and discrete wavelet transformation(DWT)to the inserted image,the secret image is embedded into the carrier image.Finally,a meaningful carrier image embedded with secret plain image can be obtained by inverse IWT.Here,the measurement matrix is built by both chaotic system and Hadamard matrix,which not only retains the characteristics of Hadamard matrix,but also has the property of control and synchronization of chaotic system.Especially,information entropy of the plain image is employed to produce the initial conditions of chaotic system.As a result,the proposed algorithm can resist known-plaintext attack(KPA)and chosen-plaintext attack(CPA).By the help of asymmetric cipher algorithm RSA,no extra transmission is needed in the communication.Experimental simulations show that the normalized correlation(NC)values between the host image and the cipher image are high.That is to say,the proposed encryption algorithm is imperceptible and has good hiding effect.

Medical image lossless compression based on combining an integer wavelet transform with DPCM

To improve the classical lossless compression of low efficiency,a method of image lossless compression with high efficiency is presented.Its theory and the algorithm implementation are introduced.The basic approach of medical image lossless compression is then briefly described.After analyzing and implementing differential plus code modulation(DPCM)in lossless compression,a new method of combining an integer wavelet transform with DPCM to compress medical images is discussed.The analysis and simulation results show that this new method is simpler and useful.Moreover,it has high compression ratio in medical image lossless compression.

Second Generation Wavelet Applied to Lossless Compression Coding of Image

In this paper, the second generation wavelet transform is applied to image lossless coding, according to its characteristic of reversible integer wavelet transform. The second generation wavelet transform can provide higher compression ratio than Huffman coding while it reconstructs image without loss compared with the first generation wavelet transform. The experimental results show that the se cond generation wavelet transform can obtain excellent performance in medical image compression coding.

Embedded coding of medical images with regions of interest based on 3-D zerotree

In order to satisfy the need of diagnoses,based on the characteristic of medical images that a sequence of frames are formed in one body inspection,a new strategy for medical images compression is proposed.The 3-D wavelet is adopted and the planar zerotree is extended to the 3-D zerotree.By making use of the 3-D zerotree structure,a simple method for region of interest(ROI)mask generation is put forward.Medical images are compressed by three-dimensional embedded coding with the compression of regions of interest.Simulation results have shown that it can efficiently improve the compression ratio without affecting the diagnoses.

Improving Reconstructed Image Quality via Hybrid Compression Techniques

Data compression is one of the core fields of study for applications of image and video processing.The raw data to be transmitted consumes large bandwidth and requires huge storage space as a result,it is desirable to represent the information in the data with considerably fewer bits by the mean of data compression techniques,the data must be reconstituted very similarly to the initial form.In this paper,a hybrid compression based on Discrete Cosine Transform(DCT),DiscreteWavelet Transform(DWT)is used to enhance the quality of the reconstructed image.These techniques are followed by entropy encoding such as Huffman coding to give additional compression.Huffman coding is optimal prefix code because of its implementation is more simple,faster,and easier than other codes.It needs less execution time and it is the shortest average length and the measurements for analysis are based upon Compression Ratio,Mean Square Error(MSE),and Peak Signal to Noise Ratio(PSNR).We applied a hybrid algorithm on(DWT–DCT 2×2,4×4,8×8,16×16,32×32)blocks.Finally,we show that by using a hybrid(DWT–DCT)compression technique,the PSNR is reconstructed for the image by using the proposed hybrid algorithm(DWT–DCT 8×8 block)is quite high than DCT.

Development of Wavelet Image Compression Technique to Particle Image Velocimetry

In Order to reduce the noise in the images and the physical storage, the wavelet-based image compression technique was applied to PIV processing in this paper. To study the effect of the wavelet bases, the standard PIV images were compressed by some known wavelet families, Daubechies, Coifman and Baylkin families with various compression ratios. It was found that a higher order wavelet base provided good compression performance for compressing PIV images. The error analysis of velocity field obtained indicated that the high compression ratio, even up to 64.1, can be realized without losing significant flow information in PIV processing. The wavelet compression technique of PIV was applied to the experimental images of jet flow and showed excellent performance. A reduced number of erroneous vectors can be realized by varying compression ratio. It can say that the wavelet image compression technique is very effective in PIV system.

An improved partial SPIHT with classified weighted rate-distortion optimization for interferential multispectral image compression

Based on the property analysis of interferential multispectral images, a novel compression algorithm of partial set partitioning in hierarchical trees （SPIHT） with classified weighted rate-distortion optimization is presented. After wavelet decomposition, partial SPIHT is applied to each zero tree independently by adaptively selecting one of three coding modes according to the probability of the significant coefficients in each bitplane. Meanwhile the interferential multispectral image is partitioned into two kinds of regions in terms of luminous intensity, and the rate-distortion slopes of zero trees are then lifted with classified weights according to their distortion contribution to the constructed spectrum. Finally a global rate- distortion optimization truncation is performed. Compared with the conventional methods, the proposed algorithm not only improves the performance in spatial domain but also reduces the distortion in spectral domain.

Wavelet-Based Mixed-Resolution Coding Approach Incorporating with SPT for the Stereo Image

With the advances of display technology, three-dimensional(3-D) imaging systems are becoming increasingly popular. One way of stimulating 3-D perception is to use stereo pairs, a pair of images of the same scene acquired from different perspectives. Since there is an inherent redundancy between the images of a stereo pairs, data compression algorithms should be employed to represent stereo pairs efficiently. The proposed techniques generally use block-based disparity compensation. In order to get the higher compression ratio, this paper employs the wavelet-based mixed-resolution coding technique to incorporate with SPT-based disparity-compensation to compress the stereo image data. The mixed-resolution coding is a perceptually justified technique that is achieved by presenting one eye with a low-resolution image and the other with a high-resolution image. Psychophysical experiments show that the stereo image pairs with one high-resolution image and one low-resolution image provide almost the same stereo depth to that of a stereo image with two high-resolution images. By combining the mixed-resolution coding and SPT-based disparity-compensation techniques, one reference (left) high-resolution image can be compressed by a hierarchical wavelet transform followed by vector quantization and Huffman encoder. After two level wavelet decompositions, for the low-resolution right image and low-resolution left image, subspace projection technique using the fixed block size disparity compensation estimation is used. At the decoder, the low-resolution right subimage is estimated using the disparity from the low-resolution left subimage. A full-size reconstruction is obtained by upsampling a factor of 4 and reconstructing with the synthesis low pass filter. Finally, experimental results are presented, which show that our scheme achieves a PSNR gain (about 0.92dB) as compared to the current block-based disparity compensation coding techniques.

Image compression algorithm of floral canopy based on mask hybrid coding for ROI

To achieve high-quality image compression of a floral canopy,a region of interest(ROI)mask of the wavelet domain was generated through the automatic identification of the canopy ROI and lifting the bit-plane of the ROI to obtain priority of coding for the ROI-set partitioning in hierarchical trees(ROI-SPIHT)coding.The embedded zerotree wavelet(EZW)coding was conducted for the background(BG)region of the image and a relatively more low-frequency wavelet coefficient was obtained using a relatively small amount of coding.Through the weighing factor r of the ROI coding amount,the proportion of the ROI and BG coding amount was dynamically adjusted to generate embedded,truncatable bit streams.Despite the location of truncation,the image information and ROI mask information required by the decoder can be guaranteed to achieve high-quality compression and reconstruction of the image ROI.The results indicated that under the same bit rate,the larger the r value is,the larger the peak-signal-to-noise ratio(PSNR)for the ROI reconstructed image and the smaller the PSNR for the BG reconstructed image.In the range of 0.07-1.09 bpp,the PSNR of the ROI reconstructed image was 42.65%higher on average than that of the BG reconstructed image,43.95%higher on average than that of the composite image of the ROI and BG(ALL),and 16.84%higher on average than that of the standard SPIHT reconstructed image.Additionally,the mean square error of the quality evaluation index and similarity for the ROI reconstructed image were both better than those for the BG,ALL,and standard SPIHT reconstructed images.The texture distortion of the ALL image was smaller than that of the SPIHT reconstructed image,indicating that the image compression algorithm based on the mask hybrid coding for ROI(ROI-MHC)is capable of improving the reconstruction quality of an ROI image.When the weighing factor r is a fixed value,as the proportion of ROI(a)increases,the quality of ROI image reconstruction gradually decreases.Therefore,upon the application of the ROI-MHC image compression algorithm,high-quality reconstruction of the ROI image can be achieved through dynamically configuring r according to a.Under the same bit rate,the quality of the ROI-MHC image compression is higher than that of current compression algorithms of same classes and offers promising application opportunities.

Wavelet-based gray-level digital image watermarking

The watermarking technique has been proposed as a method by hiding secret information into the image to protect the copyright of multimedia data. But most previous work focuses on the algorithms of embedding one dimensional watermarks or two dimensional binary digital watermarks. In this paper, a wavelet based method for embedding a gray level digital watermark into an image is proposed. By still image decomposition technique, a gray level digital watermark is decompounded into a series of bitplanes. By discrete wavelet transform ( DWT ), the host image is decomposed into multiresolution representations with hierarchical structure. The different bitplanes of the gray level watermark is embedded into the corresponding resolution of the decomposed host image. The experimental results show that the proposed techniques can successfully survive image processing operations and the lossy compression techniques such as Joint Photographic Experts Group (JPEG).

A LOSSLESS COMPRESSION ALGORITHM OF REMOTE SENSING IMAGE FOR SPACE APPLICATIONS

A simple and adaptive lossless compression algorithm is proposed for remote sensing image compression,which includes integer wavelet transform and the Rice entropy coder.By analyzing the probability distribution of integer wavelet transform coefficients and the characteristics of Rice entropy coder,the divide and rule method is used for high-frequency sub-bands and low-frequency one.High-frequency sub-bands are coded by the Rice entropy coder,and low-frequency coefficients are predicted before coding.The role of predictor is to map the low-frequency coefficients into symbols suitable for the entropy coding.Experimental results show that the average Compression Ratio(CR) of our approach is about two,which is close to that of JPEG 2000.The algorithm is simple and easy to be implemented in hardware.Moreover,it has the merits of adaptability,and independent data packet.So the algorithm can adapt to space lossless compression applications.