Results 271 to 280 of about 2,263,291 (335)

Fractal transformations of harmonic functions

SPIE Proceedings, 2006
The theory of fractal homeomorphisms is applied to transform a Sierpinski triangle into what we call a Kigami triangle. The latter is such that the corresponding harmonic functions and the corresponding Laplacian Δ take a relatively simple form. This provides an alternative approach to recent results of Teplyaev. Using a second fractal homeomorphism
Michael F. Barnsley, Uta Freiberg
openaire   +1 more source

Fractal analyses of martensitic transformations

Materials Letters, 1992
Abstract The results of a study of the fractal features of martensitic transformations according to actual martensitic transformation models are reported. Research shows that the martensitic transformation is a non-uniform and limited fractal. Its fractal dimension, D, is log n 2 log(n+1) (n⩾2); the minimum fractal dimension is 1.262 and ...
Su Hui, Yan Zhenqi
openaire   +1 more source

Fractals and Quasi‐Affine Transformations

Computer Graphics Forum, 1995
AbstractIn the continuum , contracting affine transformations have a unique fixed point. It is well known that this property is not preserved by dicretization and that the dynamics of discretized functions are very complicated. Discrete geometry allows us to start a theory for these dynamics and to illustrate some of their features by pictures.
P. W. Nehlig, J.‐P. Reveilles
openaire   +1 more source

On Fuzzy Fractal Transforms

2012
Approximation of an image, a union of spatially—contracted and grayscale modified copies of subsets of itself is known as fractal image coding. Generally, images are considered as function u(x) in \( L^{2} \) or \( L^{\infty } , \) and fractal coding method is developed.
R. Uthayakumar, M. Rajkumar
openaire   +1 more source

Signature verification using fractal transformation

Proceedings 15th International Conference on Pattern Recognition. ICPR-2000, 2002
Presents a fractal transformation based technique for signature verification. In this method, the fractal code of the reference signature locus is applied to a test signature locus and a sequence of fractal decoded test loci is obtained. The successive distances between the decoded test loci transforming towards the fractal attractor are compared to ...
null Kai Huang, null Hong Yan
openaire   +1 more source

Face recognition by fractal transformations

1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258), 1999
In this paper, we propose a new method for computerized human face recognition using fractal transformations. We show that by utilizing the intrinsic properties of block-wise self-similar transformations in fractal image coding we can use it to perform face recognition.
T. Tan, H. Yan
openaire   +1 more source

Realization of fractal affine transformation

Journal of Shanghai University (English Edition), 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xu, Jing, Lin, Yixia
openaire   +2 more sources

Generalized fractal transforms: complexity issues

[Proceedings] DCC `93: Data Compression Conference, 2002
The Bath Fractal Transform (BFT) defines a strategy for obtaining least squares fractal approximations and can be implemented using functions of varying complexity. The approximation method used in ITT-coding is itself the zero-order instance of the BFT.
openaire   +1 more source

Explicit relation between Fourier transform and fractal dimension of fractal interpolation functions

The European Physical Journal Special Topics, 2023
A. Agathiyan, N. A. A. Fataf, A. Gowrisankar   +2 more
semanticscholar   +1 more source

Fractal Transformers

2007
The recursive Cantor costruction, when applied to planar multilayers under TEM incidence (and multistep transmission lines) leaves both the internal structure of the initiator and the electromagnetic constitutive parameters of the gaps inserted at each recursion step unspecified.
openaire   +1 more source