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

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

基于变分贝叶斯估计的相机抖动模糊图像的盲复原算法

在曝光过程中由于相机抖动而导致的运动模糊,是一种常见的图像降质现象。该文提出了一种基于变分贝叶斯估计和自然图像梯度统计特性的盲复原算法,用于恢复相机抖动模糊图像,同时针对图像复原过程中出现的振铃效应,设计了一种基于分区域检测和Fuzzy滤波器的去振铃效应方法。实验结果表明,该文提出的盲复原算法能够有效地去除图像中因相机抖动而产生的模糊,而且在保持图像边缘和细节的同时,可以较好地降低振铃效应对图像复原质量的影响。     

On Jacobi-type methods for blind equalization of paraunitary channels

In this paper a study of the cumulant-based blind equalization algorithms PAJOD and PAFA is conducted. Both algorithms assume that the data have been pre-whitened and hence the problem reduces to the estimation of paraunitary channels. The main contribution of this paper is an efficient implementation of the PAJOD algorithm called PAJOD2. Second, a performance comparison between the PAJOD, PAJOD2 and PAFA algorithms is reported.     

最小互信息量用于单输入单输出的盲解卷问题

本文利用最小互信息量标准处理盲解卷问题.首先,分别通过Edgeworth拓展和Gram-Charlier拓展方法近似输出的概率密度函数.继而估计互信息量.最后利用最小化互信息量原理求得优化的解卷滤波器系数,仿真实验证明了本文算法的有效性.     

Robust defocus blur identification in the context of blind image quality assessment

A defocus blur metric for use in blind image quality assessment is proposed. Blind image deconvolution methods are used to determine the metric. Existing direct deconvolution methods based on the cepstrum, bicepstrum and on a spectral subtraction technique are compared across 210 images. A variation of the spectral subtraction method, based on a power spectrum surface of revolution, is proposed and is found to compare favourably with existing direct deconvolution methods for defocus blur identification. The method is found to be especially useful when distinguishing between in-focus and out-of-focus images.     

气动光学效应图像恢复IBD算法研究

采用迭代盲目反卷积进行气动光学效应图像恢复研究,编制了相应的计算程序,获得了恢复图像和相应的气动光学效应降质过程的点扩散函数,同时讨论了共轭梯度CG算法在盲目反卷积图像恢复计算过程中的收敛性,并提出算法策略。     

基于2-D公共因子的精确提取的图像盲复原方法

利用2-D公共因子(GCD)提取是实现图像盲复原最有效的方法之一。该文发展了一种2-D公共因子精确提取算法,该算法不需要构建原算法中高阶病态方程,其复杂度大大降低,且提高了对噪声的鲁棒性。仿真实验证实了该文提出的方法优于传统图像复原算法。     

基于Huber正则化二阶加速Richardson-Lucy湍流图像复原算法

为了快速准确地恢复湍流退化图像,提出了Huber正则化Richardson-Lucy(R-L)加速迭代盲反卷积(IBD)算法。根据图像滤波处理结果,采用Huber函数自适应地选择一阶范数和二阶范数正则化约束,增加算法收敛速度同时提高图像细节和边界复原质量。引入基于泰勒级数的二阶矢量外推加速方法,进一步增加迭代的收敛速度。实验结果表明,采用提议的算法需要的迭代次数较少,适用于实时性要求较高的场合,复原图像的主客观质量均有所提高。     

单通道带通信号的复基带盲解卷积算法

该文提出了一种基于多途信道单通道接收的带通数据(波束或传感器输出)自相关函数的盲解卷积算法。该算法先通过复解调将带通信号频谱搬移到0频率附近,然后进行低通滤波和降采样率,得到其复基带信号。再针对单通道复基带信号,以其自相关函数在零延时之外某区间内的实部平方和最小为准则,推导出复基带多途信号盲解卷积的LMS自适应迭代算法。该方法能够适用于带通高斯信号和非高斯信号,与基于高阶统计量的方法相比,对源信号概率分布具有较宽的适用面,计算机仿真结果验证了该方法的正确性。     

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.     

Correntropy: Implications of nonGaussianity for the moment expansion and deconvolution

The recently introduced correntropy function is an interesting and useful similarity measure between two random variables which has found myriad applications in signal processing. A series expansion for correntropy in terms of higher-order moments of the difference between the two random variables has been used to try to explain its statistical properties for uses such as deconvolution. We examine the existence and form of this expansion, showing that it may be divergent, e.g., when the difference has the Laplace distribution, and give sufficient conditions for its existence for differently characterized sub-Gaussian distributions. The contribution of the higher-order moments can be quite surprising, depending on the size of the Gaussian kernel in the definition of the correntropy. In the blind deconvolution setting we demonstrate that statistical exchangeability explains the existence of sub-optimal minima in the correntropy cost surface and show how the positions of these minima are controlled by the size of the Gaussian kernel.     

利用低秩先验的噪声模糊图像盲去卷积

单幅图像盲去卷积的目的是从一幅观测的模糊图像估计出模糊核和清晰图像。该问题是严重病态的,尤其是观测图像中噪声不可忽略时更具挑战性。该文主要针对如何有效利用低秩先验约束进行噪声模糊图像盲去卷积问题,提出一种在交替最大后验(MAP)估计框架下利用低秩先验约束的单幅噪声模糊图像盲去卷积方法。首先,在估计中间复原图像时,利用低秩先验约束对复原图像中的噪声进行抑制。然后,采用降噪后的中间复原图像估计模糊核,得到更好质量的模糊核估计。迭代上述两个操作获得最终可靠的模糊核估计。最后,根据所估计的模糊核,通过非盲去卷积方法复原出清晰图像。实验结果表明：所提方法在定量和定性评价指标上优于已有的代表性方法。     

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

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

Enhanced sampling schemes for MCMC based blind Bernoulli-Gaussian deconvolution

This paper proposes and compares two new sampling schemes for sparse deconvolution using a Bernoulli-Gaussian model. To tackle such a deconvolution problem in a blind and unsupervised context, the Markov Chain Monte Carlo (MCMC) framework is usually adopted, and the chosen sampling scheme is most often the Gibbs sampler. However, such a sampling scheme fails to explore the state space efficiently. Our first alternative, the K-tuple Gibbs sampler, is simply a grouped Gibbs sampler. The second one, called partially marginalized sampler, is obtained by integrating the Gaussian amplitudes out of the target distribution. While the mathematical validity of the first scheme is obvious as a particular instance of the Gibbs sampler, a more detailed analysis is provided to prove the validity of the second scheme.For both methods, optimized implementations are proposed in terms of computation and storage cost. Finally, simulation results validate both schemes as more efficient in terms of convergence time compared with the plain Gibbs sampler. Benchmark sequence simulations show that the partially marginalized sampler takes fewer iterations to converge than the K-tuple Gibbs sampler. However, its computation load per iteration grows almost quadratically with respect to the data length, while it only grows linearly for the K-tuple Gibbs sampler.     

盲图像恢复中的二维盲均衡研究

数字图像在传输过程中,由于受到二维信道的点扩展函数(PSF)的影响,会产生图像模糊问题。在对图像进行恢复时,需要消除PSF的影响,在许多实际应用中PSF的特性未知,此时图像的恢复就是盲图像恢复。该文提出了一种应用于盲图像恢复的二维盲均衡迭代算法,该算法是通信领域中应用的EVA盲均衡算法的一种二维扩展。仿真结果表明,该算法具有信噪比增益高、收敛速度快等特点,有较为广泛的应用前景。     

基于加速正则化RL算法的大气湍流退化图像盲复原方法

提出了一种基于加速正则化Richardson-Lucy（RL）算法的大气湍流退化图像盲复原方法（AccRLTV-IBD）。在总变分（TV）正则化RL算法的基础上,引入二阶矢量外推加速技术对其进行加速,形成加速正则化RL（AccRLTV）算法,并将该算法应用到迭代盲目反卷积（IBD）算法中。使用长曝光大气湍流光学传递函数（OTF）的物理模型或根据图像来获取初始的点扩散函数（PSF）,在灰度平均梯度（gray Mean Grads, GMG）的基础上定义了一个相对灰度平均梯度（relative Gray Mean Grads, RGMG）参数作为无参考图像复原质量的评价标准。模拟图像和实际湍流退化图像复原结果表明,基于RL的IBD算法要优于基于Wiener滤波的IBD算法,并且与RL-IBD算法相比,AccRLTV-IBD收敛速度更快,复原效果更好。     

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

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