基于参数估计的降晰函数辨识及图像复原算法

成像系统的点扩展函数(PSF)以及观测噪声,在一般应用过程中是未知信息,因此,点扩展函数的辨识是一个具有挑战性的世界难题.为解决实际工作中遇到的在已知降晰类型情况下的降晰函数辨识和降晰图像复原问题,提出了基于参数估计的降晰函数辨识及降晰图像复原算法.首先,由初始猜测给定降晰函数参数的变化范围和参数的增量步长;然后,最小化降晰图像和由相应点扩展函数及降晰图像得到的实验观测图像的差的Frobenius范数,以确定点扩展函数的参数,进而确定降晰图像的点扩展函数并对降晰图像进行复原.应用基于Wiener滤波的频域循环边界算法对降晰图像进行复原.实验结果表明:在降晰图像信噪比较高的情况下,降晰函数的辨识结果是可靠和准确的,有较好的复原效果.     

Radon变换和全变分相融合的图像复原算法

图像复原的核心是点扩散函数的估计和直接去卷积算法,针对拍照过程中,相机和被拍摄物体由于相对运动而导致的图像退化问题,提出一种基于Radon变换和全变分相融合的图像复原算法。首先利用radon变换对图像退化模型参数进行估计,然后采用全变分算法复原退化图像,最后在Matlab 2012平台进行仿真实验对算法的性能检验。仿真结果表明,相对于其它图像复原算法,本文算法可以准确估计退化模型参数,获得了更加理想的图像复原效果,具有一定的实际利用价值。     

Novel cooperative neural fusion algorithms for image restoration and image fusion.

To deal with the problem of restoring degraded images with non-Gaussian noise, this paper proposes a novel cooperative neural fusion regularization (CNFR) algorithm for image restoration. Compared with conventional regularization algorithms for image restoration, the proposed CNFR algorithm can relax need of the optimal regularization parameter to be estimated. Furthermore, to enhance the quality of restored images, this paper presents a cooperative neural fusion (CNF) algorithm for image fusion. Compared with existing signal-level image fusion algorithms, the proposed CNF algorithm can greatly reduce the loss of contrast information under blind Gaussian noise environments. The performance analysis shows that the proposed two neural fusion algorithms can converge globally to the robust and optimal image estimate. Simulation results confirm that in different noise environments, the proposed two neural fusion algorithms can obtain a better image estimate than several well known image restoration and image fusion methods.     

Point-source localization in blurred images by a frequency-domaineigenvector-based method

We address the problem of resolving and localizing blurred point sources in intensity images. Telescopic star-field images blurred by atmospheric turbulence or optical aberrations are typical examples of this class of images, a new approach to image restoration is introduced, which is a generalization of 2-D sensor array processing techniques originating from the field of direction of arrival estimation (DOA). It is shown that in the frequency domain, blurred point source images can be modeled with a structure analogous to the response of linear sensor arrays to coherent signal sources. Thus, the problem may be cast into the form of DOA estimation, and eigenvector based subspace decomposition algorithms, such as MUSIC, may be adapted to search for these point sources. For deterministic point images the signal subspace is degenerate, with rank one, so rank enhancement techniques are required before MUSIC or related algorithms may be used. The presence of blur prohibits the use of existing rank enhancement methods. A generalized array smoothing method is introduced for rank enhancement in the presence of blur, and to regularize the ill posed nature of the image restoration. The new algorithm achieves inter-pixel super-resolution and is computationally efficient. Examples of star image deblurring using the algorithm are presented.     

A simulated annealing restoration algorithm for restoring halftoned color-quantized images

Restoration of color-quantized images is rarely addressed in the literature especially when the images are color-quantized with halftoning. Most existing restoration algorithms are generally inadequate to deal with this problem as they were proposed for restoring noisy blurred images. In this paper, a restoration algorithm based on simulated annealing is proposed to solve the problem. This algorithm makes a good use of the available color palette and the mechanism of a halftoning process to derive useful a priori information for restoration. Simulation results show that it can improve the quality of a halftoned color-quantized image remarkably in terms of both SNR and CIELAB color difference metric. The subjective quality of the restored images can also be improved.     

基于边缘信息的运动模糊图像的鲁棒盲复原

为获得适用于不同模糊图像且简捷的图像盲复原方法,提出了一种稳健的从单幅模糊图像中求取模糊核并对图像去模糊的图像盲复原方法。根据模糊图像与非模糊图之间的边缘关系求模糊核,并在多尺度框架下针对各个子算法设定自适应参数,从而构建一个稳健的图像盲复原方法。对复原结果用4种无参考的图像质量评价方法的评价结果显示,本文方法在噪声和...     

Blind identification of multichannel FIR blurs and perfect imagerestoration

Despite its practical importance in image processing and computer vision, blind blur identification and blind image restoration have so far been addressed under restrictive assumptions such as all-pole stationary image models blurred by zero or minimum-phase point-spread functions. Relying upon diversity (availability of a sufficient number of multiple blurred images), we develop blind FIR blur identification and order determination schemes. Apart from a minimal persistence of the excitation condition (also present with nonblind setups), the inaccessible input image is allowed to be deterministic or random and of unknown color of distribution. With the blurs satisfying a certain co-primeness condition in addition, we establish existence and uniqueness results which guarantee that single input/multiple-output FIR blurred images can be restored blindly, though perfectly in the absence of noise, using linear FIR filters. Results of simulations employing the blind order determination, blind blur identification, and blind image restoration algorithms are presented. When the SNR is high, direct image restoration is found to yield better results than indirect image restoration which employs the estimated blurs. In low SNR, indirect image restoration performs well while the direct restoration results vary with the delay but improve with larger equalizer orders.     

A POCS-based restoration algorithm for restoring halftoned color-quantized images.

This paper studies the restoration of images which are color-quantized with error diffusion. Though there are many reported algorithms proposed for restoring noisy blurred color images and inverse halftoning, restoration of color-quantized images is rarely addressed in the literature especially when the images are color-quantized with halftoning. Direct application of existing restoration techniques are generally inadequate to deal with this problem. In this paper, a restoration algorithm based on projection onto convex sets is proposed. This algorithm makes use of the available color palette and the mechanism of a halftoning process to derive useful a priori information for restoration. Simulation results showed that it could improve the quality of a halftoned color-quantized image remarkably in terms of both SNR and CIELAB color difference metric.     

A Robust Hidden Markov Gauss Mixture Vector Quantizer for a Noisy Source

Noise is ubiquitous in real life and changes image acquisition, communication, and processing characteristics in an uncontrolled manner. Gaussian noise and Salt and Pepper noise, in particular, are prevalent in noisy communication channels, camera and scanner sensors, and medical MRI images. It is not unusual for highly sophisticated image processing algorithms developed for clean images to malfunction when used on noisy images. For example, hidden Markov Gauss mixture models (HMGMM) have been shown to perform well in image segmentation applications, but they are quite sensitive to image noise. We propose a modified HMGMM procedure specifically designed to improve performance in the presence of noise. The key feature of the proposed procedure is the adjustment of covariance matrices in Gauss mixture vector quantizer codebooks to minimize an overall minimum discrimination information distortion (MDI). In adjusting covariance matrices, we expand or shrink their elements based on the noisy image. While most results reported in the literature assume a particular noise type, we propose a framework without assuming particular noise characteristics. Without denoising the corrupted source, we apply our method directly to the segmentation of noisy sources. We apply the proposed procedure to the segmentation of aerial images with Salt and Pepper noise and with independent Gaussian noise, and we compare our results with those of the median filter restoration method and the blind deconvolution-based method, respectively. We show that our procedure has better performance than image restoration-based techniques and closely matches to the performance of HMGMM for clean images in terms of both visual segmentation results and error rate.     

A regularization approach to joint blur identification and imagerestoration

The primary difficulty with blind image restoration, or joint blur identification and image restoration, is insufficient information. This calls for proper incorporation of a priori knowledge about the image and the point-spread function (PSF). A well-known space-adaptive regularization method for image restoration is extended to address this problem. This new method effectively utilizes, among others, the piecewise smoothness of both the image and the PSF. It attempts to minimize a cost function consisting of a restoration error measure and two regularization terms (one for the image and the other for the blur) subject to other hard constraints. A scale problem inherent to the cost function is identified, which, if not properly treated, may hinder the minimization/blind restoration process. Alternating minimization is proposed to solve this problem so that algorithmic efficiency as well as simplicity is significantly increased. Two implementations of alternating minimization based on steepest descent and conjugate gradient methods are presented. Good performance is observed with numerically and photographically blurred images, even though no stringent assumptions about the structure of the underlying blur operator is made.     

基于点扩散函数支持域扩展的多帧未匹配退化图像盲解卷积复原

多帧盲解卷积算法利用多帧退化图像进行复原可以获得清晰原始图像和点扩散函数的信息,受到了很多研究者的关注。目前大部分多帧盲解卷积算法都需要对多帧退化图像进行匹配预处理,以消除图像间平移引入的算法求解误差。本文利用频率内的多帧盲解卷积算法对未匹配的退化图像进行处理,不需要进行预匹配处理,只需要对点扩散函数的支持域进行扩展就可以复原获取清晰化的图像。利用傅里叶变换的性质对该方法的可行性进行了说明。同时对该方法进行了数字仿真实验,复原结果中的点扩散函数发生了相对移动消除了图像间未匹配的影响,证实了本文方法的有效性。     

基于NSST图像特征的多聚焦图像融合方法

针对广泛存在于多聚焦图像融合方法中的局部图像细节不清晰的现状,提出一种基于非下采样剪切波变换(NSST)图像特征的多聚焦图像融合方法。利用NSST对待融合源图像进行多尺度、多方向稀疏分解,分别获取低频和一系列高频子带图像。通过空间频率和局部能量确定融合后的低频子带系数,利用边缘检测算子直接获取高频子带图像中的细节和边缘信息,并采取NSST反变换得到最终融合结果图像。仿真实验结果表明,同现有的几种经典算法相比,本文提出的方法获得的结果图像拥有更清晰的视觉效果、更理想的客观指标效果以及更高的算法运行效率。     

Robust classification of blurred imagery

We present two novel approaches for the classification of blurry images. It is assumed that the blur is linear and space invariant, but that the exact blurring function is unknown. The proposed fusion-based approaches attempt to perform the simultaneous tasks of blind image restoration and classification. We call such a problem blind image fusion. The techniques are implemented using the nonnegativity and support constraints recursive inverse filtering (NAS-RIF) algorithm for blind image restoration and the Markov random field (RIRF)-based fusion method for classification by Schistad-Solberg et al. (see IEEE Trans. Geosci. Remote Sensing, vol.32, p.768-78, 1994). Simulation results on synthetic and real photographic data demonstrate the potential of the approaches. The algorithms are compared with one another and to situations in which blind blur removal is not attempted.     

应用双稀疏模型和ADMM优化的图像复原

基于稀疏表示的图像复原算法大都只利用了图像整体稀疏性和局部稀疏性中的一种,未充分利用图像的先验知识,基于此,本文在稀疏表示框架下,同时引入Cosparse解析模型及平移不变小波变换两种稀疏模型,前者对每个图像块进行稀疏表示,后者对整幅图像进行稀疏表示,从而提出一种新的图像复原算法。该算法将图像复原问题归结为双稀疏正则化问题。为求解复杂的双稀疏优化问题,本文运用交替方向乘子法 (ADMM, Alternating Direction Method of Multipliers)算法将该约束优化问题分解为若干子问题,通过交替迭代求解获得复原图像。实验中对不同类型的模糊图像进行了复原,其结果表明该算法对于各类模糊图像的复原比现有复原算法效果更好,从而验证了算法的有效性。      

一种改进的全变差盲图像复原方法

当点传播函数未知或不确知的情况下,从观察到的退化图像中复原原始图像的过程称为图像盲复原.传统的图像盲复原算法常采用最小均方误差作为复原效果的评判准则,但它很少考虑人类视觉心理,而图像最终都必须由人类的视觉系统来观测和解释.因此,本文提出一种新的基于人类视觉特性的图像盲复原算法:它采用交替最小化的结构,在模糊辨识阶段,采用全变差正则化算法;在复原阶段,采用基于Weber定律和全变差正则化相结合的算法.仿真实验表明,这种算法可在未知点扩展函数的情况下取得较好的复原效果.     

交替使用小波去噪和全变差正则化的盲图像恢复算法

盲图像恢复就是在点扩散函数未知情况下从降质观测图像恢复出原图像.该文提出了一种交替使用小波去噪和全变差正则化的盲图像恢复算法.观测模型首先被分解成两个相互关联的子模型,这种分解转化盲恢复问题成为图像去噪和图像恢复两个问题,可以交替采用图像去噪和图像恢复算法求解.模糊辨识阶段,使用全变差正则化算法估计点扩散函数;图像恢复阶段,使用小波去噪和全变差正则化相结合的算法恢复图像.实验结果和与其它方法的比较表明该文算法能够获得更好的恢复效果.     

Sequential and parallel image restoration: neural networkimplementations

Sequential and parallel image restoration algorithms and their implementations on neural networks are proposed. For images degraded by linear blur and contaminated by additive white Gaussian noise, maximum a posteriori (MAP) estimation and regularization theory lead to the same high dimension convex optimization problem. The commonly adopted strategy (in using neural networks for image restoration) is to map the objective function of the optimization problem into the energy of a predefined network, taking advantage of its energy minimization properties. Departing from this approach, we propose neural implementations of iterative minimization algorithms which are first proved to converge. The developed schemes are based on modified Hopfield (1985) networks of graded elements, with both sequential and parallel updating schedules. An algorithm supported on a fully standard Hopfield network (binary elements and zero autoconnections) is also considered. Robustness with respect to finite numerical precision is studied, and examples with real images are presented.     

A novel blind deconvolution scheme for image restoration usingrecursive filtering

We present a novel blind deconvolution technique for the restoration of linearly degraded images without explicit knowledge of either the original image or the point spread function. The technique applies to situations in which the scene consists of a finite support object against a uniformly black, grey, or white background. This occurs in certain types of astronomical imaging, medical imaging, and one-dimensional (1-D) gamma ray spectra processing, among others. The only information required are the nonnegativity of the true image and the support size of the original object. The restoration procedure involves recursive filtering of the blurred image to minimize a convex cost function. We prove convexity of the cost function, establish sufficient conditions to guarantee a unique solution, and examine the performance of the technique in the presence of noise. The new approach is experimentally shown to be more reliable and to have faster convergence than existing nonparametric finite support blind deconvolution methods. For situations in which the exact object support is unknown, we propose a novel support-finding algorithm     

Stochastic methods for joint registration, restoration, and interpolation of multiple undersampled images.

Using a stochastic framework, we propose two algorithms for the problem of obtaining a single high-resolution image from multiple noisy, blurred, and undersampled images. The first is based on a Bayesian formulation that is implemented via the expectation maximization algorithm. The second is based on a maximum a posteriori formulation. In both of our formulations, the registration, noise, and image statistics are treated as unknown parameters. These unknown parameters and the high-resolution image are estimated jointly based on the available observations. We present an efficient implementation of these algorithms in the frequency domain that allows their application to large images. Simulations are presented that test and compare the proposed algorithms.