Blind Deconvolution Method Based on Precondition Conjugate Gradients

In seismic data processing, blind deconvolution is a key technology. Introduced in this paper is a flow of one kind of blind deconvolution. The optimal precondition conjugate gradients (PCG) in Kyrlov subspace is also used to improve the stability of the algorithm. The computation amount is greatly decreased.

A novel blind deconvolution algorithm using single frequency bin

Former frequency-domain blind devolution algorithms need to consider a large number of frequency bins and recover the sources in different orders and with different amplitudes in each frequency bin,so they suffer from permutation and amplitude indeterminacy troubles. Based on sliding discrete Fourier transform,the presented deconvolution algorithm can directly recover time-domain sources from frequency-domain convolutive model using single frequency bin. It only needs to execute blind sepa-ration of instantaneous mixture once there are no permutation and amplitude indeterminacy troubles. Compared with former algorithms,the algorithm greatly reduces the computation cost as only one frequency bin is considered. Its good and robust per-formance is demonstrated by simulations when the signal-to-noise-ratio is high.

PERFORMANCE OF BLIND DECONVOLUTION IN OPTOACOUSTIC TOMOGRAPHY

In this paper,we consider the use of blind deconvolution for optoacoustic(photoacoustic)imaging and investigate the performance of the method as means for increasing the resolution of the reconstructed image beyond the physical restrictions of the system.The method is demonstrated with optoacoustic measurement obtained from six-day-old mice,imaged in the near-infrared using a broadband hydrophone in a circular scanning configuration.Wefind that estimates of the unknown point spread function,achieved by blind deconvolution,improve the resolution and contrast in the images and show promise for enhancing optoacoustic images.

Multiframe Blind Super Resolution Imaging Based on Blind Deconvolution

As an ill-posed problem, multiframe blind super resolution imaging recovers a high resolution image from a group of low resolution images with some degradations when the information of blur kernel is limited. Note that the quality of the recovered image is influenced more by the accuracy of blur estimation than an advanced regularization. We study the traditional model of the multiframe super resolution and modify it for blind deblurring. Based on the analysis, we proposed two algorithms. The first one is based on the total variation blind deconvolution algorithm and formulated as a functional for optimization with the regularization of blur. Based on the alternating minimization and the gradient descent algorithm, the high resolution image and the unknown blur kernel are estimated iteratively. By using the median shift and add operator, the second algorithm is more robust to the outlier influence. The MSAA initialization simplifies the interpolation process to reconstruct the blurred high resolution image for blind deblurring and improves the accuracy of blind super resolution imaging. The experimental results demonstrate the superiority and accuracy of our novel algorithms.

Astronomical image restoration using variational Bayesian blind deconvolution

An algorithm is presented for image prior combinations based blind deconvolution and applied to astronomical images.Using a hierarchical Bayesian framework, the unknown original image and all required algorithmic parameters are estimated simultaneously. Through utilization of variational Bayesian analysis,approximations of the posterior distributions on each unknown are obtained by minimizing the Kullback-Leibler(KL) distance, thus providing uncertainties of the estimates during the restoration process. Experimental results on both synthetic images and real astronomical images demonstrate that the proposed approaches compare favorably to other state-of-the-art reconstruction methods.

AN IMPROVED FAST BLIND DECONVOLUTION ALGORITHM BASED ON DECORRELATION AND BLOCK MATRIX

In order to alleviate the shortcomings of most blind deconvolution algorithms,this paper proposes an improved fast algorithm for blind deconvolution based on decorrelation technique and broadband block matrix.Althougth the original algorithm can overcome the shortcomings of current blind deconvolution algorithms,it has a constraint that the number of the source signals must be less than that of the channels.The improved algorithm deletes this constraint by using decorrelation technique.Besides,the improved algorithm raises the separation speed in terms of improving the computing methods of the output signal matrix.Simulation results demonstrate the validation and fast separation of the improved algorithm.

ITERATIVE MULTICHANNEL BLIND DECONVOLUTION METHOD FOR TEMPORALLY COLORED SOURCES

An iterative separation approach, i.e. source signals are extracted and removed one by one, is proposed for multichannel blind deconvolution of colored signals. Each source signal is extracted in two stages: a filtered version of the source signal is first obtained by solving the generalized eigenvalue problem, which is then followed by a single channel blind deconvolution based on ensemble learning. Simulation demonstrates the capability of the approach to perform efficient mutichannel blind deconvolution.

Blind Deconvolution Processing of Loop Inductance Signals for Vehicle Reidentification

Vehicle reidentification is an elegant solution for gathering several pieces of valuable traffic information, e.g., space mean speed, travel time, vehicle tracking, and origin/destination data. Recently, a number of vehiclereidentification algorithms utilizing inductive loop signals have been proposed to take advantage of the widespread availability of loop detectors. These algorithms, however, all directly utilize the raw inductance signals for pattern matching and feature extraction without deconvolution. The raw loop signals are essentially a convolved output between the true vehicle inductance signature and the loop system function, and thus a deconvolution is needed in order to expose the detailed features of individual vehicles. The purpose of this paper is to present a recent investigation on restoration of true inductance signatures by applying a blind deconvolution process. The main advantage of blind deconvolution over the conventional deconvolution is that the computation does not require modeling of a precise loop-detector system function. Experimental results show that the proposed blind deconvolution reveals much more detailed features of inductance signals and, as a result, increases the vehicle reidentification accuracy.

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.

Wavelet-based deconvolution of ultrasonic signals in nondestructive evaluation

In this paper, the inverse problem of reconstructing reflectivity function of a medium is examined within a blind deconvolution framework. The ultrasound pulse is estimated using higher-order statistics, and Wiener filter is used to obtain the ultrasonic reflectivity function through wavelet-based models. A new approach to the parameter estimation of the inverse filtering step is proposed in the nondestructive evaluation field, which is based on the theory of Fourier-Wavelet regularized deconvolution (ForWaRD). This new approach can be viewed as a solution to the open problem of adaptation of the ForWaRD framework to perform the convolution kernel estimation and deconvolution interdependently. The results indicate stable solutions of the esti- mated pulse and an improvement in the radio-frequency (RF) signal taking into account its signal-to-noise ratio (SNR) and axial resolution. Simulations and experiments showed that the proposed approach can provide robust and optimal estimates of the reflectivity function.

BLIND SPEECH SEPARATION FOR ROBOTS WITH INTELLIGENT HUMAN-MACHINE INTERACTION

Speech recognition rate will deteriorate greatly in human-machine interaction when the speaker's speech mixes with a bystander's voice. This paper proposes a time-frequency approach for Blind Source Seperation (BSS) for intelligent Human-Machine Interaction(HMI). Main idea of the algorithm is to simultaneously diagonalize the correlation matrix of the pre-whitened signals at different time delays for every frequency bins in time-frequency domain. The prososed method has two merits: (1) fast convergence speed; (2) high signal to interference ratio of the separated signals. Numerical evaluations are used to compare the performance of the proposed algorithm with two other deconvolution algorithms. An efficient algorithm to resolve permutation ambiguity is also proposed in this paper. The algorithm proposed saves more than 10% of computational time with properly selected parameters and achieves good performances for both simulated convolutive mixtures and real room recorded speeches.

Blind Deblurring Based on L_0 Norm from Salient Edges

Motion deblurring is a basic problem in the field of image processing and analysis. This paper proposes a new method of single image blind deblurring which can be significant to kernel estimation and non-blind deconvolution. Experiments show that the details of the image destroy the structure of the kernel, especially when the blur kernel is large. So we extract the image structure with salient edges by the method based on RTV. In addition, the traditional method for motion blur kernel estimation based on sparse priors is conducive to gain a sparse blur kernel. But these priors do not ensure the continuity of blur kernel and sometimes induce noisy estimated results. Therefore we propose the kernel refinement method based on L0 to overcome the above shortcomings. In terms of non-blind deconvolution we adopt the L1/L2 regularization term. Compared with the traditional method, the method based on L1/L2 norm has better adaptability to image structure, and the constructed energy functional can better describe the sharp image. For this model, an effective algorithm is presented based on alternating minimization algorithm.

Inspection of the Output of a Convolution and Deconvolution Process from the Leading Digit Point of View—Benford’s Law

In the communication field, during transmission, a source signal undergoes a convolutive distortion between its symbols and the channel impulse response. This distortion is referred to as Intersymbol Interference (ISI) and can be reduced significantly by applying a blind adaptive deconvolution process (blind adaptive equalizer) on the distorted received symbols. But, since the entire blind deconvolution process is carried out with no training symbols and the channel’s coefficients are obviously unknown to the receiver, no actual indication can be given (via the mean square error (MSE) or ISI expression) during the deconvolution process whether the blind adaptive equalizer succeeded to remove the heavy ISI from the transmitted symbols or not. Up to now, the output of a convolution and deconvolution process was mainly investigated from the ISI point of view. In this paper, the output of a convolution and deconvolution process is inspected from the leading digit point of view. Simulation results indicate that for the 4PAM (Pulse Amplitude Modulation) and 16QAM (Quadrature Amplitude Modulation) input case, the number “1” is the leading digit at the output of a convolution and deconvolution process respectively as long as heavy ISI exists. However, this leading digit does not follow exactly Benford’s Law but follows approximately the leading digit (digit 1) of a Gaussian process for independent identically distributed input symbols and a channel with many coefficients.

Algorithm for the Removing Uniformed Motion Blur

Motion deblurring is one of the basic problems inthe field of image processing. This paper summarizes the mathematical basis of the previous work and presents a deblurringmethod that can improve the estimation of the motion blurkernel and obtain a better result than the traditional methods.Experiments show the motion blur kernel loses some important and useful properties during the estimation of the kernel which may cause a bad estimation and increase the ringingartifacts. Considering that the kernel is provided by the motion of the imaging sensor during the exposure and that the kernel shows the trace of the motion, this paper ensures the physical meaning of the kernel such as the continuity and the center of thekernel during the iterative process. By adding a post process to the estimation of the motion blur kernel, we remove some discrete points and make use of the centralizationof the kernel in order to accurate the estimation. The experiment shows the existence of the post process improves the effect of the estimation of the kernel and provides a better result with the clear edges.

Blind image deconvolution for single motion-blurred image

Motion blur due to camera shake during exposure is one of the most common reasons of image degradation, which usually reduces the quality of photographs seriously. Based on the statistical properties of the natural image＇s gradient and the blur kernel, a blind deconvolution algorithm is proposed to restore the motion-blurred image caused by camera shake, adopting the variational Bayesian estimation theory. In addition, the ring effect is one problem that is not avoided in the process of image deconvolution, and usually makes the visual effect of the restored image badly. So a dering method is put forward based on the sub-region detection and fuzzy filter. Tested on the real blurred photographs, the experimental results show that the proposed algorithm of blind image deconvolution can remove the camera-shake motion blur from the degraded image effectively, and can eliminate the ring effect better, while preserve the edges and details of the image well.

A Robust Algorithm for Blind Total Variation Restoration

Image restoration is a fundamental problem in image processing. Blind image restoration has a great value in its practical application. However, it is not an easy problem to solve due to its complexity and difficulty. In this paper, we combine our robust algorithm for known blur operator with an alternating minimization implicit iterative scheme to deal with blind deconvolution problem, recover the image and identify the point spread function（PSF）. The only assumption needed is satisfy the practical physical sense. Numerical experiments demonstrate that this minimization algorithm is efficient and robust over a wide range of PSF and have almost the same results compared with known PSF algorithm.

ON ALGORITHMS FOR AUTOMATIC DEBLURRING FROM A SINGLE IMAGE

In this paper, we study two variational blind deblurring models for a single linage,The first model is to use the total variation prior in both image and blur, while the second model is to use the flame based prior in both image and blur. The main contribution of this paper is to show how to employ the generalized cross validation （GCV） method efficiently and automatically to estimate the two regularization parameters associated with the priors in these two blind motion deblurring models. Our experimental results show that the visual quality of restored images by the proposed method is very good, and they are competitive with the tested existing methods. We will also demonstrate the proposed method is also very efficient.

Research on Adaptive Optics Image Restoration Algorithm Based on Improved Joint Maximum a Posteriori Method

In this paper, we propose a point spread function （PSF） reconstruction method and joint maximum a posteriori （JMAP） estimation method for the adaptive optics image restoration. Using the JMAP method as the basic principle, we establish the joint log likelihood function of multi-frame adaptive optics （AO） images based on the image Gaussian noise models. To begin with, combining the observed conditions and AO system characteristics, a predicted PSF model for the wavefront phase effect is developed; then, we build up iterative solution formulas of the AO image based on our proposed algorithm, addressing the implementation process of multi-frame AO images joint deconvolution method. We conduct a series of experiments on simulated and real degraded AO images to evaluate our proposed algorithm. Compared with the Wiener iterative blind deconvolution （Wiener-IBD） algorithm and Richardson-Lucy IBD algorithm, our algorithm has better restoration effects including higher peak signal-to-noise ratio （PSNR） and Laplacian sum （LS） value than the others. The research results have a certain application values for actual AO image restoration.