Search results for "Deblurring"
showing 7 items of 7 documents
Blind deconvolution using TV regularization and Bregman iteration
2005
In this paper we formulate a new time dependent model for blind deconvolution based on a constrained variational model that uses the sum of the total variation norms of the signal and the kernel as a regularizing functional. We incorporate mass conservation and the nonnegativity of the kernel and the signal as additional constraints. We apply the idea of Bregman iterative regularization, first used for image restoration by Osher and colleagues [S.J. Osher, M. Burger, D. Goldfarb, J.J. Xu, and W. Yin, An iterated regularization method for total variation based on image restoration, UCLA CAM Report, 04-13, (2004)]. to recover finer scales. We also present an analytical study of the model disc…
Optical calibration of a multispectral imaging system based on interference filters
2005
We present a new approach to optically calibrate a multispectral imaging system based on interference filters. Such a system typically suffers from some blurring of its channel images. Because the effectiveness of spectrum reconstruction depends heavily on the quality of the acquired channel images, and because this blurring negatively affects them, a method for deblurring and denoising them is required. The blur is modeled as a uniform intensity distribution within a circular disk. It allows us to characterize, quantitatively, the degradation for each channel image. In terms of global reduction of the blur, it consists of the choice of the best channel for the focus adjustment according to…
Quasi-Newton approach to nonnegative image restorations
2000
Abstract Image restoration, or deblurring, is the process of attempting to correct for degradation in a recorded image. Typically the blurring system is assumed to be linear and spatially invariant, and fast Fourier transform (FFT) based schemes result in efficient computational image restoration methods. However, real images have properties that cannot always be handled by linear methods. In particular, an image consists of positive light intensities, and thus a nonnegativity constraint should be enforced. This constraint and other ways of incorporating a priori information have been suggested in various applications, and can lead to substantial improvements in the reconstructions. Neverth…
A New Time Dependent Model Based on Level Set Motion for Nonlinear Deblurring and Noise Removal
1999
In this paper we summarize the main features of a new time dependent model to approximate the solution to the nonlinear total variation optimization problem for deblurring and noise removal introduced by Rudin, Osher and Fatemi. Our model is based on level set motion whose steady state is quickly reached by means of an explicit procedure based on an ENO Hamilton-Jacobi version of Roe's scheme. We show numerical evidence of the speed, resolution and stability of this simple explicit procedure in two representative 1D and 2D numerical examples.
Explicit Algorithms for a New Time Dependent Model Based on Level Set Motion for Nonlinear Deblurring and Noise Removal
2000
In this paper we formulate a time dependent model to approximate the solution to the nonlinear total variation optimization problem for deblurring and noise removal introduced by Rudin and Osher [ Total variation based image restoration with free local constraints, in Proceedings IEEE Internat. Conf. Imag. Proc., IEEE Press, Piscataway, NJ, (1994), pp. 31--35] and Rudin, Osher, and Fatemi [ Phys. D, 60 (1992), pp. 259--268], respectively. Our model is based on level set motion whose steady state is quickly reached by means of an explicit procedure based on Roe's scheme [ J. Comput. Phys., 43 (1981), pp. 357--372], used in fluid dynamics. We show numerical evidence of the speed of resolution…
Fast adaptive frame preprocessing for 3D reconstruction
2015
Abstract: This paper presents a new online preprocessing strategy to detect and discard ongoing bad frames in video sequences. These include frames where an accurate localization between corresponding points is difficult, such as for blurred frames, or which do not provide relevant information with respect to the previous frames in terms of texture, image contrast and non-flat areas. Unlike keyframe selectors and deblurring methods, the proposed approach is a fast preprocessing working on a simple gradient statistic, that does not require to compute complex time-consuming image processing, such as the computation of image feature keypoints, previous poses and 3D structure, or to know a prio…
Fast nonstationary preconditioned iterative methods for ill-posed problems, with application to image deblurring
2013
We introduce a new iterative scheme for solving linear ill-posed problems, similar to nonstationary iterated Tikhonov regularization, but with an approximation of the underlying operator to be used for the Tikhonov equations. For image deblurring problems, such an approximation can be a discrete deconvolution that operates entirely in the Fourier domain. We provide a theoretical analysis of the new scheme, using regularization parameters that are chosen by a certain adaptive strategy. The numerical performance of this method turns out to be superior to state-of-the-art iterative methods, including the conjugate gradient iteration for the normal equation, with and without additional precondi…