Journal of Scientific Computing

, Volume 37, Issue 2, pp 103–138

Non-smooth SOR for L1-Fitting: Convergence Study and Discussion of Related Issues

  • R. Glowinski
  • T. Kärkkäinen
  • T. Valkonen
  • A. Ivannikov
Article

Abstract

In this article, the denoising of smooth (H1-regular) images is considered. To reach this objective, we introduce a simple and highly efficient over-relaxation technique for solving the convex, non-smooth optimization problems resulting from the denoising formulation. We describe the algorithm, discuss its convergence and present the results of numerical experiments, which validate the methods under consideration with respect to both efficiency and denoising capability. Several issues concerning the convergence of an Uzawa algorithm for the solution of the same problem are also discussed.

Keywords

Denoising Non-smooth objective function Convex analysis Over-relaxation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aujol, J.-F., Gilboa, G., Chan, T., Osher, S.: Structure-texture image decomposition—modeling, algorithms, and parameter selection. Int. J. Comput. Vis. 67, 111–136 (2006) CrossRefGoogle Scholar
  2. 2.
    Cea, J., Glowinski, R.: Sur des méthodes de minimisation par relaxation. In: Revue Française d’Automatique, Informatique, Recherche Opérationnelle, Série Rouge, pp. 5–32. (1973) Google Scholar
  3. 3.
    Glowinski, R.: Numerical Methods for Nonlinear Variational Problems. Springer, New York (1984) MATHGoogle Scholar
  4. 4.
    Glowinski, R.: Finite element methods for incompressible viscous flow. In: Numerical Methods for Fluids, Part 3. Handbook of Numerical Analysis, vol. IX, pp. 3–1176. North-Holland, Amsterdam (2003) Google Scholar
  5. 5.
    Glowinski, R., Lions, J., Trémolières, R.: Numerical Analysis of Variational Inequalities. North-Holland, Amsterdam (1981) MATHCrossRefGoogle Scholar
  6. 6.
    Gonzalez, R.C., Woods, R.E.: Digital Image Processing. Addison-Wesley, Reading (1993) Google Scholar
  7. 7.
    Grisvard, P.: Elliptic Problems in Non-Smooth Domains. Pitman, London (1985) Google Scholar
  8. 8.
    Huber, P.J.: Robust Statistics. Wiley Series in Probability and Mathematical Statistics. Wiley, New York (1981) MATHGoogle Scholar
  9. 9.
    Jain, A.K.: Fundamentals of Digital Image Processing. Prentice-Hall, New York (1989) MATHGoogle Scholar
  10. 10.
    Kardar, M., Parisi, G., Zhang, Y.-C.: Dynamic scaling of growing interfaces. Phys. Rev. Lett. 56, 889–892 (1986) MATHCrossRefGoogle Scholar
  11. 11.
    Kärkkäinen, T., Kunisch, K., Majava, K.: Denoising of smooth images using L 1-fitting. Computing 74, 353–376 (2005) MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Kärkkäinen, T., Kunisch, K., Tarvainen, P.: Augmented Lagrangian active set methods for obstacle problems. J. Optim. Theory Appl. 119, 499–533 (2003) MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Kärkkäinen, T., Toivanen, J.: Building blocks for odd-even multigrid with applications to reduced systems. J. Comput. Appl. Math. 131, 15–33 (2001) MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Majava, K.: Optimization-based techniques for image restoration. PhD dissertation, University of Jyväskylä, Department of Mathematical Information Technology (2001) Google Scholar
  15. 15.
    Mallat, S.: A Wavelet Tour of Signal Processing. Academic Press, San Diego (1999) MATHGoogle Scholar
  16. 16.
    Maunuksela, J., Myllys, M., Merikoski, J., Timonen, J., Kärkkäinen, T., Welling, M., Wijngaarden, R.: Determination of the stochastic evolution equation from noisy experimental data. Eur. Phys. J. B 33, 193–202 (2003) CrossRefGoogle Scholar
  17. 17.
    Nečas, J.: Les Méthodes Directes en Théorie des Équations Elliptiques. Masson, Paris (1967) Google Scholar
  18. 18.
    Nikolova, M.: Minimizers of cost-functions involving nonsmooth data-fidelity terms. Application to the processing of outliers. SIAM J. Numer. Anal. 40, 965–994 (2002) MATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    Rao, C.R.: Methodology based on the L 1-norm, in statistical inference. Sankhya Indian J. Stat. 50, 289–313 (1988) MATHGoogle Scholar
  20. 20.
    Smith, S.W.: The Scientist and Engineer’s Guide to Digital Signal Processing. California Technical Publishing (1997) Google Scholar
  21. 21.
    Valkonen, T.: Convergence of a SOR-Weiszfeld type algorithm for incomplete data sets. Numer. Funct. Anal. Optim. 27, 931–952 (2006) MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  • R. Glowinski
    • 1
  • T. Kärkkäinen
    • 2
  • T. Valkonen
    • 2
  • A. Ivannikov
    • 2
  1. 1.Department of MathematicsUniversity of HoustonHoustonUSA
  2. 2.Department of Mathematical Information TechnologyUniversify of JyväskyläUniversity of JyväskyläFinland

Personalised recommendations