54 pages matching scheme in this book
Results 1-3 of 54
What people are saying - Write a review
We haven't found any reviews in the usual places.
Fractal Image Compression with Quadtrees
14 other sections not shown
affine transformation approximation archetypes attractor average basis vectors Chapter classes classification cluster centers codebook blocks coefficients Collage Theorem complete metric space compression ratio compute Contractive Mapping convergence copy machine corresponding decoding method define denote discussed domain pool domain vectors domain-range domains and ranges edges Equation eventually contractive example fidelity fixed point Fixed-Point flag fractal code fractal dimension fractal image compression given grey-scale hsize image compression inference algorithm initial image input image iterated function systems Lenna lines matrix method minimize node number of bits number of domains operator optimal original blocks original image orthogonal orthonormal basis output parameters piecewise PIFS code pixel values postprocessing PSNR quadrant quadtree partition quantization range block range vectors recursive resolution samples scheme Section self-similar shows Sierpinski triangle signal square sub-image subset subspace subsquare super-resolution vsize wavelet xsize/2