作者: E. Lutton
关键词:
摘要: We address here the resolution of so-called inverse problem for IFS. This has already been widely considered, and some studies have performed affine IFS, using deterministic or stochastic methods (simulated annealing Genetic Algorithm) [9, 12, 6]. When dealing with non usual techniques do not perform well, except if a priori hypotheses on structure IFS (number type functions) are made. A Programming method is investigated to solve “general” problem, which permits at same time numeric symbolic optimization. The use “mixed IFS”, as we call them, may enlarge scope applications, example image compression, because they allow code wider range shapes.