A Lossy Coding Scheme for Images by Using The Daub
no vote
Abstract - this paper introduces the use of Daubechies wavelet transform - D4 and the theory of the intersection region of the whole cross point regions (LS HWT & ICRs), by image lossy coding intersection 2D. The basis of this argument is that graycoding's therapeutic span is the neighbor's gray level of 2n points. Before gray code adjacent dataset ofcross point is determined, it is called whole intersection region (ECR). After gray coding, these regionsalways contain only 1 bit or each bit plane depending on the number, and 0 bit plane is decomposed. The optimization of probability in each bit plane plays an important role in lossless image data transmission during encoding and decoding. We will show how Daubechies wavelet transform combines the theory of the whole cross point region to become a lossy coded image. The goal of this method is to create a lossy coding scheme with high compression ratio and low distortion coefficient compared with some other methods. Finally, some preliminary results show the application of Daubechies matrix in face images.