Research For Image Compression Algorithm Based On Wavelet Transform

The image as delivering medium and means of information are very important .Butthe data quantity of the numerical image is very big, needing a lot of ratios to especiallycount, as a result need to carry on the compression to the image .So-called imagecompression is at guarantee the certain image quantity and satisfy the premise of certainrequest under, a process of reducing the quantity of original data of image .Aiming atthe existent and related redundancy information in the image s, adopting a certainmethod to do away with the surplus composition, can carry out the compression of theimage. Though the saving technique of data develops continuously, the letter waydelivers the bandwidth to widen continuously, people for the compression image datawith economical data saving the space and exaltations believe the need of an utilizationto increase still.The traditional image compresses of adopting the DCT transformation to codewould appear "a block effect", the efficiency compress at the same time is also not high,a wavelet image coding is in recent years along with a development and analyzes of thewavelet theories to put forward a kind of way with very good development foregroundof image code the method .the wavelet analysis have many advantages oftime-frequency analysis, many differences analysis etc., easily combining togetherwith the person's eye sense of vision characteristic, can get a good compression result,it is specially and suitably suit for compressing process of this signal, so the method of awavelet transformation is high among the people value, and appearing various imagecoding methods according to a wavelet transformation .This text mainly studies to code according to the image of a transformation ofintegral .Studied to rising the method, zero trees to code the calculate way in a specificway .Rising the method belongs to the new method of the wavelet of the nextgeneration structure, since inherits the first generation characteristic of the wavelet,and then has not to be depend on Fourier transformation, at the same time it's easy tostructure integral characteristic of the wavelet .This text elaborates and discussestowards rising principle and key technique in which of method to make detailedly , andchooses 5/3 and 9/7-M two kinds of wavelet of rising methods of realization fromintegral to the wavelet of the integral, for the behind further research coefficient codesto work well the preparation .That a coefficient code is a key technique that carries outthe image compression to the method , not only relating to the end compression result ofthe image, but also relating to the instauration quantity of the image and the timedepletion of the decoding .This text is detailed to elaborate the method according to anmeasure of coefficient of zero the tree thoughts, and aimed at the weakness ofcomplication of calculating way and operating that it exists and put forward a goodimprovement of zero tree code the calculate way-Scan the method incompletely. Ending originally text, it puts forward a kind image coding methods according tocombining together of a transformation of integral wavelet and improve zero measure oftrees, and with the C/ C++ the language carries out the coding/decoding machine .withthe method of carrying on compress to code the test the experiment to the standard testimages, it confirms that that method can carry out the image transformation fromcompletely compression of lossless to the compression of losing ,comparing with themethod according to a wavelet transformation and zero amount of trees measure , itoperates more simply and the speed is quicker, the composition image has quantityhigher, obtains the decent result.