METHOD OF VECTOR QUANTIZATION CODING USING RECTANGULAR TRANSFORM FOR IMAGE COMPRESSION

First of all a simple and practical rectangular transform is given,and then thevector quantization technique which is rapidly developing recently is introduced.We combinethe rectangular transform with vector quantization technique for image data compression.Thecombination cuts down the dimensions of vector coding.The size of the codebook can reasonablybe reduced.This method can reduce the computation complexity and pick up the vector codingprocess.Experiments using image processing system show that this method is very effective inthe field of image data compression.

A hybrid quantum encoding algorithm of vector quantization for image compression

Many classical encoding algorithms of vector quantization （VQ） of image compression that can obtain global optimal solution have computational complexity O（N）. A pure quantum VQ encoding algorithm with probability of success near 100% has been proposed, that performs operations 45√N times approximately. In this paper, a hybrid quantum VQ encoding algorithm between the classical method and the quantum algorithm is presented. The number of its operations is less than √N for most images, and it is more efficient than the pure quantum algorithm.

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.

A method to compress vibration signals using wavelet packet transformation combined with sub-band vector quantization

A novel compression method for mechanical vibrating signals,binding with sub-band vector quantization(SVQ) by wavelet packet transformation(WPT) and discrete cosine transformation(DCT) is proposed.Firstly,the vibrating signal is decomposed into sub-bands by WPT.Then DCT and adaptive bit allocation are done per sub-band and SVQ is performed in each sub-band.It is noted that,after DCT,we only need to code the first components whose numbers are determined by the bits allocated to that sub-band.Through an actual signal,our algorithm is proven to improve the signal-to-noise ratio(SNR) of the reconstructed signal effectively,especially in the situation of lowrate transmission.

A Novel Coding Method Based on Fuzzy Vector Quantization for Noised Image

In this paper a novel coding method based on fuzzy vector quantization for noised image with Gaussian white-noise pollution is presented. By restraining the high frequency subbands of wavelet image the noise is significantly removed and coded with fuzzy vector quantization. The experimental result shows that the method can not only achieve high compression ratio but also remove noise dramatically.

Speech compression scheme based on wavelet transform and vector quantization

A coding method of speech compression, which is based on Wavlet Transform and Vector Quantization (VQ), is developed and studied. The Wavlet Thansform or Wavlet Packet Thansform is used to process the speech signal, then VQ is used to compress the coefficients of Wavlet Thansform, and the entropy coding is used to decrease the bit rate. The experimental results show that the speech signal, sampled by 8 kHz sampling rate and 8 bit quatisation,i.e., 64 kbit/s bit rate, can be compressed to 6 - 8 kbit/s, and still have high speech quality,and the low-delay, only 8 ms.

DNA Computing with Water Strider Based Vector Quantization for Data Storage Systems

The exponential growth of data necessitates an effective data storage scheme,which helps to effectively manage the large quantity of data.To accomplish this,Deoxyribonucleic Acid(DNA)digital data storage process can be employed,which encodes and decodes binary data to and from synthesized strands of DNA.Vector quantization(VQ)is a commonly employed scheme for image compression and the optimal codebook generation is an effective process to reach maximum compression efficiency.This article introduces a newDNAComputingwithWater StriderAlgorithm based Vector Quantization(DNAC-WSAVQ)technique for Data Storage Systems.The proposed DNAC-WSAVQ technique enables encoding data using DNA computing and then compresses it for effective data storage.Besides,the DNAC-WSAVQ model initially performsDNA encoding on the input images to generate a binary encoded form.In addition,aWater Strider algorithm with Linde-Buzo-Gray(WSA-LBG)model is applied for the compression process and thereby storage area can be considerably minimized.In order to generate optimal codebook for LBG,the WSA is applied to it.The performance validation of the DNAC-WSAVQ model is carried out and the results are inspected under several measures.The comparative study highlighted the improved outcomes of the DNAC-WSAVQ model over the existing methods.

A Comparison of Integer Cosine and Tchebichef Transforms for Image Compression Using Variable Quantization

In the field of image and data compression, there are always new approaches being tried and tested to improve the quality of the reconstructed image and to reduce the computational complexity of the algorithm employed. However, there is no one perfect technique that can offer both maximum compression possible and best reconstruction quality, for any type of image. Depending on the level of compression desired and characteristics of the input image, a suitable choice must be made from the options available. For example in the field of video compression, the integer adaptation of discrete cosine transform (DCT) with fixed quantization is widely used in view of its ease of computation and adequate performance. There exist transforms like, discrete Tchebichef transform (DTT), which are suitable too, but are potentially unexploited. This work aims to bridge this gap and examine cases where DTT could be an alternative compression transform to DCT based on various image quality parameters. A multiplier-free fast implementation of integer DTT (ITT) of size 8 × 8 is also studied, for its low computational complexity. Due to the uneven spread of data across images, some areas might have intricate detail, whereas others might be rather plain. This prompts the use of a compression method that can be adapted according to the amount of detail. So, instead of fixed quantization this paper employs quantization that varies depending on the characteristics of the image block. This implementation is free from additional computational or transmission overhead. The image compression performance of ITT and ICT, using both variable and fixed quantization, is compared with a variety of images and the cases suitable for ITT-based image compression employing variable quantization are identified.

Implementation of Texture Based Image Retrieval Using M-band Wavelet Transform

Wavelet transform has attracted attention because it is a very useful tool for signal analyzing. As a fundamental characteristic of an image, texture traits play an important role in the human vision system for recognition and interpretation of images. The paper presents an approach to implement texture-based image retrieval using M-band wavelet transform. Firstly the traditional 2-band wavelet is extended to M-band wavelet transform. Then the wavelet moments are computed by M-band wavelet coefficients in the wavelet domain. The set of wavelet moments forms the feature vector related to the texture distribution of each wavelet images. The distances between the feature vectors describe the similarities of different images. The experimental result shows that the M-band wavelet moment features of the images are effective for image indexing. The retrieval method has lower computational complexity, yet it is capable of giving better retrieval performance for a given medical image database.

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.

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.

Fast encoding algorithm for vector quantization based on subvector L_2-norm

A fast encoding algorithm based on the mean square error （MSE） distortion for vector quantization is introduced. The vector, which is effectively constructed with wavelet transform （WT） coefficients of images, can simplify the realization of the non-linear interpolated vector quantization （NLIVQ） technique and make the partial distance search （PDS） algorithm more efficient. Utilizing the relationship of vector L2-norm and its Euclidean distance, some conditions of eliminating unnecessary codewords are obtained. Further, using inequality constructed by the subvector L2-norm, more unnecessary codewords are eliminated. During the search process for code, mostly unlikely codewords can be rejected by the proposed algorithm combined with the non-linear interpolated vector quantization technique and the partial distance search technique. The experimental results show that the reduction of computation is outstanding in the encoding time and complexity against the full search method.

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 LBG-BASED IMAGE COMPRESSION METHOD USING DCT

In this letter, a new Linde-Buzo-Gray (LBG)-based image compression method using Discrete Cosine Transform (DCT) and Vector Quantization (VQ) is proposed. A gray-level image is firstly decomposed into blocks, then each block is subsequently encoded by a 2D DCT coding scheme. The dimension of vectors as the input of a generalized VQ scheme is reduced. The time of encoding by a generalized VQ is reduced with the introduction of DCT process. The experimental results demonstrate the efficiency of the proposed method.

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.

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.

REMOTE SENSING IMAGE CODING METHOD COMBINING WAVELET TRANSFORM WITH CLASSIFIED VECTOR QUANTIZATION

A new remote sensing image coding scheme based on the wavelet transform and classified vector quantization (CVQ) is proposed. The original image is first decomposed into a hierarchy of 3 layers including 10 subimages by DWT. The lowest frequency subimage is compressed by scalar quantization and ADPCM. The high frequency subimages are compressed by CVQ to utilize the similarity among different resolutions while improving the edge quality and reducing computational complexity. The experimental results show that the proposed scheme has a better performance than JPEG, and a PSNR of reconstructed image is 31～33 dB with a rate of 0.2 bpp.

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.

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.