Results 11 - 20
of
65
Bregman-EM-TV Methods with Application to Optical Nanoscopy
- Proceedings of the 2nd International Conference on Scale Space and Variational Methods in Computer Vision
"... Abstract. Measurements in nanoscopic imaging suffer from blurring effects concerning different point spread functions (PSF). Some apparatus even have PSFs that are locally dependent on phase shifts. Additionally, raw data are affected by Poisson noise resulting from laser sampling and "photon c ..."
Abstract
-
Cited by 10 (6 self)
- Add to MetaCart
(Show Context)
Abstract. Measurements in nanoscopic imaging suffer from blurring effects concerning different point spread functions (PSF). Some apparatus even have PSFs that are locally dependent on phase shifts. Additionally, raw data are affected by Poisson noise resulting from laser sampling and "photon counts " in fluorescence microscopy. In these applications standard reconstruction methods (EM, filtered backprojection) deliver unsatisfactory and noisy results. Starting from a statistical modeling in terms of a MAP likelihood estimation we combine the iterative EM algorithm with TV regularization techniques to make an efficient use of a-priori information. Typically, TV-based methods deliver reconstructed cartoon-images suffering from contrast reduction. We propose an extension to EM-TV, based on Bregman iterations and inverse scale space methods, in order to obtain improved imaging results by simultaneous contrast enhancement. We illustrate our techniques by synthetic and experimental biological data. 1
Constrained total variation deblurring models and fast algorithms based on alternating direction method of multipliers
- SIAM Journal on Imaging Sciences
"... Abstract. The total variation (TV) model is attractive for being able to preserve sharp attributes in images. However, the restored images from TV-based methods do not usually stay in a given dynamic range, and hence projection is required to bring them back into the dynamic range for visual present ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
(Show Context)
Abstract. The total variation (TV) model is attractive for being able to preserve sharp attributes in images. However, the restored images from TV-based methods do not usually stay in a given dynamic range, and hence projection is required to bring them back into the dynamic range for visual presentation or for storage in digital media. This will affect the accuracy of the restoration as the projected image will no longer be the minimizer of the given TV model. In this paper, we show that one can get much more accurate solutions by imposing box constraints on the TV models and solving the resulting constrained models. Our numerical results show that for some images where there are many pixels with values lying on the boundary of the dynamic range, the gain can be as great as 10.28dB in peak signal-to-noise ratio. One traditional hinderance of using the constrained model is that it is difficult to solve. However, in this paper, we propose to use the alternating direction method of multipliers (ADMM) to solve the constrained models. This leads to a fast and convergent algorithm that is applicable for both Gaussian and impulse noise. Numerical results show that our ADMM algorithm is better than some state-of-the-art algorithms for unconstrained models both in terms of accuracy and robustness with respect to the regularization parameter. Key words. Total variation, deblurring, alternating direction method of multipliers, box constraint AMS subject classifications. 68U10, 65J22, 65K10, 65T50, 90C25
Inverse total variation flow
, 2006
"... † Corresponding author. Abstract. In this paper we analyze iterative regularization with the Breg-man distance of the total variation semi norm. Moreover, we prove existence of a solution of the corresponding flow equation as introduced in [8] in a func-tional analytical setting using methods from c ..."
Abstract
-
Cited by 7 (6 self)
- Add to MetaCart
(Show Context)
† Corresponding author. Abstract. In this paper we analyze iterative regularization with the Breg-man distance of the total variation semi norm. Moreover, we prove existence of a solution of the corresponding flow equation as introduced in [8] in a func-tional analytical setting using methods from convex analysis. The results are generalized to variational denoising methods with Lp-norm fit-to-data terms and Bregman distance regularization term. For the associated flow equations well–posedness is derived using recent results on metric gradient flows from [2]. In contrast to previous work the results of this paper apply for the analysis of variational denoising methods with the Bregman distance under adequate noise assumptions. Besides from the theoretical results we introduce a level set technique based on Bregman distance regularization for denoising of surfaces and demonstrate the efficiency of this method. 1.
LEVEL SET BASED NONLOCAL SURFACE RESTORATION
"... Abstract. In this paper we extend nonlocal smoothing techniques for image regularization in [12] to surface regularization, with surfaces represented by level set functions. We test our algorithm on both phantom and observed surfaces, including city terrain and cortical surfaces. 1. ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
(Show Context)
Abstract. In this paper we extend nonlocal smoothing techniques for image regularization in [12] to surface regularization, with surfaces represented by level set functions. We test our algorithm on both phantom and observed surfaces, including city terrain and cortical surfaces. 1.
Homogenization of a pseudoparabolic system
- Appl. Anal
"... Pseudoparabolic equations in periodic media are homogenized to obtain upscaled limits by asymptotic expansions and two-scale convergence. The limit is characterized and convergence is established in various linear cases for both the classical binary medium model and the highly heterogeneous case. T ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
(Show Context)
Pseudoparabolic equations in periodic media are homogenized to obtain upscaled limits by asymptotic expansions and two-scale convergence. The limit is characterized and convergence is established in various linear cases for both the classical binary medium model and the highly heterogeneous case. The limit of vanishing time-delay parameter in either medium is included. The double-porosity limit of Richards' equation with dynamic capillary pressure is obtained.
An adaptive inverse scale space method for compressed sensing
, 2011
"... In this paper we introduce a novel adaptive approach for solving ℓ 1-minimization problems as frequently arising in compressed sensing, which is based on the recently introduced inverse scale space method. The scheme allows to efficiently compute minimizers by solving a sequence of low-dimensional n ..."
Abstract
-
Cited by 6 (2 self)
- Add to MetaCart
In this paper we introduce a novel adaptive approach for solving ℓ 1-minimization problems as frequently arising in compressed sensing, which is based on the recently introduced inverse scale space method. The scheme allows to efficiently compute minimizers by solving a sequence of low-dimensional nonnegative least-squares problems. We provide a detailed convergence analysis in a general setup as well as refined results under special conditions. In addition we discuss experimental observations in several numerical examples.
TOTAL VARIATION RESTORATION OF SPECKLED IMAGES USING A SPLIT-BREGMAN ALGORITHM
, 903
"... Multiplicative noise models occur in the study of several coherent imaging systems, such as synthetic aperture radar and sonar, and ultrasound and laser imaging. This type of noise is also commonly referred to as speckle. Multiplicative noise introduces two additional layers of difficulties with res ..."
Abstract
-
Cited by 6 (1 self)
- Add to MetaCart
(Show Context)
Multiplicative noise models occur in the study of several coherent imaging systems, such as synthetic aperture radar and sonar, and ultrasound and laser imaging. This type of noise is also commonly referred to as speckle. Multiplicative noise introduces two additional layers of difficulties with respect to the popular Gaussian additive noise model: (1) the noise is multiplied by (rather than added to) the original image, and (2) the noise is not Gaussian, with Rayleigh and Gamma being commonly used densities. These two features of the multiplicative noise model preclude the direct application of state-of-the-art restoration methods, such as those based on the combination of total variation or wavelet-based regularization with a quadratic observation term. In this paper, we tackle these difficulties by: (1) using the common trick of converting the multiplicative model into an additive one by taking logarithms, and (2) adopting the recently proposed split Bregman approach to estimate the underlying image under total variation regularization. This approach is based on formulating a constrained problem equivalent to the original unconstrained one, which is then solved using Bregman iterations (equivalently, an augmented Lagrangian method). A set of experiments show that the proposed method yields state-of-the-art results. Index Terms — Speckle, multiplicative noise, total variation, Bregman iterations, augmented Lagrangian, synthetic aperture radar.
Parameter Selection for Total Variation Based Image Restoration Using Discrepancy Principle
"... The key issues in solving image restoration problem successfully are: the estimation of the regularization parameter which balances the data-fidelity with the regularity of the solution; and the development of efficient numerical techniques for computing the solution. In this paper, we derive a fast ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
The key issues in solving image restoration problem successfully are: the estimation of the regularization parameter which balances the data-fidelity with the regularity of the solution; and the development of efficient numerical techniques for computing the solution. In this paper, we derive a fast algorithm that simultaneously estimates the regularization parameter and restores the image. The new approach is based on total-variation (TV) regularized strategy and Morozov discrepancy principle. The TV norm is represented by the dual formulation that changes the minimization problem into a minimax problem. A proximal point method is developed to compute the saddle point of the minimax problem. By adjusting the regularization parameter adaptively in each iteration, the solution is guaranteed to satisfy the discrepancy principle. We will give the convergence proof of our algorithm and show numerically that it is better than some state-of-the-art methods in both speed and accuracy.
Ground States and Singular Vectors of Convex Variational Regularization Methods
, 2012
"... Singular value decomposition is the key tool in the analysis and understanding of linear regularization methods in Hilbert spaces. Besides simplifying computations it allows to provide a good understanding of properties of the forward problem compared to the prior information introduced by the regul ..."
Abstract
-
Cited by 5 (2 self)
- Add to MetaCart
(Show Context)
Singular value decomposition is the key tool in the analysis and understanding of linear regularization methods in Hilbert spaces. Besides simplifying computations it allows to provide a good understanding of properties of the forward problem compared to the prior information introduced by the regularization methods. In the last decade nonlinear variational approaches such as ℓ 1 or total variation regularizations became quite prominent regularization techniques with certain properties being superior to standard methods. In the analysis of those, singular values and vectors did not play any role so far, for the obvious reason that these problems are nonlinear, together with the issue of defining singular values and singular vectors in the first place. In this paper however we want to start a study of singular values and vectors for nonlinear variational regularization of linear inverse problems, with particular focus on singular onehomogeneous regularization functionals. A major role is played by the smallest singular value, which we define as the ground state of an appropriate functional combining the (semi-)norm introduced by the forward operator and the regularization functional. The optimality condition for the ground state further yields a natural generalization to higher singular values
Nonlinear regularized reaction-diffusion filters for denoising of images with textures
- IEEE Trans. Image Process
, 2008
"... Denoising is always a challenging problem in natural imaging and geophysical data processing. In this paper we consider the denoising of texture images using a nonlinear reaction-diffusion equation and directional wavelet frames. In our model, a curvelet shrinkage is used for regularization of the d ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
(Show Context)
Denoising is always a challenging problem in natural imaging and geophysical data processing. In this paper we consider the denoising of texture images using a nonlinear reaction-diffusion equation and directional wavelet frames. In our model, a curvelet shrinkage is used for regularization of the diffusion process to preserve important features in the diffusion smoothing and a wave atom shrinkage is used as the reaction in order to preserve and enhance interesting oriented textures. We derive a digital reaction-diffusion filter that lives on graphs and show convergence of the corresponding iteration process. Experimental results and comparisons show very good performance of the proposed model for texture-preserving denoising. Key words. reaction-diffusion, second-generation curvelets, wave atoms, digital TV, regularization, denoising