IFSM fractal image compression with entropy and sparsity constraints: A sequential quadratic programming approach

We consider the inverse problem associated with IFSM: Given a target function f , find an IFSM, such that its fixed point f¯ is sufficiently close to f in the Lp distance. Forte and Vrscay [1] showed how to reduce this problem to a quadratic optimization model. In this paper, we extend the collage-based method developed by Kunze, La Torre and Vrscay ([2][3][4]), by proposing the minimization of the 1-norm instead of the 0-norm. In fact, optimization problems involving the 0-norm are combinatorial in nature, and hence in general NP-hard. To overcome these difficulties, we introduce the 1-norm and propose a Sequential Quadratic Programming algorithm to solve the corresponding inverse problem. As in Kunze, La Torre and Vrscay [3] in our formulation, the minimization of collage error is treated as a multi-criteria problem that includes three different and conflicting criteria i.e., collage error, entropy and sparsity. This multi-criteria program is solved by means of a scalarization technique which reduces th...

[1]  Thomas M. Cover,et al.  Elements of Information Theory: Cover/Elements of Information Theory, Second Edition , 2005 .

[2]  Xiaoming Huo,et al.  Uncertainty principles and ideal atomic decomposition , 2001, IEEE Trans. Inf. Theory.

[3]  Mehran Ebrahimi,et al.  Measure-Valued Images, Associated Fractal Transforms, and the Affine Self-Similarity of Images , 2009, SIAM J. Imaging Sci..

[4]  E. Vrscay,et al.  A generalized fractal transform for measure-valued images , 2009 .

[5]  Michael Elad,et al.  Sparse and Redundant Representations - From Theory to Applications in Signal and Image Processing , 2010 .

[6]  B. Forte,et al.  ERRATA: "SOLVING THE INVERSE PROBLEM FOR FUNCTION AND IMAGE APPROXIMATION USING ITERATED FUNCTION SYSTEMS, I. Theoretical Basis, II. Algorithm and Computations" , 1995 .

[7]  Edward R. Vrscay,et al.  Solving inverse problems for DEs using the Collage Theorem and entropy maximization , 2012, Appl. Math. Lett..

[8]  Edward R. Vrscay,et al.  Fractal image denoising , 2003, IEEE Trans. Image Process..

[10]  M. Barnsley,et al.  Solution of an inverse problem for fractals and other sets. , 1986, Proceedings of the National Academy of Sciences of the United States of America.

[11]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[12]  Balas K. Natarajan,et al.  Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..

[13]  Rémi Gribonval,et al.  Sparse representations in unions of bases , 2003, IEEE Trans. Inf. Theory.

[14]  R. Tibshirani.  Regression Shrinkage and Selection via the Lasso , 1996 .

[15]  Stephen J. Wright,et al.  Numerical Optimization , 2018, Fundamental Statistical Inference.

[16]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[17]  Roger Fletcher,et al.  The Sequential Quadratic Programming Method , 2010 .

[18]  Yuval Fisher.  Fractal Image Compression , 1994 .

[19]  Edward R. Vrscay,et al.  Fractal-based measure approximation with entropy maximization and sparsity constraints , 2012 .