A New and Quick Image Compression Algorithm Based on Fractal Mapping
B Clinic · 1999
Presents a new and approximate fractal image coding by different grey levels because the compression time of fractal coding algorithm is very long and precise control is divided by cutting image. In addition, some beneficial research with respect to its feasibility in compression theory are also discussed. At the same time, the new following proof of existing a set of fractal compression mappings to reconstruct the original image is given: giving an arbitrary original image, we can always find a set of compression mappings, so that the image can be reconstructed from an arbitrary image. Based on the new compression idea, a concrete algorithm of realizing fractal image coding is designed by the paper. The experimental results prove that the new algorithm can improve compression ratio while reducing encoding time.