### COLLAGE-BASED INVERSE PROBLEMS FOR IFSM WITH ENTROPY MAXIMIZATION AND SPARSITY CONSTRAINTS

#### Abstract

We consider the inverse problem associated with IFSM: Given a target function

*f*, find an IFSM, such that its invariant fixed point*f*is sufficiently close to*f*in the*L*distance. In this paper, we extend the collage-based method developed by Forte and Vrscay (1995) along two different directions. We first search for a set of mappings that not only minimizes the collage error but also maximizes the entropy of the dynamical system. We then include an extra term in the minimization process which takes into account the sparsity of the set of mappings. In this new formulation, the minimization of collage error is treated as multi-criteria problem: we consider three different and conflicting criteria^{p}*i.e.*, collage error, entropy and sparsity. To solve this multi-criteria program we proceed by scalarization and we reduce the model to a single-criterion program by combining all objective functions with different trade-off weights. The results of some numerical computations are presented. Numerical studies indicate that a maximum entropy principle exists for this approximation problem,*i.e.*, that the suboptimal solutions produced by collage coding can be improved at least slightly by adding a maximum entropy criterion.##### Keywords

collage theorem; entropy; fractal transforms; iterated function systems with mappings; sparsity

DOI: 10.5566/ias.v32.p183-188