A wavelet-based analysis of fractal image compression

Numerical integration of bivariate fractal interpolation functions on rectangular domains

This paper primarily focuses on the derivation of fractal numerical integration for the data sets corresponding to two variable signals defined over a rectangular region. Evaluating numerical integration results through the fractal method helps achieve accurate results with minimum computation effort. The formulation of the fractal numerical integration is achieved by considering the recursive relation satisfied by the bivariate fractal interpolation functions for the given data set. The points in the data set have been used to evaluate the coefficients of the iterated function systems. The derivation of these coefficients considering the index of the subrectangles, and the integration formula has been proposed using these coefficients. The bivariate fractal interpolation functions constructed using these coefficients are then correlated with the bilinear interpolation functions. Also, this paper derives a formula for the freely chosen vertical scaling factor that has been used in reducing the approximation error. The obtained formula of the vertical scaling factor is then used in establishing the convergence of the proposed method of integration to the traditional double integration technique through a collection of lemmas and theorems. Finally, the paper concludes with an illustration of the proposed method of integration and the analysis of the numerical integral results obtained for the data sets corresponding to four benchmark functions.

Multifractal characterization of femtosecond laser-induced herringbone patterns

Analysis of surface structures formed due to femtosecond laser surface ablation is usually done through subjective assessment of the surface images. Here, we analyze the evolution of femtosecond laser-induced surface structures using multifractal analysis. We computed the singularity spectrum to characterize the behavior of laser-induced herringbone patterns. The surface morphology of the ablated surface shows a polarization dependent multifractal nature. The singularity spectrum depicts three distinct morphological phases that sequentially form as a function of the laser pulse number. We objectively characterize the laser-dependent morphological properties of herringbone structures. Multifractal analysis was able to reflect the hierarchy, uniformity, and roughness of the formed structures and their dependence on the pulse number and polarization.

High-resolution wavelet-fractal compressed optical coherence tomography images

Three-dimensional (3D) optical coherence tomography (OCT) images could assist specialists in the diagnosis of a disease in a tissue by providing morphological information from it. Since the size of such images is usually extremely large, an appropriate image compression method can help in the storage and transmission of these images. Fractal image compression provides very high compression ratios, and discrete wavelet transform (DWT) retains frequency and spatial information in the signal. In order to combine these two techniques, fractal coding has to be performed in the wavelet domain. In this work, we propose a three-dimensional extension version of the wavelet-fractal coding algorithm. The use of 3D fractal approximation to encode 3D wavelet coefficients allows us to exploit inter- and intra-redundancy of the image sequences. The compression results of several OCT images using the 3D wavelet-fractal algorithm are evaluated qualitatively and quantitatively and are compared with the results of the two-dimensional approach. The numerical results illustrate the superior performance of 3D wavelet-fractal algorithm in terms of compression ratio.

A Lossless hybrid wavelet-fractal compression for welding radiographic images

In this work a lossless wavelet-fractal image coder is proposed. The process starts by compressing and decompressing the original image using wavelet transformation and fractal coding algorithm. The decompressed image is removed from the original one to obtain a residual image which is coded by using Huffman algorithm. Simulation results show that with the proposed scheme, we achieve an infinite peak signal to noise ratio (PSNR) with higher compression ratio compared to typical lossless method. Moreover, the use of wavelet transform speeds up the fractal compression algorithm by reducing the size of the domain pool. The compression results of several welding radiographic images using the proposed scheme are evaluated quantitatively and compared with the results of Huffman coding algorithm.

Fractal-wavelet image denoising revisited

The essence of fractal image denoising is to predict the fractal code of a noiseless image from its noisy observation. From the predicted fractal code, one can generate an estimate of the original image. We show how well fractal-wavelet denoising predicts parent wavelet subtress of the noiseless image. The performance of various fractal-wavelet denoising schemes (e.g., fixed partitioning, quadtree partitioning) is compared to that of some standard wavelet thresholding methods. We also examine the use of cycle spinning in fractal-based image denoising for the purpose enhancing the denoised estimates. Our experimental results show that these fractal-based image denoising methods are quite competitive with standard wavelet thresholding methods for image denoising. Finally, we compare the performance of the pixel- and wavelet-based fractal denoising schemes.

A fast and efficient hybrid fractal-wavelet image coder

The excellent visual quality and compression rate of fractal image coding have limited applications due to exhaustive inherent encoding time. This paper presents a new fast and efficient image coder that applies the speed of the wavelet transform to the image quality of the fractal compression. Fast fractal encoding using Fisher's domain classification is applied to the lowpass subband of wavelet transformed image and a modified set partitioning in hierarchical trees (SPIHT) coding, on the remaining coefficients. Furthermore, image details and wavelet progressive transmission characteristics are maintained, no blocking effects from fractal techniques are introduced, and the encoding fidelity problem common in fractal-wavelet hybrid coders is solved. The proposed scheme promotes an average of 94% reduction in encoding-decoding time comparing to the pure accelerated Fractal coding results. The simulations also compare the results to the SPIHT wavelet coding. In both cases, the new scheme improves the subjective quality of pictures for high-medium-low bitrates.

Fractal image denoising

Over the past decade, there has been significant interest in fractal coding for the purpose of image compression. However, applications of fractal-based coding to other aspects of image processing have received little attention. We propose a fractal-based method to enhance and restore a noisy image. If the noisy image is simply fractally coded, a significant amount of the noise is suppressed. However, one can go a step further and estimate the fractal code of the original noise-free image from that of the noisy image, based upon a knowledge (or estimate) of the variance of the noise, assumed to be zero-mean, stationary and Gaussian. The resulting fractal code yields a significantly enhanced and restored representation of the original noisy image. The enhancement is consistent with the human visual system where extra smoothing is performed in flat and low activity regions and a lower degree of smoothing is performed near high frequency components, e.g., edges, of the image. We find that, for significant noise variance (sigma > or = 20), the fractal-based scheme yields results that are generally better than those obtained by the Lee filter which uses a localized first order filtering process similar to fractal schemes. We also show that the Lee filter and the fractal method are closely related.

Recurrent fractal neural networks: a strategy for the exchange of local and global information processing in the brain

The regulation of biological networks relies significantly on convergent feedback signaling loops that render a global output locally accessible. Ideally, the recurrent connectivity within these systems is self-organized by a time-dependent phase-locking mechanism. This study analyzes recurrent fractal neural networks (RFNNs), which utilize a self-similar or fractal branching structure of dendrites and downstream networks for phase-locking of reciprocal feedback loops: output from outer branch nodes of the network tree enters inner branch nodes of the dendritic tree in single neurons. This structural organization enables RFNNs to amplify re-entrant input by over-the-threshold signal summation from feedback loops with equivalent signal traveling times. The columnar organization of pyramidal neurons in the neocortical layers V and III is discussed as the structural substrate for this network architecture. RFNNs self-organize spike trains and render the entire neural network output accessible to the dendritic tree of each neuron within this network. As the result of a contraction mapping operation, the local dendritic input pattern contains a downscaled version of the network output coding structure. RFNNs perform robust, fractal data compression, thus coping with a limited number of feedback loops for signal transport in convergent neural networks. This property is discussed as a significant step toward the solution of a fundamental problem in neuroscience: how is neuronal computation in separate neurons and remote brain areas unified as an instance of experience in consciousness? RFNNs are promising candidates for engaging neural networks into a coherent activity and provide a strategy for the exchange of global and local information processing in the human brain, thereby ensuring the completeness of a transformation from neuronal computation into conscious experience.

Quantitative comparison and analysis of brain image registration using frequency-adaptive wavelet shrinkage

In the field of template-based medical image analysis, image registration and normalization are frequently used to evaluate and interpret data in a standard template or reference atlas space. Despite the large number of image-registration (warping) techniques developed recently in the literature, only a few studies have been undertaken to numerically characterize and compare various alignment methods. In this paper, we introduce a new approach for analyzing image registration based on a selective-wavelet reconstruction technique using a frequency-adaptive wavelet shrinkage. We study four polynomial-based and two higher complexity nonaffine warping methods applied to groups of stereotaxic human brain structural (magnetic resonance imaging) and functional (positron emission tomography) data. Depending upon the aim of the image registration, we present several warp classification schemes. Our method uses a concise representation of the native and resliced (pre- and post-warp) data in compressed wavelet space to assess quality of registration. This technique is computationally inexpensive and utilizes the image compression, image enhancement, and denoising characteristics of the wavelet-based function representation, as well as the optimality properties of frequency-dependent wavelet shrinkage.

Fractal image compression with region-based functionality

Region-based functionality offered by the MPEG-4 video compression standard is also appealing for still images, for example to permit object-based queries of a still-image database. A popular method for still-image compression is fractal coding. However, traditional fractal image coding uses rectangular range and domain blocks. Although new schemes have been proposed that merge small blocks into irregular shapes, the merging process does not, in general, produce semantically-meaningful regions. We propose a new approach to fractal image coding that permits region-based functionalities; images are coded region by region according to a previously-computed segmentation map. We use rectangular range and domain blocks, but divide boundary blocks into segments belonging to different regions. Since this prevents the use of standard dissimilarity measure, we propose a new measure adapted to segment shape. We propose two approaches: one in the spatial and one in the transform domain. While providing additional functionality, the proposed methods perform similarly to other tested methods in terms of PSNR but often result in images that are subjectively better. Due to the limited domain-block codebook size, the new methods are faster than other fractal coding methods tested. The results are very encouraging and show the potential of this approach for various internet and still-image database applications.

Fast adaptive wavelet packet image compression

Wavelets are ill-suited to represent oscillatory patterns: rapid variations of intensity can only be described by the small scale wavelet coefficients, which are often quantized to zero, even at high bit rates. Our goal is to provide a fast numerical implementation of the best wavelet packet algorithm in order to demonstrate that an advantage can be gained by constructing a basis adapted to a target image. Emphasis is placed on developing algorithms that are computationally efficient. We developed a new fast two-dimensional (2-D) convolution decimation algorithm with factorized nonseparable 2-D filters. The algorithm is four times faster than a standard convolution-decimation. An extensive evaluation of the algorithm was performed on a large class of textured images. Because of its ability to reproduce textures so well, the wavelet packet coder significantly out performs one of the best wavelet coder on images such as Barbara and fingerprints, both visually and in term of PSNR.

Combining fractal image compression and vector quantization

In fractal image compression, the code is an efficient binary representation of a contractive mapping whose unique fixed point approximates the original image. The mapping is typically composed of affine transformations, each approximating a block of the image by another block (called domain block) selected from the same image. The search for a suitable domain block is time-consuming. Moreover, the rate distortion performance of most fractal image coders is not satisfactory. We show how a few fixed vectors designed from a set of training images by a clustering algorithm accelerates the search for the domain blocks and improves both the rate-distortion performance and the decoding speed of a pure fractal coder, when they are used as a supplementary vector quantization codebook. We implemented two quadtree-based schemes: a fast top-down heuristic technique and one optimized with a Lagrange multiplier method. For the 8 bits per pixel (bpp) luminance part of the 512 x 512 Lena image, our best scheme achieved a peak-signal-to-noise ratio of 32.50 dB at 0.25 bpp.

Region-based fractal image compression

A fractal coder partitions an image into blocks that are coded via self-references to other parts of the image itself. We present a fractal coder that derives highly image-adaptive partitions and corresponding fractal codes in a time-efficient manner using a region-merging approach. The proposed merging strategy leads to improved rate-distortion performance compared to previously reported pure fractal coders, and it is faster than other state-of-the-art fractal coding methods.

A review of the fractal image coding literature

Fractal image compression is a technique based on the representation of an image by a contractive transform, on the space of images, for which the fixed point is close to the original image. This broad principle encompasses a very wide variety of coding schemes, many of which have been explored in the rapidly growing body of published research. While certain theoretical aspects of this representation are well established, relatively little attention has been given to the construction of a coherent underlying image model that would justify its use. Most purely fractal-based schemes are not competitive with the current state of the art, but hybrid schemes incorporating fractal compression and alternative techniques have achieved considerably greater success. This review represents a survey of the most significant advances, both practical and theoretical, since the publication of Jacquin's (1990) original fractal coding scheme.

Image compression with a hybrid wavelet-fractal coder

A hybrid wavelet-fractal coder (WFC) for image compression is proposed. The WFC uses the fractal contractive mapping to predict the wavelet coefficients of the higher resolution from those of the lower resolution and then encode the prediction residue with a bitplane wavelet coder. The fractal prediction is adaptively applied only to regions where the rate saving offered by fractal prediction justifies its overhead. A rate-distortion criterion is derived to evaluate the fractal rate saving and used to select the optimal fractal parameter set for WFC. The superior performance of the WFC is demonstrated with extensive experimental results.

An introduction to wavelet theory and application for the radiological physicist

The wavelet transform, part of a rapidly advancing new area of mathematics, has become an important technique for image compression, noise suppression, and feature extraction. As a result, the radiological physicist can expect to be confronted with elements of wavelet theory as diagnostic radiology advances into teleradiology, PACS, and computer aided feature extraction and diagnosis. With this in mind we present a primer on wavelet theory geared specifically for the radiological physicist. The mathematical treatment is free of the details of mathematical rigor, which are found in most other treatments of the subject and which are of little interest to physicists, yet is sufficient to convey a reasonably deep working knowledge of wavelet theory.