Fractal image approximation and orthogonal bases
β Scribed by Stefano Lonardi; Paolo Sommaruga
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 307 KB
- Volume
- 14
- Category
- Article
- ISSN
- 0923-5965
No coin nor oath required. For personal study only.
β¦ Synopsis
We are concerned with the fractal approximation of multidimensional functions in L. In particular, we treat a position-dependent approximation using orthogonal bases of L and no search. We describe a framework that establishes a connection between the classic orthogonal approximation and the fractal approximation. The main theorem allows easy and univocal computation of the parameters of the approximating function. From the computational perspective, the result avoids to solve ill-conditioned linear systems that are usually needed in former fractal approximation techniques. Additionally, using orthogonal bases the most compact representation of the approximation is obtained. We discuss the approximation of gray-scale digital images as a direct application of our approximation scheme.
π SIMILAR VOLUMES
This paper describes a new approach to the segmentation of textured gray-scale images based on image pre-"ltering and fractal features. Traditionally, "lter bank decomposition methods consider the energy in each band as the textural feature, a parameter that is highly dependent on image intensity. I
Fractal image coding is an effective method to eliminate the image redundancy through piecewise self-transformability. The fractal code consists of a set of contractive affine transforms. To improve the performance when a range block experiences large error, we usually partition the range block into
An image spatial accessing methodology based on a formal language (SCAN) is presented in this paper. SCAN is a special purpose context-free language devoted to describe and generate a wide range of 2-D array accessing algorithms from a short set of simple ones. These algorithms may represent sequent