Sciweavers

10 search results - page 1 / 2
» Optimal Fractal Coding is NP-Hard
Sort
View
ICIP
2001
IEEE
14 years 9 months ago
Progressive fractal coding
Progressive coding is an important feature of compression schemes. Wavelet coders are well suited for this purpose because the wavelet coefficients can be naturally ordered accord...
Iv An Kopilovic, Dietmar Saupe, Raouf Hamzaoui
ICIP
2000
IEEE
14 years 9 months ago
Fast Code Enhancement with Local Search for Fractal Image Compression
Optimal fractal coding consists of finding in a finite set of contractive affine mappings one whose unique fixed point is closest to the original image. Optimal fractal coding is ...
Raouf Hamzaoui, Dietmar Saupe, Michael Hiller
DCC
1997
IEEE
13 years 11 months ago
Optimal Fractal Coding is NP-Hard
Matthias Ruhl, Hannes Hartenstein
GECCO
2006
Springer
168views Optimization» more  GECCO 2006»
13 years 11 months ago
3D airspace sectoring by evolutionary computation: real-world applications
This paper presents a new method for 3D cutting of geometrical space with application to airspace sectoring. This problem comes from the air traffic management but the proposed me...
Daniel Delahaye, Stephane Puechmorel
JMM2
2007
119views more  JMM2 2007»
13 years 7 months ago
Color Image Compression with Modified Fractal Coding on Spiral Architecture
—The proposed approach (CICMFCSA), firstly, compose the one-plane image using the pixel’s trichromatic coefficients. One-plane image in traditional square structure is represen...
Nileshsingh V. Thakur, O. G. Kakde