A Class of Fractal Image Coders with Fast Decoder Convergence

G. E. Øien and S. Lepsøy

Chapter Chapter 8 in Fractal Image Compression, 1995, pp 153-175 from Springer

Abstract: 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.

Keywords: Affine Mapping; Domain Block; Range Block; Fractal Coder; Collage Theorem (search for similar items in EconPapers)
Date: 1995
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-2472-3_8

Ordering information: This item can be ordered from
http://www.springer.com/9781461224723

DOI: 10.1007/978-1-4612-2472-3_8

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().