Adaptive self-quantization of wavelet subtrees: a wavelet-based theory of fractal image compression | Zendy

Geoffrey M. Davis | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

<title>Adaptive self-quantization of wavelet subtrees: a wavelet-based theory of fractal image compression</title>

Author(s) -

Geoffrey M. Davis

Publication year - 1995

Publication title -

proceedings of spie, the international society for optical engineering/proceedings of spie

Language(s) - English

Resource type - Conference proceedings

SCImago Journal Rank - 0.192

H-Index - 176

eISSN - 1996-756X

pISSN - 0277-786X

DOI - 10.1117/12.217585

Subject(s) - fractal compression , fractal transform , wavelet , fractal , haar wavelet , algorithm , mathematics , data compression , quantization (signal processing) , wavelet transform , image compression , computer science , discrete wavelet transform , theoretical computer science , artificial intelligence , image processing , mathematical analysis , image (mathematics)

Fractal image compression was one of the earliest compression schemes to take advantage of image redundancyin scale. The theory of iterated function systems motivates a broad class of fractal schemes but does not givemuch guidance for implementation. Fractal compression schemes do not fit into the standard transform coderparadigm and have proven difficult to analyze. We introduce a wavelet-based framework for analyzing fractalblock coders which simplifies these schemes considerably. Using...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research