A super-exponential algorithm for blind deconvolution of MIMO system

Blind deconvolution is a challenging problem, but in low-light it is even more difficult. Existing algorithms, both classical and deep-learning based, are not designed for this condition. When the photon shot noise is strong, conventional deconvolution methods fail because (1) the image does not have enough signal-to-noise ratio to perform the blur estimation; (2) While deep neural networks are powerful, many of them do not consider the forward process. When the noise is strong, these networks fail to simultaneously deblur and denoise; (3) While iterative schemes are known to be robust in the classical frameworks, they are seldom considered in deep neural networks because it requires a differentiable non-blind solver. This paper addresses the above challenges by presenting an <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">unsupervised</i> blind deconvolution method. At the core of this method is a reformulation of the general blind deconvolution framework from the conventional image-kernel alternating minimization to a purely kernel-based minimization. This kernel-based minimization leads to a new iterative scheme that backpropagates an unsupervised loss through a pre-trained non-blind solver to update the blur kernel. Experimental results show that the proposed framework achieves superior results than state-of-the-art blind deconvolution algorithms in low-light conditions.

The detection of rolling bearing faults is essential to ensure the operational safety of rotating machinery. An effective method for diagnosing rolling bearing faults is the maximum second-order cyclostationarity blind deconvolution (CYCBD) method, which has the ability to extract weak fault periodic pulse features. However, blind deconvolution methods such as CYCBD often fail when composite bearing faults occur in the presence of strong background noise. To overcome this issue, an adaptive blind deconvolution (ABDD) method based on improved CYCBD is proposed. In this method, a finite impulse response (FIR) filter bank is constructed to cover the entire frequency band of the signal, enabling fault frequency segmentation. The improved CYCBD is then used to obtain a filter pattern that locks on the fault frequency. These filter patterns are arranged in descending order based on the correlation kurtosis (CK). The required filtering mode is selected according to the sorting mode, and a spectrum analysis is performed to extract fault features of single and compound faults in the bearing. Simulation and experimental results demonstrate that ABDD effectively extracts bearing composite fault features and outperforms classic feature decomposition and blind deconvolution methods in extracting single and composite fault features.

The main inherent property of medical ultrasound imaging is speckle noise which generally obscures and reduces the diagnostic image resolution and contrast. Consequently, the substantial improvement of ultrasound images is an important prerequisite, whenever ultrasound is used as one of the most utilized diagnostic modalities. The problem of reconstruction of ultrasound images by means of blind deconvolution has long been recognized as a prerequisite in ultrasound imaging processing in the recent decades. Recently, the Total Variation (TV) regularization method has become extremely effective approach for image reconstruction, especially for restoring edges of the blurring image. In this paper, we present a new blind iterative TV deconvolution algorithm for reconstructing ultrasound images from blurry and noisy observations. First, it proposes the initial estimation of the point-spread function (PSF) based on a generalization of two-dimensional homomorphic filtering in cepstrum domain. It is demonstrated that the initial PSF can be effectively estimated by applying a proper smoothing low-pass filtering in cepstrum domain. Second, it introduces a novel blind iterative TV deconvolution which is derived from an alternating minimization algorithm. Fast Fourier Transform (FFT) is used in the pre-iteration computation. The innovative blind deconvolution is based on either concurrent or successive estimation of the PSF function and the image of interest. The iterative scheme is devised to recover the image and simultaneously identify the PSF function. The estimated PSF and restored image will be close to real values in the subsequent iterative deconvolution. Final, tests on phantom and clinical images have proven our novel blind iterative TV deconvolution gives more positive results of higher spatial resolution and better defined tissue structures than other deconvolution methods.

A new two-stage algorithm is proposed for the deconvolution of a multi-input multi-output (MIMO) system with colored input signals. Though most blind deconvolution algorithms in the literature utilize high-order statistics of the output signals for white input signals, the additional information that the input signals are colored allows second-order statistical algorithms to be designed. In fact, practical signal sources such as speech do have distinct, non-stationary, colored power spectral density. The first stage of signal separation is derived from a matrix pencil formed between output auto-correlation matrices at different delays. The deconvolution stage is then based on an existing subspace method. Simulation results are also presented.

We enhance the performance of the nonnegativity and support constraints recursive inverse filtering (NAS-RIF) algorithm for blind image deconvolution. The original cost function is modified to overcome the problem of operation on images with different scales for the representation of pixel intensity levels. Algorithm resetting is used to enhance the convergence of the conjugate gradient algorithm. A simple pixel classification approach is used to automate the selection of the support constraint. The performance of the resulting enhanced NAS-RIF algorithm is demonstrated on various images.

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.

Single-image blind deconvolution is one of the most challenging fields in image processing which restores a sharp image from its blurred version. Nowadays blind deconvolution algorithms have made significant progress. However, the restoration of blurred images with little scale edges and periodic textures is still a hard work. To solve this problem, this paper proposes a new normalized sparse regularization blind deconvolution algorithm, which uses a gradient saliency map to prohibit the image small structures on image blurry kernel estimation. Firstly, salient detection is performed to select the important area which conforms with the human vision system and generates a binary mask to screen out useful gradients. Secondly, the normalized sparse regularization blind deconvolution method is applied to obtain accurate blur kernel and recover the sharp image. Finally, the experiment results show that the algorithm can effectively deblur the degraded image on different scenarios.

The present paper illustrates a geodesic-based learning algorithm over a curved parameter space for blind deconvolution application. The chosen deconvolving structure appears as a single neuron model whose learning rule arises from criterion-function minimization over a smooth manifold. In particular, we propose here a learning stepsize selection theory for the algorithm at hand. We consider the blind deconvolution performances of the algorithm as well as its computational burden. Also, a numerical comparison with seven blind-deconvolution algorithms known from the scientific literature is illustrated and discussed. Results of numerical tests conducted on a noiseless as well as a noisy system will confirm that the algorithm discussed in the present paper performs in a satisfactory way. Also, the performances of the presented algorithm will be compared with those exhibited by other blind deconvolution algorithms known from the literature.

We propose a new method of blind deconvolution (BD) suitable for the recovery of truncated blurred images. In practical cases we often encounter truncated images, but they are difficult to treat properly with conventional BD algorithms, since nontruncated blurred images are assumed. The proposed method is based on simulated annealing (SA), to which we introduce an adaptive masking process. After a truncated segment is cut out from the blurred image, the sharp edges surrounding the segment are removed by multiplying the initial window, whose shape is determined with the initial estimate of the point spread function (PSF). A more appropriate estimate for the PSF is obtained from the masked segment based on the SA algorithm, and according to the new estimate of the PSF, the shape of the window is varied. These procedures are iterated until we finally obtain the best possible estimate of the PSF. In the last step, the entire blurred image is deconvolved with the final estimate of the PSF to obtain the recovered image. The effectiveness of the proposed method is confirmed by computer simulation.

Total variation minimizing blind deconvolution with shock filter reference

A new blind deconvolution method with additional phase spectral constraints for the blurred image is discussed in this paper. The blurred image is a convolution of an original image and a point-spread function (PSF). The proposed method is based on the following iterative procedures, i.e., a projection onto a frequency space satisfying phase spectrum constraints, a minimization of a cost function and a projection onto an image space satisfying the support and nonnegativity constraints. This method restores the original image and the PSF stably with high accuracy. The effectiveness of the proposed method is verified by applying it to some blind deconvolution problems of images. The experimental results show that the performance of the proposed method is drastically improved in comparison with the conventional blind deconvolution method.

Spectrum extraction which is applied to extract one-dimensional (1D) astronomical spectroscopy from twodimensional (2D) multi-fiber spectrum images plays a key role in data processing of 2D optical fiber spectrum. In this paper, we have given a detailed comparison of spectrum extraction methods between the blind deconvolution and the non-blind deconvolution to find out their specialities. The simulated arc spectrum data is used in Comparative experiments. The results show that the blind deconvolution is better than the non-blind deconvolution not only at spectrum extraction result but also remarkably at signal noise ratio (SNR).

Complex signal and system models are considered in this paper, and a class of new criteria, which is based on the higher-order cumulant, is derived for blind deconvolution. It is pointed out that blind deconvolution may be realized by maximizing or minimizing the normalized cumulant of the system output. This is a new approach to statistical matching for blind deconvolution. As an example, a new blind deconvolution (equalization) algorithm is proposed, and computer simulation results are included to demonstrate the performance of the proposed algorithm.

Non-parametric Bayesian models of response function in dynamic image sequences

We propose to use the blind deconvolution and its modification to extract the point spread function (PSF) of layered metamaterials from a SNOM measurement. The measurement results are processed using the blind deconvolution algorithm to reconstruct the real-valued non-coherent PSF, or using the modified blind deconvolution introduced in this paper to reconstruct the complex-valued coherent PSF. The two algorithms are tested in simulations with a layered metamaterial deposited on a thin metallic mask with test apertures. We show that the modified algorithm is capable of recovering the approximate shape of complex PSF with a sub-wavelength full width at half maximum from a measurement in which the apertures are larger than the wavelength.