๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Architecture for fractal image compression

โœ Scribed by D. Vidya; Ranjani Parthasarathy; T.C. Bina; N.G. Swaroopa

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
538 KB
Volume
46
Category
Article
ISSN
1383-7621

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Distortion Minimization with Fast Local
Distortion Minimization with Fast Local Search for Fractal Image Compression
โœ Raouf Hamzaoui; Dietmar Saupe; Michael Hiller ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 300 KB

Optimal fractal image coding is an NP-hard combinatorial optimization problem, which consists of finding in a finite set of contractive affine mappings one whose unique fixed point is closest to the original image. Current fractal image schemes are based on a greedy suboptimal algorithm known as col

Algorithms for Fractal Image Compression
Algorithms for Fractal Image Compression on Massively Parallel SIMD Arrays
โœ Christian Hufnagl; Andreas Uhl ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 601 KB

Algorithms for Fractal Image Compression on Massively Parallel SIMD Arrays I n this work we introduce and analyse algorithms for fractal image compression on massively parallel SIMD arrays. The dierent algorithms discussed dier signiยฎcantly in terms of their communication and computation structure.

Genetic adaptive coding optimization app
Genetic adaptive coding optimization applied to fractal image compression
โœ Mauricio Gaona; Walter S. Kuklinski ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 559 KB

This paper presents a fractal image compression method that utilized a genetic optimization algorithm for optimal domain block selection. The technique successfully addresses the problem of finding an optimal domain block pool for a given range partition, one of the most important issues in fractal