Abstract
In [2], Chambolle proposed an algorithm for minimizing the total variation of an image. In this short note, based on the theory on semismooth operators, we study semismooth Newton’s methods for total variation minimization. The convergence and numerical results are also presented to show the effectiveness of the proposed algorithms.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
R. Acar and C.R. Vogel, “Analysis of bounded variation penalty methods for ill-posed problems,” Inverse Problems, Vol. 10, pp. 1217–1229, 1994.
A. Chambolle, “An algorithm for total variation minimization and applications,” Journal of Mathematical Imaging and Vision, Vol. 20, pp. 89–97, 2004.
T.F. Chan, G.H. Golub, and P. Mulet, “A nonlinear primal-dual method for total variation-based image restoration,” SIAM J. Sci. Comput., Vol. 20, pp. 1964–1977, 1999.
F.H. Clarke, Optimization and Nonsmooth Analysis, Wiley: New York, 1983.
G.H. Golub and C. Van Loan, Matrix Computations, 3rd ed., The Johns Hopkins University Press, 1996.
H. Jiang and D. Ralph, “Global and local superlinear convergence analysis of Newton-type methods for semismooth equations with smooth least squares,” in Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, M. Fukushima and L. Qi (eds.), Kluwer Acad. Publ., Dordrecht, 1998, pp. 181–209.
G. Golub and C. Van Loan, Matrix Computations, 3rd ed., The Johns Hopkins University Press, 1996.
L. Qi, “Convergence analysis of some algorithms for solving nonsmooth equations,” Math. Oper. Res., Vol. 18, pp. 227–244, 1993.
L. Qi and J. Sun, “A Nonsmooth version of Newton’s method,” Mathematical Programming, Vol. 58, pp. 353–367, 1993.
L. Rudin, S. Osher and E. Fatemi, “Nonlinear total variation based noise removal algorithm,” Physica D, Vol. 60, pp. 259–268, 1992.
Author information
Authors and Affiliations
Corresponding author
Additional information
The research of this author is supported in part by Hong Kong Research Grants Council Grant Nos. 7035/04P and 7035/05P, and HKBU FRGs.
The research of this author is supported in part by the Research Grant Council of Hong Kong.
This work was started while the author was visiting Department of Applied Mathematics, The Hong Kong Polytechnic University. The research of this author is supported in part by The Hong Kong Polytechnic University Postdoctoral Fellowship Scheme and the National Science Foundation of China (No. 60572114).
Michael Ng is a Professor in the Department of Mathematics at the Hong Kong Baptist University. As an applied mathematician, Michael’s main research areas include Bioinformatics, Data Mining, Operations Research and Scientific Computing. Michael has published and edited 5 books, published more than 140 journal papers. He is the principal editor of the Journal of Computational and Applied Mathematics, and the associate editor of SIAM Journal on Scientific Computing.
Liqun Qi received his B.S. in Computational Mathematics at Tsinghua University in 1968, his M.S, and Ph.D. degree in Computer Sciences at University of Wisconsin-Madison in 1981 and 1984, respectively. Professor Qi has taught in Tsinghua University, China, University of Wisconsin-Madison, USA, University of New South Wales, Australia, and The Hong Kong Polytechnic University. He is now Chair Professor of Applied Mathematics at The Hong Kong Polytechnic University. Professor Qi has published more than 140 research papers in international journals. He established the superlinear and quadratic convergence theory of the generalized Newton method, and played a principal role in the development of reformulation methods in optimization. Professor Qi’s research work has been cited by the researchers around the world. According to the authoritative citation database ISIHighlyCited.com, he is one of the world’s most highly cited 300 mathematicians during the period from 1981 to 1999.
Yu-Fei Yang received the B.Sc., M.S. and Ph.D. degrees in mathematics from Hunan University, P. R. China, in 1987, 1994 and 1999, respectively. From 1999 to 2001, he stayed at the University of New South Wales, Australia as visiting fellow. From 2002 to 2005, he held research associate and postdoctoral fellowship positions at the Hong Kong Polytechnic University. He is currently professor in the College of Mathematics and Econometrics, at Hunan University, P. R. China. His research interests includes optimization theory and methods, and partial differential equations with applications to image analysis.
Yu-Mei Huang received her M.Sc. in Computer science from Lanzhou University in 2000. She is now pursuing her doctoral studies in computational mathematics in Hong Kong Baptist University. Her research interests are in image processing and numerical linear algebra.
Rights and permissions
About this article
Cite this article
Ng, M.K., Qi, L., Yang, Yf. et al. On Semismooth Newton’s Methods for Total Variation Minimization. J Math Imaging Vis 27, 265–276 (2007). https://doi.org/10.1007/s10851-007-0650-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10851-007-0650-0