Optimal Contractive Map in Fractal Coding

Aim\ To improve the performance of fractal compression coding Methods A new idea was proposed in which the fractal coding process was modeled as a nonlinear program with inequality constraints As a result, the global optimal solution of contractive map was obtained directly because the constraint conditions were considered during the solution for optimal map The optimal model as well as the algorithm for solution was presented The convergence of the algorithm and the best choice of initial point were also discussed Results Coding result of the proposed method is better than that of the present fractal transform coding methods, especially in compression of signals with sudden changes Conclusion The proposed method is an effective way to achieve better coding quality