Algorithm for Fast Fractal Image Compression (1995) [11 citations — 2 self]
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {John Kominek},
title = {Algorithm for Fast Fractal Image Compression},
booktitle = {in: Proceedings from IS&T/SPIE 1995 Symposium on Electronic Imaging: Science & Technology, vol. 2419 Digital Video Compression: Algorithms and Technologies},
year = {1995},
pages = {296--305}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
Fractal image compression is a promising new technology that may successfully provide a codec for PC-to-PC video communications. Unfortunately, the large amount of computation needed for the compression stage is a major obstacle that needs to be overcome. This paper introduces the Fast Fractal Image Compression algorithm, a new approach to breaking the "speed problem" that has plagued previous efforts. For still images, experiments show that at comparable quality levels the FFIC algorithm is 5 to 50 times faster than the current state of the art. Such an improvement brings real-time video applications within the reach of fractal mathematics. Keywords: image compression, fast fractal algorithm, r-trees 1. INTRODUCTION Despite a myriad of alternatives, the most popular of image compression techniques are block-based methods wherein an image is partitioned into a grid of non-overlapping blocks prior to processing. Though each block is coded separately, the pixels within a block are treat...
Citations
No citations identified.
