Fractal image compression and the self-affinity assumption : a stochastic signal modelling perspective

Bibliography: p. 208-225. === Fractal image compression is a comparatively new technique which has gained considerable attention in the popular technical press, and more recently in the research literature. The most significant advantages claimed are high reconstruction quality at low coding rates,...

Full description

Bibliographic Details
Main Author: Wohlberg, Brendt
Other Authors: De Jager, Gerhard
Format: Doctoral Thesis
Language:English
Published: University of Cape Town 2014
Subjects:
Online Access:http://hdl.handle.net/11427/9475
id ndltd-netd.ac.za-oai-union.ndltd.org-uct-oai-localhost-11427-9475
record_format oai_dc
spelling ndltd-netd.ac.za-oai-union.ndltd.org-uct-oai-localhost-11427-94752020-12-10T05:11:17Z Fractal image compression and the self-affinity assumption : a stochastic signal modelling perspective Wohlberg, Brendt De Jager, Gerhard Electrical Engineering Bibliography: p. 208-225. Fractal image compression is a comparatively new technique which has gained considerable attention in the popular technical press, and more recently in the research literature. The most significant advantages claimed are high reconstruction quality at low coding rates, rapid decoding, and "resolution independence" in the sense that an encoded image may be decoded at a higher resolution than the original. While many of the claims published in the popular technical press are clearly extravagant, it appears from the rapidly growing body of published research that fractal image compression is capable of performance comparable with that of other techniques enjoying the benefit of a considerably more robust theoretical foundation. . So called because of the similarities between the form of image representation and a mechanism widely used in generating deterministic fractal images, fractal compression represents an image by the parameters of a set of affine transforms on image blocks under which the image is approximately invariant. Although the conditions imposed on these transforms may be shown to be sufficient to guarantee that an approximation of the original image can be reconstructed, there is no obvious theoretical reason to expect this to represent an efficient representation for image coding purposes. The usual analogy with vector quantisation, in which each image is considered to be represented in terms of code vectors extracted from the image itself is instructive, but transforms the fundamental problem into one of understanding why this construction results in an efficient codebook. The signal property required for such a codebook to be effective, termed "self-affinity", is poorly understood. A stochastic signal model based examination of this property is the primary contribution of this dissertation. The most significant findings (subject to some important restrictions} are that "self-affinity" is not a natural consequence of common statistical assumptions but requires particular conditions which are inadequately characterised by second order statistics, and that "natural" images are only marginally "self-affine", to the extent that fractal image compression is effective, but not more so than comparable standard vector quantisation techniques. 2014-11-10T08:54:59Z 2014-11-10T08:54:59Z 1996 Doctoral Thesis Doctoral PhD http://hdl.handle.net/11427/9475 eng application/pdf University of Cape Town Faculty of Engineering and the Built Environment Department of Electrical Engineering
collection NDLTD
language English
format Doctoral Thesis
sources NDLTD
topic Electrical Engineering
spellingShingle Electrical Engineering
Wohlberg, Brendt
Fractal image compression and the self-affinity assumption : a stochastic signal modelling perspective
description Bibliography: p. 208-225. === Fractal image compression is a comparatively new technique which has gained considerable attention in the popular technical press, and more recently in the research literature. The most significant advantages claimed are high reconstruction quality at low coding rates, rapid decoding, and "resolution independence" in the sense that an encoded image may be decoded at a higher resolution than the original. While many of the claims published in the popular technical press are clearly extravagant, it appears from the rapidly growing body of published research that fractal image compression is capable of performance comparable with that of other techniques enjoying the benefit of a considerably more robust theoretical foundation. . So called because of the similarities between the form of image representation and a mechanism widely used in generating deterministic fractal images, fractal compression represents an image by the parameters of a set of affine transforms on image blocks under which the image is approximately invariant. Although the conditions imposed on these transforms may be shown to be sufficient to guarantee that an approximation of the original image can be reconstructed, there is no obvious theoretical reason to expect this to represent an efficient representation for image coding purposes. The usual analogy with vector quantisation, in which each image is considered to be represented in terms of code vectors extracted from the image itself is instructive, but transforms the fundamental problem into one of understanding why this construction results in an efficient codebook. The signal property required for such a codebook to be effective, termed "self-affinity", is poorly understood. A stochastic signal model based examination of this property is the primary contribution of this dissertation. The most significant findings (subject to some important restrictions} are that "self-affinity" is not a natural consequence of common statistical assumptions but requires particular conditions which are inadequately characterised by second order statistics, and that "natural" images are only marginally "self-affine", to the extent that fractal image compression is effective, but not more so than comparable standard vector quantisation techniques.
author2 De Jager, Gerhard
author_facet De Jager, Gerhard
Wohlberg, Brendt
author Wohlberg, Brendt
author_sort Wohlberg, Brendt
title Fractal image compression and the self-affinity assumption : a stochastic signal modelling perspective
title_short Fractal image compression and the self-affinity assumption : a stochastic signal modelling perspective
title_full Fractal image compression and the self-affinity assumption : a stochastic signal modelling perspective
title_fullStr Fractal image compression and the self-affinity assumption : a stochastic signal modelling perspective
title_full_unstemmed Fractal image compression and the self-affinity assumption : a stochastic signal modelling perspective
title_sort fractal image compression and the self-affinity assumption : a stochastic signal modelling perspective
publisher University of Cape Town
publishDate 2014
url http://hdl.handle.net/11427/9475
work_keys_str_mv AT wohlbergbrendt fractalimagecompressionandtheselfaffinityassumptionastochasticsignalmodellingperspective
_version_ 1719370293003157504