✦ LIBER ✦

Region-based fractal image compression using heuristic search

✍ Scribed by Thomas, L.; Deravi, F.

Book ID: 120709490
Publisher: IEEE
Year: 1995
Tongue: English
Weight: 992 KB
Volume: 4
Category: Article
ISSN: 1057-7149
DOI: 10.1109/83.388086

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Region-based fractal image compression

✍ Hartenstein, H.; Ruhl, M.; Saupe, D. 📂 Article 📅 2000 🏛 IEEE 🌐 English ⚖ 357 KB

Fractal image compression with region-ba

Fractal image compression with region-based functionality

✍ Belloulata, K.; Konrad, J. 📂 Article 📅 2002 🏛 IEEE 🌐 English ⚖ 425 KB

Fractal image compression using visual-b

Fractal image compression using visual-based particle swarm optimization

✍ Chun-Chieh Tseng; Jer-Guang Hsieh; Jyh-Horng Jeng 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 322 KB

Static image compression based on fracta

Static image compression based on fractal theory

✍ Yixia Lin; Quanfan Zhu; Jun Liu 📂 Article 📅 1998 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 607 KB

Faster fractal image compression using q

Faster fractal image compression using quadtree recomposition

✍ David J Jackson; Wagdy Mahmoud; William A. Stapleton; Patrick T Gaughan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 930 KB

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