Image Compression Based On Wavelet Transform Of Parallel Algorithm

This paper outlines the basic theory of image compression coding, include the basic principle of image compression coding, compression methods and encoding algorithms. also introduced the criterion of image compression and some commonly used international standards for image or video compression.Study the basic theory of wavelet transform, using the lifting scheme of wavelet to decomposition the image. choose orthogonal wavelet for image compression, life cycle extension of the boundary data processing methods, select three wavelet decomposition. on the two-dimensional case, take the rows and columns of image data for one-dimensional wavelet transform respectively. Based on the study at home and abroad in a variety of compression algorithms for parallel image processing requirements, according to the characteristics of wavelet transform, the low-frequency sub-band of decomposed images using arithmetic coding, lossless compression algorithm to ensure that key information of images is not lost, and the other sub-band of decomposed images using modified SPIHT coding algorithm to improve the compression ratio.Introduced the concept of parallel computing, parallel algorithm design, parallel model and the parallel algorithm performance evaluation criteria and other basic knowledge; based on the analysis of arithmetic coding algorithm and SPHIT coding algorithm, design suitable parallel algorithm for multi-processor under the cluster environment. Numerical experiments running on the multi-core processor (Intel Core2 Quad Q66002.40GHZ) of the cluster system, parallel program written with VC, and running under the MPI, to obtained experimental data and results. Experiments show that by compression coding the original image, using serial implementation than parallel implementation can achieve high speed up, can be obtained to improve the efficiency and greatly reduce the computing time.