Access the full text.
Sign up today, get DeepDyve free for 14 days.
We propose a new class of models for image restoration and decomposition by functional minimization. Following ideas of Y. Meyer in a total variation minimization framework of L. Rudin, S. Osher, and E. Fatemi, our model decomposes a given (degraded or textured) image u 0 into a sum u + v . Here u ∈ BV is a function of bounded variation (a cartoon component), while the noisy (or textured) component v is modeled by tempered distributions belonging to the negative Hilbert-Sobolev space H − s . The proposed models can be seen as generalizations of a model proposed by S. Osher, A. Solé, L. Vese and have been also motivated by D. Mumford and B. Gidas. We present existence, uniqueness and two characterizations of minimizers using duality and the notion of convex functions of measures with linear growth, following I. Ekeland and R. Temam, F. Demengel and R. Temam. We also give a numerical algorithm for solving the minimization problem, and we present numerical results of denoising, deblurring, and decompositions of both synthetic and real images.
Applied Mathematics and Optimization – Springer Journals
Published: Oct 1, 2008
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.