Corc Technical Report Tr-2004-03 Using Geometry and Iterated Refinement for Inverse Problems (1): Total Variation Based Image Restoration
نویسندگان
چکیده
We introduce a new iterative regularization procedure for inverse problems based on the use of Bregman distances, with particular focus on problems arising in image processing. We are motivated by the problem of restoring noisy and blurry images via variational methods, specifically by using the BV seminorm. Although our procedure applies in quite general situations it was obtained by geometric considerations (first discussed in [23]) associated with the Rudin-OsherFatemi procedure developed in [29] for image restoration. We obtain rigorous convergence results, and effective stopping criteria for the general procedure. The numerical results for denoising appear to be state-of-the-art and preliminary results for deblurring/denoising are very encouraging.
منابع مشابه
Using Geometry and Iterated Refinement for Inverse Problems (1): Total Variation Based Image Restoration
We introduce a new iterative regularization procedure for inverse problems based on the use of Bregman distances, with particular focus on problems arising in image processing. We are motivated by the problem of restoring noisy and blurry images via variational methods, specifically by using the BV seminorm. Although our procedure applies in quite general situations it was obtained by geometric...
متن کاملImage Restoration by Variable Splitting based on Total Variant Regularizer
The aim of image restoration is to obtain a higher quality desired image from a degraded image. In this strategy, an image inpainting method fills the degraded or lost area of the image by appropriate information. This is performed in such a way so that the obtained image is undistinguishable for a casual person who is unfamiliar with the original image. In this paper, different images are degr...
متن کاملCORC Technical Report TR-2003-02 Inverse conic programming and applications
The past decade has seen a growing interest in inverse optimization. It has been shown that duality yields very efficient algorithms for solving inverse linear programming problems. In this paper, we consider a special class of conic programs that admits a similar duality and show that the corresponding inverse optimization problems are efficiently solvable. We discuss the applications of inver...
متن کاملNonlinear Inverse Scale Space Methods for Image Restoration
In this paper we generalize the iterated refinement method, introduced by the authors in [8], to a time-continuous inverse scale-space formulation. The iterated refinement procedure yields a sequence of convex variational problems, evolving toward the noisy image. The inverse scale space method arises as a limit for a penalization parameter tending to zero, while the number of iteration steps t...
متن کاملCORC Technical Report TR-2002-03 Robust portfolio selection problems
In this paper we show how to formulate and solve robust portfolio selection problems. The objective of these robust formulations is to systematically combat the sensitivity of the optimal portfolio to statistical and modeling errors in the estimates of the relevant market parameters. We introduce “uncertainty structures” for the market parameters and show that the robust portfolio selection pro...
متن کامل