We consider the nonlinear and ill-posed inverse problem where the Robin coefficient in the Laplace equation is to be estimated using the measured data from the accessible part of the boundary. Two regularisation methods are considered — viz. L2 and H1 regularisation. The regularised problem is transformed to a nonlinear least squares problem; and a suitable regularisation parameter is chosen via the normalised cumulative periodogram (NCP) curve of the residual vector under the assumption of white noise, where information on the noise level is not required. Numerical results show that the proposed method is efficient and competitive.

In this paper, we introduce and study a new method for solving inverse source problems, through a working model that arises in bioluminescence tomography (BLT). In the BLT problem, one constructs quantitatively the bioluminescence source distribution inside a small animal from optical signals detected on the animal's body surface. The BLT problem possesses strong ill-posedness and often the Tikhonov regularization is used to obtain stable approximate solutions. In conventional Tikhonov regularization, it is crucial to choose a proper regularization parameter for trade off between the accuracy and stability of approximate solutions. The new method is based on a combination of the boundary condition and the boundary measurement in a parameter-dependent single complex Robin boundary condition, followed by the Tikhonov regularization. By properly adjusting the parameter in the Robin boundary condition, we achieve two important properties for our new method: first, the regularized solutions are uniformly stable with respect to the regularization parameter so that the regularization parameter can be chosen based solely on the consideration of the solution accuracy; second, the convergence order of the regularized solutions reaches one with respect to the noise level. Then, the finite element method is used to compute numerical solutions and a new finite element error estimate is derived for discrete solutions. These results improve related results found in the existing literature. Several numerical examples are provided to illustrate the theoretical results.

A new algorithm for the removal of additive uncorrelated Gaussian noise from a digital image is presented. The algorithm is based on a data driven methodology for the adaptive thresholding of wavelet coefficients. This methodology is derived from higher order statistics of the residual image, and requires no a priori estimate of the level of noise contamination of an image.

In this paper, we propose a fast proximity point algorithm and apply it to total variation (TV) based image restoration. The novel method is derived from the idea of establishing a general proximity point operator framework based on which new first-order schemes for total variation (TV) based image restoration have been proposed. Many current algorithms for TV-based image restoration, such as Chambolle’s projection algorithm, the split Bregman algorithm, the Bermúdez-Moreno algorithm, the Jia-Zhao denoising algorithm, and the fixed point algorithm, can be viewed as special cases of the new first-order schemes. Moreover, the convergence of the new algorithm has been analyzed at length. Finally, we make comparisons with the split Bregman algorithm which is one of the best algorithms for solving TV-based image restoration at present. Numerical experiments illustrate the efficiency of the proposed algorithms.

Many problems in biology involve gels which are mixtures composed of a polymer network permeated by a fluid solvent (water). The two-fluid model is a widely used approach to described gel mechanics, in which both network and solvent coexist at each point of space and their relative abundance is described by their volume fractions. Each phase is modeled as a continuum with its own velocity and constitutive law. In some biological applications, free boundaries separate regions of gel and regions of pure solvent, resulting in a degenerate network momentum equation where the network volume fraction vanishes. To overcome this difficulty, we develop a regularization method to solve the two-phase gel equations when the volume fraction of one phase goes to zero in part of the computational domain. A small and constant network volume fraction is temporarily added throughout the domain in setting up the discrete linear equations and the same set of equation is solved everywhere. These equations are very poorly conditioned for small values of the regularization parameter, but the multigrid-preconditioned GMRES method we use to solve them is efficient and produces an accurate solution of these equations for the full range of relevant regularization parameter values.

Total variation regularization has good performance in noise removal and edge preservation but lacks in texture restoration. Here we present a texture-preserving strategy to restore images contaminated by blur and noise. According to a texture detection strategy, we apply spatially adaptive fractional order diffusion. A fast algorithm based on the half-quadratic technique is used to minimize the resulting objective function. Numerical results show the effectiveness of our strategy.

Iterative regularization multigrid methods have been successful applied to signal/image deblurring problems. When zero-Dirichlet boundary conditions are imposed the deblurring matrix has a Toeplitz structure and it is potentially full. A crucial task of a multilevel strategy is to preserve the Toeplitz structure at the coarse levels which can be exploited to obtain fast computations. The smoother has to be an iterative regularization method. The grid transfer operator should preserve the regularization property of the smoother. This paper improves the iterative multigrid method proposed in [11] introducing a wavelet soft-thresholding denoising post-smoother. Such post-smoother avoids the noise amplification that is the cause of the semi-convergence of iterative regularization methods and reduces ringing effects. The resulting iterative multigrid regularization method stabilizes the iterations so that and imprecise (over) estimate of the stopping iteration does not have a deleterious effect on the computed solution. Numerical examples of signal and image deblurring problems confirm the effectiveness of the proposed method.

We propose a numerical procedure to extend to full aperture the acoustic far-field pattern (FFP) when measured in only few observation angles. The reconstruction procedure is a multi-step technique that combines a total variation regularized iterative method with the standard Tikhonov regularized pseudo-inversion. The proposed approach distinguishes itself from existing solution methodologies by using an exact representation of the total variation which is crucial for the stability and robustness of Newton algorithms. We present numerical results in the case of two-dimensional acoustic scattering problems to illustrate the potential of the proposed procedure for reconstructing the full aperture of the FFP from very few noisy data such as backscattering synthetic measurements.