低秩稀疏分解下多尺度积的运动目标检测方法

针对基于矩阵分解的运动目标检测方法易受自然场景中背景的小幅抖动和摄像头抖动等因素影响的问题,提出了一种利用多尺度积的低秩稀疏矩阵分解算法。算法假设,静态背景视频序列中,每帧图像背景可近似视为处于同一低秩子空间中,图像前景则可视为偏离低秩空间的残差部分。首先对图像序列进行滤波、仿射变换等预处理得到视频序列观测数据矩阵;然后对数据矩阵进行低秩稀疏分解得到序列图像的低秩背景部分和每帧图像的稀疏前景部分;最后对稀疏前景部分采用小波变换模极大值与多尺度积方法检测目标边缘,并进行形态学处理,得到准确的运动目标。实验结果表明,算法检测到的运动目标清晰、完整,能有效地处理光照变化、摄像头小幅度抖动、图像背景局部小幅度变化等情况下的运动目标检测。      

基于多帧湍流退化图像的近视解卷积复原

根据贝叶斯和Parseval定理,引入了频域内多帧湍流退化图像的近视解卷积复原算法。以大气湍流长曝光光学传递函数作为估计的光学传递函数。根据频域代价函数的特点,提出分步牛顿法求解代价函数。本算法能够处理未匹配的多帧图像,并能获得理想的复原图像。计算机仿真多帧湍流退化图像的复原结果表明:即使多帧图像未匹配,在不同湍流强度和不同噪声情况下算法仍能复原出好的图像效果。     

基于循环迭代的多帧湍流退化图像复原算法

采用频域多帧循环迭代解卷积算法(CIBD),针对提高复原图像的准确性和快速性两个方面进行研究。以退化序列中任意帧作为起始帧,逐次增加迭代帧,确保更多的观测帧参与循环迭代解卷积以增加复原的准确性;通过图像间的相关矩阵估计初始点扩展函数(PSF),采用尺度梯度投影法,自适应迭代步长,增加迭代终止条件等措施提高算法的收敛速度。实验结果表明,采用提议的算法能够有效地重建不同大气湍流条件下的远距离观测图像,性能优于传统多帧盲反卷积(MBD)迭代算法。     

水平路径上多帧湍流退化图像重建

为了重建水平路径上远距离成像系统获取的湍流退化图像,提出去除形变和振铃的分块多帧盲反卷积方法.首先按采集的顺序将图像序列分成若干图像组,通过B-spline基函数配准方法去除非等晕块之间的形变,第二步通过基于块的时域融合算法去除等晕块间的振铃,得到衍射受限的湍流退化图像,最后将所得的多帧图像进行频域重建,复原高质量图像.实验表明,所提出的算法适合于水平路径上获取的退化图像的重建,得到较高的主观视觉图像质量.     

联合空间信息的改进低秩稀疏矩阵分解的高光谱异常目标检测

针对低秩稀疏矩阵分解的高光谱异常目标检测算法忽略了图像的空间信息,导致检测精度低的问题,提出了一种联合空间信息的改进低秩稀疏矩阵分解的高光谱异常目标检测算法。算法综合利用了高光谱图像的光谱信号与空间信号,并与图像自身的稀疏性相结合,对经典的基于低秩稀疏矩阵分解的目标检测算法进行改进,该算法以待测像元为中心构建一定大小的空间窗,计算中心像元与邻域内其他像元的空间相似度权值和光谱相似度权值,通过计算邻域内其他像元对中心像元的比例权值得到了中心像元的重构光谱值并作差得到两者的残差矩阵;最后基于低秩稀疏矩阵分解的高光谱异常目标检测算法得到图像的稀疏矩阵,将代表异常目标信息的稀疏矩阵和残差矩阵相加并求解矩阵行向量之间的欧式距离得到像元的异常度,设置阈值,得到检测结果。为验证所提算法的检测性能,采用了真实的高光谱数据进行仿真实验,并与现有算法进行对比,结果表明该算法能够得到更高的检测精度。     

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

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

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

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

基于S1/2范数的非局部视频去噪

为了去除视频中的高斯噪声及脉冲噪声,提出了 一种基于S1/2矩阵范数的非局部视频去噪算法。 首先,在视频数据中利用非局部块匹配的钻石搜索算法搜寻与参考图像块最相似的图像块组 ;然后,将搜 寻到的相似图像块组列向量化后组合成的矩阵进行基于S1/2范数的低秩和稀疏分解,分解后 的低秩成分视 为原视频场景信息,稀疏成分视为视频中存在的随机值脉冲噪声及异常值数据;最后,由低 秩矩阵恢复的 各图像块数据经过加权平均后作为参考图像块的去噪估计值,进而求得视频各帧图像的去噪 估计值。实 验结果表明,本文方法能够有效去除视频中的高斯噪声和脉冲噪声,相比同类 算法,去噪后的视频无论 在视觉质量上还是客观评价指标上都有明显的优势。     

鲁棒主成分分析的铝箔表面缺陷检测方法

为了准确检测铝箔表面的穿孔、污点、亮斑和刮痕等各种缺陷，提出了一种基于低秩稀疏分解的铝箔图像表面缺陷检测方法。铝箔材料生产过程中表面出现缺陷的概率较小，同时一幅铝箔图像中缺陷占整幅图像的比例较小，即铝箔图像背景之间是线性相关的，可近似视为处于同一低秩子空间中，同时图像表面缺陷是近似稀疏的。采用RPCA(Robust Principal Component Analysis)算法对铝箔图像序列组成的观测数据矩阵进行低秩稀疏分解，得到低秩的背景图像和稀疏的缺陷图像。分别对单幅铝箔图像以及由多幅铝箔图像组成的图像序列进行低秩稀疏分解实验，在铝箔图像表面缺陷检测应用中验证所提方法的有效性。实验结果表明，提出方法检测到的缺陷清晰、完整，处理一幅大小为880×540的铝箔图像平均耗时不超过0.7秒，能够实现铝箔表面缺陷的实时检测。同时，算法具有较好的扩展性，能够方便地应用到其他产品的表面缺陷检测中。      

基于小波分解的湍流退化图像的快速复原算法

提出了一种基于小波分解的湍流退化图像的复原新方法．该方法以2帧同一目标的湍流退化图像作为输入，采用小波变换技术对两帧湍流退化图像进行多尺度分解．利用两个低频子频段图像的傅立叶频谱估计出两湍流点扩展函数在大尺度下的离散值，在图像的低频子频段进行去模糊，而在高频子频段则主要进行抑制噪声和保边缘特征．实验结果表明该方法十分有效，不但可以极大地减少计算复杂性，加快恢复速度，而且还可以很好地提高图像的恢复质量和抗噪能力。     

Gamma norm minimization based image denoising algorithm

Focusing on the issue of rather poor denoising performance of the traditional kernel norm minimization based method caused by the biased approximation of kernel norm to rank function,based on the low-rank theory,a gamma norm minimization based image denoising algorithm was developed.The noisy image was firstly divided into some overlapping patches via the proposed algorithm,and then several non-local image patches most similar to the current image patch were sought adaptively based on the structural similarity index to form the similar image patch matrix.Subsequently,the non-convex gamma norm could be exploited to obtain unbiased approximation of the matrix rank function such that the low-rank denoising model could be constructed.Finally,the obtained low-rank denoising optimization issue could be tackled on the basis of singular value decomposition,and therefore the denoised image patches could be re-constructed as a denoised image.Simulation results demonstrate that,compared to the existing state-of-the-art PID,NLM,BM3D,NNM,WNNM,DnCNN and FFDNet algorithms,the developed method can eliminate Gaussian noise more considerably and retrieve the original image details rather precisely.     

Motion blur kernel estimation in steerable gradient domain of decomposed image

Blind deblurring, typically underdetermined or ill-posed problem, has attracted numerous research studies over the recent years. Various priors of either the image or the blur kernel are proposed to establish various regularization models to estimate the blur kernel. And sharp edges are often employed as an important clue to recover the blur kernel. However, due to the harmful effects caused by textures and various artifacts, sharp edges are not always beneficial to the kernel estimation. To address this problem, this paper presents a step-edge based blind image deblurring algorithm using steerable gradients. The proposed algorithm adopts a coarse-to-fine multiscale framework with step-edge restoration, kernel estimation and latent image estimation. In each scale, the step-edges are detected and refined through fast image decomposition and thresholding on steerable gradients, while the kernel and latent image are estimated by minimizing the quadratic energy functionals with steerable gradients. Because each of the minimizing functional has a closed-form solution, and can be implemented by using FFTs, our algorithm is also very fast. Experimental results on both synthetic and real data demonstrate that our method outperforms most existing single image blind deblurring methods.     

凹凸范数比值正则化的快速图像盲去模糊

模糊图像可表示为清晰图像和模糊核函数的卷积,由模糊图像恢复出清晰图像,需要同时估计模糊核和清晰图像,因此是一个病态问题.优化含有先验项的代价函数是求解病态问题最有效方法之一.针对图像盲去模糊问题,本研究提出具有更强稀疏表达能力的凹凸范数比值正则化先验项,在用变量分裂法求解模型时,提出用L1范数保真项更新估计图像,在更新模糊核时,提出使用线性递增权重参数对模糊核按多尺度方法由粗到细逐步估计,当获得模糊核后,利用封闭阈值公式估计清晰图像.该方法能快速得到高质量的清晰图像,实验结果验证了模型的有效性和算法的快速性.     

结合潜在低秩分解和稀疏表示的脑部图像融合

针对低秩分解和稀疏表示(space representation,SR) 造成融合图像信息缺失的问题,提出一种结合潜在低秩分解和SR的脑部图像融合算法。首先,将源图像分解为低秩、稀疏和噪声3种成分,面对不同分解成分特性间的差异,分别构造低秩字典和稀疏字典进行描述:采用加权灰度值的方法处理低秩成分,以保持其轮廓和亮度特征;对于稀疏成分,设计一种多范数加权度量的方法对SR进行改进,以保持其高维信息,剔除噪声成分。比对当前主流的5种算法,在视觉效果和客观指标上,本文方法效果最优。     

Robust penalty-weighted deblurring via kernel adaption using single image

Image blind deconvolution is well known as a challenging, ill-posed problem due to the uncertainty of the blur kernel and the noise condition. Based on our observations, blind deconvolution algorithms tend to generate disconnected and noisy blur kernels, which would yield a serious ringing effect in the restored image if the input image is noisy. Therefore, there is still room for further improvement, especially for noisy images captured under poor illumination conditions. In this paper, we propose a robust blind deconvolution algorithm by adopting a penalty-weighted anisotropic diffusion prior. On one hand, the anisotropic diffusion prior effectively eliminates the discontinuity in the blur kernel caused by the noisy input image during the process of kernel estimation. On the other hand, the weighted penalizer reduces the speckle noise of the blur kernel, thus improving the quality of the restored image. The effectiveness of the proposed algorithm is verified by both synthetic and real images with defocused or motion blur.     

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

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

Total variation blind deconvolution

We present a blind deconvolution algorithm based on the total variational (TV) minimization method proposed by Acar and Vogel (1994). The motivation for regularizing with the TV norm is that it is extremely effective for recovering edges of images as well as some blurring functions, e.g., motion blur and out-of-focus blur. An alternating minimization (AM) implicit iterative scheme is devised to recover the image and simultaneously identify the point spread function (PSF). Numerical results indicate that the iterative scheme is quite robust, converges very fast (especially for discontinuous blur), and both the image and the PSF can be recovered under the presence of high noise level. Finally, we remark that PSFs without sharp edges, e.g., Gaussian blur, can also be identified through the TV approach.     

Efficient blind image restoration using discrete periodic Radon transform

Restoring an image from its convolution with an unknown blur function is a well-known ill-posed problem in image processing. Many approaches have been proposed to solve the problem and they have shown to have good performance in identifying the blur function and restoring the original image. However, in actual implementation, various problems incurred due to the large data size and long computational time of these approaches are undesirable even with the current computing machines. In this paper, an efficient algorithm is proposed for blind image restoration based on the discrete periodic Radon transform (DPRT). With DPRT, the original two-dimensional blind image restoration problem is converted into one-dimensional ones, which greatly reduces the memory size and computational time required. Experimental results show that the resulting approach is faster in almost an order of magnitude as compared with the traditional approach, while the quality of the restored image is similar.