Font Size: a A A

Research Of Fractal-based Image Compression Arithmetic

Posted on:2007-08-26Degree:MasterType:Thesis
Country:ChinaCandidate:L H ChenFull Text:PDF
GTID:2178360185961694Subject:Communication and Information System
Abstract/Summary:PDF Full Text Request
As the technology of Network quickly develops, the multimedia technology based on image enriches our lives. However if there is no highly effective compression approach, image communication can not be achieved. The purpose of image compression coding is to represent images with few bits, maintain the quality of recovering images according to the requirements of certain application situations. Image compression is the key and bottleneck of multimedia technology.Up to now, some mature technologies have been developed in the area of image compression, such as DCT (Discrete Cosine Transform)and Huffman Code. Moreover, a series of international standards based on these coding algorithms, for example, BIG, JPEG, JPEG-2000, H. 261, H .263, MPEG -1, MPEG-2, MPEG-4 and MPEG-7.Recently, many new coding methods have been proposed, such as Subband Coding, Wavelet Transform Coding and Fractal Image Coding. Fractal Image Coding gets our great attention because it breaks the limit of previous coding and obtains the maximum compression ratio comparing with other algorithms.Fractal Image Coding is a novel technology. Though in theory it has great advantages, in practice the research on it is just on the beginning stage. Traditional Fractal Image Coding first divides the image into ranges and domains at different size, and then searches the best matching domain of a range in the whole image after compressing and affine transforming the domains. Since each domain commonly corresponds to eight affine transforms, the process of searching compression mapping block cost vast time. The advantages of traditional fractal coding are counteracted by the low speed of compression. Therefore, after researching on basic theories of fractal compression, we propose a non-compression algorithm based on root mean square error (RMSE). The new method divides the image into ranges and domains at the same size. This procedure not only reduces the compression time, but also achieves the purpose of compression. After division, the new approach reduces the number of domains by computing RMSE between every two domains. In addition,...
Keywords/Search Tags:Fractal Image Coding, Iterated Function System, Compression Mapping Theorem, Collage Theorem, Root Mean Squared Difference, Wavelet Transform
PDF Full Text Request
Related items