Research on a novel restoration algorithm of turbulence-degraded images with alternant iterations

A new restoration algorithm based on double loops and alternant iterations is proposed to restore the object image effectively from a few frames of turbulence-degraded images, Based on the double loops, the iterative relations for estimating the turbulent point spread function PSF and object image alternately are derived. The restoration experiments have been made on computers, showing that the proposed algorithm can obtain the optimal estimations of the object and the point spread function, with the feasibility and practicality of the proposed algorithm being convincing.

A FINITE DIFFERENCE METHOD FOR SIMULATING TRANSVERSE VIBRATIONS OF AN AXIALLY MOVING VISCOELASTIC STRING

A finite difference method is presented to simulate transverse vibrations of an axially moving string. By discretizing the governing equation and the equation of stress strain relation at different frictional knots, two linear sparse finite difference equation systems are obtained. The two explicit difference schemes can be calculated alternatively, which make the computation much more efficient. The numerical method makes the nonlinear model easier to deal with and of truncation errors, O（△t^2 ＋ △x^2）. It also shows quite good stability for small initial values. Numerical examples are presented to demonstrate the efficiency and the stability of the algorithm, and dynamic analysis of a viscoelastic string is given by using the numerical results.

ALTERNATELY LINEARIZED IMPLICIT ITERATION METHODS FOR SOLVING QUADRATIC MATRIX EQUATIONS

A numerical solution of the quadratic matrix equations associated with a nonsingular M-matrix by using the alternately linearized implicit iteration method is considered. An iteration method for computing a nonsingular M-matrix solution of the quadratic matrix equations is developed, and its corresponding theory is given. Some numerical examples are provided to show the efficiency of the new method.

Weighted Nuclear Norm Minimization-Based Regularization Method for Image Restoration

Regularization methods have been substantially applied in image restoration due to the ill-posedness of the image restoration problem.Different assumptions or priors on images are applied in the construction of image regularization methods.In recent years,matrix low-rank approximation has been successfully introduced in the image denoising problem and significant denoising effects have been achieved.Low-rank matrix minimization is an NP-hard problem and it is often replaced with the matrix’s weighted nuclear norm minimization(WNNM).The assumption that an image contains an extensive amount of self-similarity is the basis for the construction of the matrix low-rank approximation-based image denoising method.In this paper,we develop a model for image restoration using the sum of block matching matrices’weighted nuclear norm to be the regularization term in the cost function.An alternating iterative algorithm is designed to solve the proposed model and the convergence analyses of the algorithm are also presented.Numerical experiments show that the proposed method can recover the images much better than the existing regularization methods in terms of both recovered quantities and visual qualities.

An Alternating Iterative Method and Its Application in Statistical Inference

This paper studies non-convex programming problems. It is known that, in statistical inference, many constrained estimation problems may be expressed as convex programming problems. However, in many practical problems, the objective functions are not convex. In this paper, we give a definition of a semi-convex objective function and discuss the corresponding non-convex programming problems. A two-step iterative algorithm called the alternating iterative method is proposed for finding solutions for such problems. The method is illustrated by three examples in constrained estimation problems given in Sasabuchi et al. （Biometrika, 72, 465472 （1983））, Shi N. Z. （J. Multivariate Anal., 50, 282-293 （1994）） and El Barmi H. and Dykstra R. （Ann. Statist., 26, 1878 1893 （1998））.

Lipschitz and Total-Variational Regularization for Blind Deconvolution

In[3],Chan and Wong proposed to use total variational regularization for both images and point spread functions in blind deconvolution.Their experimental results show that the detail of the restored images cannot be recovered.In this paper,we consider images in Lipschitz spaces,and propose to use Lipschitz regularization for images and total variational regularization for point spread functions in blind deconvolution.Our experimental results show that such combination of Lipschitz and total variational regularization methods can recover both images and point spread functions quite well.

On the reconstruction of media inhomogeneity by inverse wave scattering model

Consider the reconstruction of the complex refraction index of an object, which is immersed in a known homogeneous background, from the knowledge of scattered waves of the point sources outside of the object. We firstly establish the uniqueness for this inverse problem, which provides the theoretical basis for the reconstruction scheme. Then based on the contrast source inversion(CSI) method, we propose an algorithm determining the refraction index and the artificial wave sources alternately by a dynamic iterative scheme. The algorithm defines the iterates by solving a series of minimization problems with uniformly convex penalty terms, which are allowed to be non-smooth to include L1 and total variation like functionals, ensuring the reconstruction quality when the unknown refraction index has the special features such as sparsity and discontinuity. By choosing the regularizing parameter automatically, the algorithm is terminated in terms of discrepancy principle. The convergence property of the iterative sequence is rigorously proven. Numerical implementations demonstrate the validity of the proposed algorithm.

Spatial channel pairing based coherent combining for relay networks

In this paper, spatial channel pairing(SCP) is introduced to coherent combining at the relay in relay networks. Closed-form solution to optimal coherent combining is derived. Given coherent combining, the approximate SCP solution is presented. Finally, an alternating iterative structure is developed. Simulation results and analysis show that, given the symbol error rate and data rate, the proposed alternating iterative structure achieves signal-to-noise ratio gains over existing schemes in maximum ratio combining(MRC) plus matched filter,MRC plus antenna selection, and distributed space-time block coding due to the use of SCP and iterative structure.