Fast Attractor Image Encoding by Adaptive Codebook Clustering

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

Chapter Chapter 9 in Fractal Image Compression, 1995, pp 177-197 from Springer

Abstract: Abstract In attractor image compression systems, the encoders are often computationally intensive. An attractor encoder involves comparisons between two sets of blocks, called range blocks and domain blocks. The most basic type of encoder compares these sets exhaustively in the sense that every possible pair of range and domain domain blocks is examined. Unless the complexity of this task can be reduced, attractor coding may be excluded from many applications. This problem is recognized, and previous publications have presented strategies to overcome it.

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_9

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

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

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 ().