Abstract
In this chapter we introduce a class of fractal image coders which have the remarkable property of giving exact decoder convergence in the lowest possible number of iterations (which is image independent). The class is related to that introduced by Jacquin [45,46,47,48], employing simple affine mappings working in a blockwise manner. The resulting decoder can be implemented in a pyramid-based fashion, yielding a computationally very efficient structure. Also, a coder offering non-iterative decoding and direct attractor optimization in the encoder is included as a special case. Other benefits of the proposed coder class include more optimal quantization and an improved Collage Theorem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Øien, G.E., Lepsøy, S. (1995). A Class of Fractal Image Coders with Fast Decoder Convergence. In: Fisher, Y. (eds) Fractal Image Compression. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2472-3_8
Download citation
DOI: https://doi.org/10.1007/978-1-4612-2472-3_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-7552-7
Online ISBN: 978-1-4612-2472-3
eBook Packages: Springer Book Archive