Total variation minimizing blind deconvolution with shock filter reference

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 weighted total variation algorithm was proposed for solving some blind deconvolution problems,and then we got the existence of energy functional minimum and educed corresponding thermal flow.In computer simulations,the algorithm performs well even when we have no more accurate prior knowledge about point spread function and the original true image,besides some other constrains.Experiments show that the proposed algorithm is more effective and performs better than the total variation blind deconvolution method proposed.

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.

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).

_ This article, written by JPT Technology Editor Chris Carpenter, contains highlights of paper OTC 35821, “A Mobile Platform for AI-Powered Underwater Image Processing,” by Chenyu Zhou, University of Houston; Lily Walker, William &amp; Mary; and Xin Fu, University of Houston, et al. The paper has not been peer reviewed. Copyright 2025 Offshore Technology Conference. _ Timely inspection of subsea infrastructure—particularly pipelines—is crucial for preventing oil spills and protecting the environment. This paper introduces a technology for offshore pipeline inspection centered on an autonomous robotic system equipped with underwater computer vision and edge-computing capabilities. The aim is to create a fast, cost-effective solution for inspecting underwater structures, enabling early detection of environmental hazards. Introduction Autonomous underwater vehicles (AUVs) have revolutionized the ability to explore and monitor marine environments. The cornerstone of AUV capabilities lies in their imaging systems, although the underwater environment poses unique and complex challenges for these systems. Additional image-processing and correction ability remains a goal for AUVs, creating computational demands that must be balanced against limited onboard power and processing capabilities (Fig. 1). Recently, advancements in deep learning have enabled deep neural networks (DNNs) to achieve remarkable success in solving a wide range of image-processing challenges, significantly surpassing the performance of traditional methods. In this research, the authors build upon foundational work in the literature to present a comprehensive workflow for adapting and deploying pretrained DNN models onto mobile computing platforms suitable for integration with AUVs. The described approach examines and documents the transition from powerful desktop systems to resource-constrained mobile platforms. Underwater Image Enhancement Motion blur is a common challenge in underwater image processing, especially when the camera is mounted on a moving platform such as an AUV. The lack of adequate lighting in underwater environments often requires longer exposure times, further exacerbating motion blur. The blurring process can be mathematically described as a convolution of the sharp image with a blur kernel, plus noise. If the blur kernel is known beforehand, the problem becomes one of nonblind deconvolution. However, when the blur kernel is unknown—common in dynamic underwater settings—it becomes a blind deconvolution problem. This problem is inherently ill-posed because multiple combinations of sharp images and blur kernels can explain the same blurred image. To resolve this ambiguity, assumptions or previous knowledge about the blur kernel or image structure typically are introduced. Traditional blind deconvolution methods often use iterative algorithms, refining the blur kernel and sharp image estimates over multiple steps. These classical approaches, however, often suffer from artifacts such as ringing and struggling with large motions or noise. To address these limitations, researchers have explored regularization techniques that incorporate priors to constrain the solution space. For example, sparsity priors in the temporal domain encourage smooth results, while Bayesian frameworks provide probabilistic formulations of the problem. One promising direction involves leveraging domain-specific priors for underwater imagery. By incorporating this property into optimization frameworks, researchers have developed more-effective and -robust blind deblurring methods tailored to underwater scenarios.

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.

In this paper, a method for MIMO blind deconvolution is proposed. The method is applicable to the case of non-Gaussian i.i.d. input signals. The core of the method is an algorithm which extracts one of the input signals from the information of the output signals only. This algorithm is an non-trivial generalization of the Shalvi-Weinstein algorithm for SISO blind deconvolution and converges in super-exponential rate possibly after finite iterations. By recursive use of this algorithm, extraction of all input signals can be achieved.

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.

We use blind deconvolution methods in optical diffusion tomography to reconstruct images of objects imbedded in or located behind turbid media from continuous-wave measurements of the scattered light transmitted through the media. In particular, we use a blind deconvolution imaging algorithm to determine both a deblurred image of the object and the depth of the object inside the turbid medium. Preliminary results indicate that blind deconvolution produces better reconstructions than can be obtained using backpropagation techniques. Moreover, it does so without requiring prior knowledge of the characteristics of the turbid medium or of what the blur-free target should look like: important advances over backpropagation.

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.

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.

We introduce a novel multichannel blind deconvolution (BD) method that extracts sparse and front-loaded impulse responses from the channel outputs, i.e., their convolutions with a single arbitrary source. A crucial feature of this formulation is that it doesn't encode support restrictions on the unknowns, unlike most prior work on BD. The indeterminacy inherent to BD, which is difficult to resolve with a traditional L1 penalty on the impulse responses, is resolved in our method because it seeks a first approximation where the impulse responses are: "maximally white" -- encoded as the energy focusing near zero lag of the impulse-response auto-correlations; and "maximally front-loaded" -- encoded as the energy focusing near zero time of the impulse responses. Hence we call the method focused blind deconvolution (FBD). The focusing constraints are relaxed as the iterations progress. Note that FBD requires the duration of the channel outputs to be longer than that of the unknown impulse responses. A multichannel blind deconvolution problem that is appropriately formulated by sparse and front-loaded impulse responses arises in seismic inversion, where the impulse responses are the Green's function evaluations at different receiver locations, and the operation of a drill bit inputs the noisy and correlated source signature into the subsurface. We demonstrate the benefits of FBD using seismic-while-drilling numerical experiments, where the noisy data recorded at the receivers are hard to interpret, but FBD can provide the processing essential to separate the drill-bit (source) signature from the interpretable Green's function.

Image deblurring is an important task for digital cameras. This paper introduces spatial-variant upper and lower bound constraints to regularize Total Variation blind deconvolution. The local upper and lower bound constraints are computed based on the local structure of the observed image. We demonstrate that the proposed spatial-variant constraints can be useful in PSF estimation and image blind deconvolution. Secondly, as other traditional deblurring techniques, the TV blind deconvolution can also produce ringing artifacts. This paper study the GMM-based method to learn the ringing patch distributions. The learned distribution function is then incorporated into the deblurring objective function to suppress the ringing artifacts. Experiments demonstrated the efficacy of the proposed method.

Recently we have developed an eigenvector method (EVM) which can achieve the blind deconvolution (BD) for MIMO systems. The attractive features of the proposed algorithm are that the BD can be achieved by calculating the eigenvectors of a matrix and by using reference signals. However, the performance accuracy of the EVM depends highly on the computational result of the eigenvectors. In this paper, by modifying the EVM, we propose an algorithm which can achieve the BD without calculating the eigenvectors. Then the pseudo-inverse which is needed to carry out the BD is calculated by our proposed matrix pseudo-inversion lemma. Simulation results will be presented for showing the validity of the proposed method.