Solving the Inverse Problem for Function / Image Approximation Using IFS
نویسندگان
چکیده
We are concerned with function approximation and image representation using Iterated Function Systems (IFS) over L p (X;): An N-map IFS with grey level maps (IFSM), to be denoted as (w;), is a set w of N contraction maps w i : X ! X over a compact metric space (X; d) (the \base space") with an associated set of maps i : R ! R. Associated with each IFSM is a contractive operator T with xed point u 2 L p (X;). We provide a rigorous solution to the following inverse problem: Given a target v 2 L p (X;) and an > 0, nd an IFSM whose attractor satisses k u ? v k p < .
منابع مشابه
Inverse and approximation problem for two-dimensional fractal sets
The geometry of fractals is rich enough that they have extensively been used to model natural phenomena and images. Iterated function systems (IFS) theory provides a convenient way to describe and classify deterministic fractals in the form of a recursive definition. As a result, it is conceivable to develop image representation schemes based on the IFS parameters that correspond to a given fra...
متن کاملSolving the Inverse Problem for Function and Image Approximation Using Iterated Function Systems
This paper is concerned with function approximation and image representation using a new formulation of Iterated Function Systems (IFS) over the general function spaces L p (X;): An N-map IFS with grey level maps (IFSM), to be denoted as (w;), is a set w of N contraction maps w i : X ! X over a compact metric space (X; d) (the \base space") with an associated set of maps i : R ! R. Associated w...
متن کاملSolving random inverse heat conduction problems using PSO and genetic algorithms
The main purpose of this paper is to solve an inverse random differential equation problem using evolutionary algorithms. Particle Swarm Algorithm and Genetic Algorithm are two algorithms that are used in this paper. In this paper, we solve the inverse problem by solving the inverse random differential equation using Crank-Nicholson's method. Then, using the particle swarm optimization algorith...
متن کاملAn iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملA modified VIM for solving an inverse heat conduction problem
In this paper, we will use a modified variational iteration method (MVIM) for solving an inverse heat conduction problem (IHCP). The approximation of the temperature and the heat flux at are considered. This method is based on the use of Lagrange multipliers for the identification of optimal values of parameters in a functional in Euclidian space. Applying this technique, a rapid convergent s...
متن کامل