迭代频域反卷积滤波器的多参数优化

本文首先介绍了几种成功应用于现代时域测量和计量学中的迭代频域反卷积滤波器.包括Guillaumc-Nahman(G-N)反卷积滤波器、最佳补偿反卷积滤波器和综合反卷积滤波器;着重介绍了迭代频域反卷积滤波器的多参数优化原理并进行了必要的公式推导,给出了更为合理的反卷积滤波器传输函数表达式.然后,对这些反卷积滤波器进行了计算机仿真,并给出了每种反卷积滤波器的滤波效果与设定值相比较的滤形图.最后,对这些反卷积滤波器的性能进行了评述和比较,结果表明无论是波形还是标准偏差,多参数反卷积滤波器的效果最好.     

基于迭代滤波盲复原算法的水下图像噪声去除

摘要：图像复原的目的是从观测到的退化图像重建原始图像,维纳滤波与约束去卷积滤波是比较常采用的复原方法。在未知降质函数的情况下,直接运用维纳滤波和约束去卷积滤波有一定困难。针对此提出以维纳滤波与约束去卷积滤波为模型的迭代滤波盲复原算法对水下图像进行去噪。实验证明,该方法获得了比较理想的复原效果。     

采用超拉普拉斯先验的图像快速去卷积

通过分析自然图像梯度统计的长尾分布特性,证明超拉普拉斯模型是很好的。文章提出一个基于超拉普拉斯先验项的去卷积方法,实现运动模糊图像复原。该算法使用分步交替迭代最小化办法优化能量方程,通过查表的方法快速求解图像的反卷积。这种方法的速度是现有技术的几倍,能够在不到3秒内对1兆像素的图像去卷积。     

基于光谱采样率的反卷积算法分析

反卷积方法是提高光谱仪分辨率的重要手段。采用空域迭代反卷积和频域维纳滤波对多纵模激光器光谱进行数据仿真,并在不同光谱仪采样率条件下,比较了迭代反卷积和维纳滤波结果。仿真结果表明,迭代反卷积和维纳滤波可以有效消除光谱仪仪器响应函数引起的光谱展宽,提高光谱仪分辨率。在光谱仪采样率低的情况下,迭代反卷积的分辨率增强效果优于维纳滤波。随着采样率的增加,维纳滤波的误差小于迭代反卷积。实验分别测量了单纵模和多纵模632.8nm He-Ne激光器光谱,并对测量结果进行反卷积处理。结果表明,低分辨率光谱仪测量的激光器光谱经反卷积处理后与高分辨率光谱仪直接测量结果一致。     

频域反卷积滤波器的因果性的研究

本文首先介绍了成功应用于现代时域测量中的几种频域反卷积滤波器.并说明了这些反卷积滤波器元旦是非因果的.显然,滤波器非因果化要影响反卷积的估值,因此,对反卷积滤波器进行因果化是很必要的.进而,介绍了将这些反卷积滤波器因果化原理和方法,并给出了因果化的流程图.最后,对常用的反卷积滤波器的因果化进行了仿真研究,分别给出了这些反卷积滤波器困晨化前后的滤波效果.仿真结果表明,因果化的滤波器可改善反卷积的估值.     

求取MA模型参数的预测反卷积法

本文提出一种求取MA模型参数的线性迭代算法,它利用预测模型对观测数据进行白化处理,然后再通过反卷积方法求取模型参数.本文导出了预测反卷积法(PDC)的多步迭代形式,以改进参数估计.统计分析和实验结果表明,预测反卷积法是渐近无偏,一致的算法,具有简单易求的特点.     

基于加速阻尼Richardson-Lucy算法的湍流退化图像盲复原方法

提出了一种基于加速阻尼Richardson-Lucy(ADRL)算法的湍流退化图像盲复原方法,称为ADRL-IBD方法。在阻尼Richardson-Lucy算法的基础上,引入二阶矢量外推加速技术对其进行加速,形成ADRL算法,并将该算法应用到迭代盲目反卷积(IBD)算法中。使用长曝光大气湍流光学传递函数的物理模型或根据观测图像来获取初始的点扩展函数(PSF),利用阈值分割技术获取图像目标的可靠支持域,在每一次迭代中,对图像施加支持域约束。模拟图像和实际湍流退化图像复原结果表明,基于Richardson-Lucy算法的IBD算法要优于基于Wiener滤波的IBD算法,并且ADRL-IBD算法具有较强的抗噪性,与RL-IBD算法相比,收敛速度更快,复原结果更好。     

适用于NTN校准技术的最佳滤波器

本文根据nose-to-nose校准技术的数学模型,在误差功率和平滑功率最小的条件下,推导出适用于nose-to-nose校准技术的G-N型数字反卷积最佳滤波器.又根据数字反卷积滤波器的特点,将这一结果推广到其他类型的反卷积滤波器,并给出了相应的表达式.最后,给出了这种反卷积滤波器的仿真滤波效果.     

基于加速正则化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收敛速度更快,复原效果更好。     

空间扩展目标对准误差图像的高分辨复原

大气湍流、光子噪声和光学跟踪系统对准误差严重降低了空间目标观测图像的分辨率.根据最大似然估计原理,建立了提高目标图像分辨率的多帧盲反卷积算法,用共轭梯度优化方法从目标记录图像估计出原始目标函数和点扩散函数.运用低通平滑滤波技术在算法迭代过程中逐步完成对噪声的抑制.模拟实验数据和实际图像的复原结果表明,论文建立的盲反卷积算法有效地克服了大气湍流、光子噪声和光学系统对准误差,提高了目标图像的分辨率,复原目标图像的分辨率达到了光学衍射极限的水平.     

非凸性优化与动态自适应滤波的湍流退化视频复原

针对目标探测器在大气中高速飞行时受湍流干扰,导致光学系统接收到的视频/图像产生像素偏移、模糊、信噪比降低等问题,本文对湍流退化视频/图像复原的复杂性及复原方法进行了研究,提出了一种基于非凸势函数优化与动态自适应滤波的湍流退化视频复原方法。首先,研究了湍流退化视频的求和与去模糊框架,并通过利用非刚性配准方法对刚性全局配准方法进行改进,进一步缩小了模糊核的尺度;然后,在计算机视觉的非凸优化框架下,构建了图像解卷积的非凸性算法,有效地解决了图像解卷积难题;最后,结合湍流退化视频自身特点,对超分辨率视频复原的动态自适应滤波框架进行了扩展与改进,使其适用于湍流退化视频的复原。仿真实验结果表明,本文方法的复原效果不仅有较大提升,而且实现了对湍流退化视频序列的动态自适应复原。     

Iterative image restoration using approximate inversepreconditioning

Removing a linear shift-invariant blur from a signal or image can be accomplished by inverse or Wiener filtering, or by an iterative least-squares deblurring procedure. Because of the ill-posed characteristics of the deconvolution problem, in the presence of noise, filtering methods often yield poor results. On the other hand, iterative methods often suffer from slow convergence at high spatial frequencies. This paper concerns solving deconvolution problems for atmospherically blurred images by the preconditioned conjugate gradient algorithm, where a new approximate inverse preconditioner is used to increase the rate of convergence. Theoretical results are established to show that fast convergence can be expected, and test results are reported for a ground-based astronomical imaging problem     

DECONVOLUTION IN TRANSFORM-DOMAIN FOR IMAGE DATA RESTORATION

A novel scheme for image data restoration is proposed in this letter. First, a windowfunction model is exploited to describe the data loss in images. It can change the restoration problem into deconvolution in transform-domain. Then, an iterative algorithm is presented to solve the deconvolution. Because the window-function is available to describe arbitrary shape, our algorithm is suitable for restoring irregular segment of data loss, including square-block. Finally,several simulation tests are done and results prove that the algorithm is valid.     

A segmentation-based regularization term for image deconvolution.

This paper proposes a new and original inhomogeneous restoration (deconvolution) model under the Bayesian framework for observed images degraded by space-invariant blur and additive Gaussian noise. In this model, regularization is achieved during the iterative restoration process with a segmentation-based a priori term. This adaptive edge-preserving regularization term applies a local smoothness constraint to pre-estimated constant-valued regions of the target image. These constant-valued regions (the segmentation map) of the target image are obtained from a preliminary Wiener deconvolution estimate. In order to estimate reliable segmentation maps, we have also adopted a Bayesian Markovian framework in which the regularized segmentations are estimated in the maximum a posteriori (MAP) sense with the joint use of local Potts prior and appropriate Gaussian conditional luminance distributions. In order to make these segmentations unsupervised, these likelihood distributions are estimated in the maximum likelihood sense. To compute the MAP estimate associated to the restoration, we use a simple steepest descent procedure resulting in an efficient iterative process converging to a globally optimal restoration. The experiments reported in this paper demonstrate that the discussed method performs competitively and sometimes better than the best existing state-of-the-art methods in benchmark tests.     

An EM algorithm for wavelet-based image restoration

This paper introduces an expectation-maximization (EM) algorithm for image restoration (deconvolution) based on a penalized likelihood formulated in the wavelet domain. Regularization is achieved by promoting a reconstruction with low-complexity, expressed in the wavelet coefficients, taking advantage of the well known sparsity of wavelet representations. Previous works have investigated wavelet-based restoration but, except for certain special cases, the resulting criteria are solved approximately or require demanding optimization methods. The EM algorithm herein proposed combines the efficient image representation offered by the discrete wavelet transform (DWT) with the diagonalization of the convolution operator obtained in the Fourier domain. Thus, it is a general-purpose approach to wavelet-based image restoration with computational complexity comparable to that of standard wavelet denoising schemes or of frequency domain deconvolution methods. The algorithm alternates between an E-step based on the fast Fourier transform (FFT) and a DWT-based M-step, resulting in an efficient iterative process requiring O(NlogN) operations per iteration. The convergence behavior of the algorithm is investigated, and it is shown that under mild conditions the algorithm converges to a globally optimal restoration. Moreover, our new approach performs competitively with, in some cases better than, the best existing methods in benchmark tests.     

基于盲解卷积的红外烟幕干扰图像去噪方法

介绍了多频谱红外烟幕弹爆炸后,红外热像仪所采集图像产生噪声的原因及噪声模型;并根据烟幕干扰退化图像噪声的点扩展函数难以准确描述的特性,应用频域迭代盲解卷积算法进行红外图像去噪,根据算法原理并结合烟幕干扰图像的噪声特点,对算法进行了适当的改进。实验证明,该方法去噪效果明显,有效地克服了维纳滤波等传统图像去噪方法使图像变模糊的现象,并使烟幕干扰图像的有效区域得到增强。     

高速运动目标的运动模糊图像复原研究

对单一图像进行运动模糊复原,存在模糊点扩散函数（PSF）难以估计以及图像反卷积的病态性问题。利用多个PSF具有联合可逆性的特点,针对运动目标观测,提出采用参数相同的多个成像设备共同对同一视场进行拍摄,来获取背景相同、曝光时间不同、目标模糊程度不同的观测图像;然后利用同一设备获取的序列图像进行目标的模糊PSF估计;并根据目标背景的运动模糊叠加特征,分别从观测图像中提取出完整的模糊目标图像;最后,对这些具有不同PSF的同一目标图像进行空间域迭代复原算式的联立求解。实验表明:该方法设计的目标获取装置对硬件条件要求较低,获取的图像更便于采用多点扩散函数联合进行图像复原,复原效果良好。     

Spatially adaptive wavelet-based multiscale image restoration

In this paper, we present a new spatially adaptive approach to the restoration of noisy blurred images, which is particularly effective at producing sharp deconvolution while suppressing the noise in the flat regions of an image. This is accomplished through a multiscale Kalman smoothing filter applied to a prefiltered observed image in the discrete, separable, 2-D wavelet domain. The prefiltering step involves constrained least-squares filtering based on optimal choices for the regularization parameter. This leads to a reduction in the support of the required state vectors of the multiscale restoration filter in the wavelet domain and improvement in the computational efficiency of the multiscale filter. The proposed method has the benefit that the majority of the regularization, or noise suppression, of the restoration is accomplished by the efficient multiscale filtering of wavelet detail coefficients ordered on quadtrees. Not only does this lead to potential parallel implementation schemes, but it permits adaptivity to the local edge information in the image. In particular, this method changes filter parameters depending on scale, local signal-to-noise ratio (SNR), and orientation. Because the wavelet detail coefficients are a manifestation of the multiscale edge information in an image, this algorithm may be viewed as an "edge-adaptive" multiscale restoration approach.