一种应用于欠采样图像的自适应稀疏重建方法

针对图像稀疏重建中因使用固定参数的全变分(TV)正则项所带来的图像细节缺失和阶梯效应问题,提出了一种自适应二阶广义全变分(TGV)约束的图像稀疏重建算法.该算法采用二阶广义全变分模型权衡图像的一阶导数和二阶导数,且能够根据每次迭代得到的重构解及对应张量函数自适应地修正权重系数,实现图像的稀疏重建.与全变分正则模型和固定参数广义全变分正则模型相比,该算法能更好地保持图像轮廓和细节信息,提高重建图像的峰值信噪比(PSNR)和结构相似度(SSIM).     

基于L曲线调参的FOTV-ADMM超分辨率图像重建

基于图像高频细节的重构问题,建立了全变分(Total Variation,TV)约束重建模型,选取交替方向乘子法(Alternating Direction Method of Multipliers,ADMM)求解分析.TV-ADMM重建算法能够保持图像边缘信息,纹理细节的刻画却不够理想,图像平滑部分的重建出现阶梯效应和过平滑现象.为此,提出使用分数阶约束的模型算法FOTV-ADMM求解.该算法对图像纹理高频细节重建效果较好,能锐化图像边缘区域,同时为降低经验调节参数对图像重建的影响,减少调节参数的时间,引入L曲线调节参数,找出了正则化参数最优解.实验结果表明,基于L曲线调参的FOTV-ADMM算法能够更好地保留图像的纹理和平滑部分的细节特征,在峰值信噪比和结构相似度评价指标上,FOTV对高频细节的重建改善效果更佳.     

基于梯度保真项的低剂量CT统计迭代重建算法

针对低剂量计算机断层扫描(Computed Tomography,CT)重建图像时容易出现明显条形伪影这一现象,提出一种基于梯度保真项的低剂量CT统计迭代重建算法。该算法克服了原始全变分(Total Variation,TV)模型在抑制条形伪影和噪声的同时引入阶梯效应的缺点,首先把梯度保真约束项和能够区分图像平滑区和细节区的边缘指示函数应用到TV模型中得到基于梯度保真项的自适应全变分模型,然后再把新模型与惩罚加权最小二乘(Penalized Weighted Least Square,PWLS)重建算法相结合,使用交替方向迭代法得到最终的图像。采用Shepp-Logan模型来验证算法的有效性,实验结果表明,该算法不仅可以有效地去除条形伪影,还可以较好地保护图像的边缘和细节信息。     

基于结构组全变分模型的图像压缩感知重建

针对基于传统全变分(TV)模型的图像压缩感知(CS)重建算法不能有效地恢复图像的细节和纹理,从而导致图像过平滑的问题,该文提出一种基于结构组全变分(SGTV)模型的图像压缩感知重建算法。该算法利用图像的非局部自相似性和结构稀疏特性,将图像的重建问题转化为由非局部自相似图像块构建的结构组全变分最小化问题。算法以结构组全变分模型为正则化约束项构建优化模型,利用分裂Bregman迭代将算法分离成多个子问题,并对每个子问题高效地求解。所提算法很好地利用了图像自身的信息和结构稀疏特性,保护了图像细节和纹理。实验结果表明,该文所提出的算法优于现有基于全变分模型的压缩感知重建算法,在PSNR和视觉效果方面取得了显著提升。     

基于最佳线性估计的快速压缩感知图像重建算法

针对目前存在的压缩感知(CS)重建算法计算复杂度过高的问题,该文提出一种基于最佳线性估计的快速CS图像重建算法。该算法在编码端进行分块自适应CS随机测量,在解码端根据图像块不同的统计特性,估计出统计自相关函数矩阵,进而构造出最佳线性算子用于重建出各个图像块。由于该算法用线性投影的方式替代了传统CS重建算法的非线性迭代过程,使得其大大缩短了图像重建时间。仿真实验结果表明,对于纹理细节不复杂的图像,所提出的算法并没有因为其计算复杂度的减少而影响到重建质量,仍优于目前流行的CS重建算法。     

一种混合红外云图超分辨率重建算法

红外云图具有分辨率较低、图幅大和纹理丰富等特点。针对相关研究目前在算法效率优化和局部细节分析方面仍有不足,提出了一种混合超分辨率重建算法。该方法结合双三次插值重建方法和基于稀疏表达的重建方法在不同类型图像区域中的各自优势,利用方差将滑动窗口中的图像块区分为平坦和边缘两种类型;采用双三次插值方法重建平坦型图像块,采用基于稀疏表达的方法重建边缘型图像块。利用目视、峰值信噪比(Peak Signal-to-Noise Ratio, PSNR)以及残差图评估了算法效果。实验结果表明,本文方法在PSNR指标上比插值法平均提高了1 dB,比稀疏法也略有提升;经局部观察发现,改进重建结果中平坦区域噪声减少;该方法的重建耗时明显减少。     

自适应加权的总变分正则化图像超分辨率重建

在Farsiu提出的双边总变分正则化方法中,尺度加权系数和正则化参数为定值,在边缘、纹理区域,重建图像效果不理想。针对这个问题,提出了一种自适应加权正则化函数和正则化参数的重建算法,该方法利用图像局部结构信息控制权函数形状、带宽和正则化参数,使这些参数根据图像局部结构信息自适应地调整。对所提出的算法进行了仿真实验,实验结果表明,与传统的总变分重建方法相比较,该算法能更好地重建图像的纹理细节,重建图像的对比度高。     

基于超像素分割的红外图像细节增强算法

高动态范围的红外图像压缩和细节增强有利于提高人眼获取图像中关键细节信息的能力。因此,它是红外成像的重要研究课题之一。针对传统的全局色阶重建不能最优呈现红外图像细节层和基础层的问题,设计了对红外图像局部进行色阶重建的方案,并提出了一种基于超像素分割的红外图像动态范围压缩和细节增强方法。该方法首先采用超像素分割算法将原始红外图像分割成多个自相似子区域,然后对各个子区域进行压缩和细节增强。实验结果表明,该方法可以更有效地压缩和增强红外图像,在高动态范围压缩图像的同时能很好地保留原始图像的细节信息。     

基于RGF改进显著性检测与SCM相结合的图像融合

针对传统显著性检测融合方法中目标对比度低,纹理细节不够丰富的问题,提出了一种基于滚动导向滤波(RGF)改进显著性检测与脉冲发放皮层模型(SCM)相结合的可见光与红外图像融合算法。该算法先将源图像经过非下采样剪切波变换(NSST)分解成低频部分和高频部分,然后利用RGF小尺度消除、大尺度边缘恢复特性对Frequency Tuned算法进行改进并提取出红外图像显著图。再使用显著图投影区域指导法融合低频部分,同时采用SCM结合区域能量与改进的拉普拉斯能量和融合高频部分,最后使用逆变换重建图像。仿真结果表明,该算法能在突出显著目标的同时保留丰富的细节信息,在质量指标如标准差、互信息、边缘保留因子等方面均优于对比方法。     

一种改善图像边缘效果的POCS超分辨率重建方法

利用图像超分辨率重建(SRR)技术可以在现有成像系统基础上提高图像空间分辨力。凸集投影(POCS)是超分辨率重建的主流方法之一。对POCS算法进行了改进,具体改进体现在两个方面:(1)用可控核回归插值图像作为POCS重建的初始估计以提高初始估计图像的质量;(2)将POCS重建中使用的点扩散函数(PSF)由高斯核改为可控核以减少重建图像的边缘振荡效应。对所提出的算法进行了仿真,实验结果显示采用本文方法重建图像的边缘效果有了明显的改善。     

基于互相关的探地雷达反向投影成像算法

该文基于探地雷达(Ground Penetrating Radar, GPR)回波数据之间的互相关性,提出了一种用于抑制GPR成像中杂波干扰的反向投影(Back Projection, BP)成像算法。与标准BP算法相比,该文的互相关反向投影(Cross-correlated Back Projection, CBP)算法增加了数据间互相关运算的步骤,而且无需引入额外的参考信号通道。理论分析和实验结果均表明,CBP算法不仅抑制了标准BP算法成像结果中的杂波干扰,而且在一定程度上提高了成像分辨率。     

广义的监督局部保留投影算法

针对监督的局部保留投影算法(Supervised Locality Preserving Projection,SLPP)在小样本情况下矩阵的奇异性问题,该文提出了一种广义的监督局部保留投影算法(Generalized Supervised Locality Preserving Projection,GSLPP)。GSLPP在大样本情况下等价于SLPP,在小样本情况下却可以等价转换到一个低维空间中来求解,从而有效解决了小样本问题。最后,实验结果验证了该方法的有效性。     

基于二阶广义方向性全变分的图像超分辨率重建方法

超分辨率图像重建是增强那些低成本成像传感器系统图像分辨率的有效措施.得益于先验知识的学习,低分辨率图像可有效地被超分辨率增强.针对带有明显边缘结构的图像,现有方法没有有效利用高阶信息从而会出现一些光滑的图像细节.本文针对这种特殊的图像结构,研究一种基于二阶广义方向性全变分的重建方法来挖掘那些隐含的高阶可利用信息.二阶广义方向性全变分不仅可以作为先验知识,还能作为稀疏正则项抑制伪影和噪声.实验结果表明,本文方法可有效超分辨率重建结构边缘图像,并可获得高分辨率图像细节和纹理特征.     

Clustering via dimensional reduction method for the projection pursuit based on the ICSA

The performance of the classical clustering algorithm is not always satisfied with the high-dimensional datasets, which make clustering method limited in many application. To solve this problem, clustering method with Projection Pursuit dimension reduction based on Immune Clonal Selection Algorithm (ICSA-PP) is proposed in this paper. Projection pursuit strategy can maintain consistent Euclidean distances between points in the low-dimensional embeddings where the ICSA is used to search optimizing projection direction. The proposed algorithm can converge quickly with less iteration to reduce dimension of some high-dimensional datasets, and in which space, K-mean clustering algorithm is used to partition the reduced data. The experiment results on UCI data show that the presented method can search quicker to optimize projection direction than Genetic Algorithm (GA) and it has better clustering results compared with traditional linear dimension reduction method for Principle Component Analysis (PCA).     

A NEW APPROACH FOR UNSUPERVISED RESTORING IMAGES BASED ON WAVELET-DOMAIN PROJECTION PURSUIT LEARNING NETWORK

The Wavelet-Domain Projection Pursuit Learning Network (WDPPLN) is proposed for restoring degraded image. The new network combines the advantages of both projection pursuit and wavelet shrinkage. Restoring image is very difficult when little is known about a priori knowledge for multisource degraded factors. WDPPLN successfully resolves this problem by separately processing wavelet coefficients and scale coefficients. Parameters in WDPPLN,which are used to simulate degraded factors, are estimated via WDPPLN training, using scale coefficients. Also, WDPPLN uses soft-threshold of wavelet shrinkage technique to suppress noise in three high frequency subbands. The new method is compared with the traditional methods and the Projection Pursuit Learning Network (PPLN) method. Experimental results demonstrate that it is an effective method for unsupervised restoring degraded image.     

基于后向投影变换的进动旋转对称目标成像新方法

弹道中段目标成像技术是弹道导弹防御系统的核心技术之一。由于弹道导弹中段飞行过程中具有空间进动形式,不满足小转角近似,导致RD算法成像模糊。该文提出一种进动旋转对称目标的宽带雷达成像方法,新方法通过后向投影变换将目标散射中心分布在距离时间域上的复数信号进行相干累加,实现目标散射中心的2维重构,该方法较广义Radon变换方法在抑制旁瓣性能上有较大的改进,利用暗室测量数据的实验结果验证了算法的有效性。     

A sparse projection clustering algorithm

A clustering algorithm based on Sparse Projection (SP), called Sparse Projection Clus- tering (SPC), is proposed in this letter. The basic idea is applying SP to project the observed data onto a high-dimensional sparse space, which is a nonlinear mapping with an explicit form and the K-means clustering algorithm can be therefore used to explore the inherent data patterns in the new space. The proposed algorithm is applied to cluster a complete artificial dataset and an incomplete real dataset. In comparison...     

基于几何校正的聚束SAR快速分级后投影算法

快速分级后投影(Fast Factorized Back Projection, FFBP)算法大幅减少了原始后投影算法的插值次数,提升运算效率。然而图像合成过程中仍然需要大量的图像域2维插值操作,庞大的计算量限制了其在实际中的应用。该文提出一种基于几何校正的聚束SAR快速分级后投影算法。该算法利用几何校正的方法实现子图像配准,即在满足聚焦性能的前提下,通过距离维平移和角度维旋转完成子图像在不同坐标系下的投影和子图像合成。该算法避免了逐点插值运算,进一步降低了FFBP算法的计算量。仿真结果表明,该算法能高精度聚焦成像,并且其运算效率相对于基于图像域2维插值的FFBP算法显著提高。     

Curvature preserving image super-resolution with gradient-consistency-anisotropic-regularization prior

Single image super-resolution (SR) often suffers from annoying interpolation artifacts such as blur, jagged edges, and ringing. In this paper, we aim to achieve artifact-free SR reconstruction from an input low resolution (LR) image using adaptive de-convolution and curvature refinement. To achieve this, we propose a curvature preserving image SR method based on a gradient-consistency-anisotropic-regularization (GCAR) prior. The gradient consistency term effectively suppresses visual artifacts such as ringing and preserves sharp edges in images while the anisotropic regularization term adaptively preserves the high frequency information according to the gradient magnitude. The complementary two terms are elaborately combined into the GCAR prior for the SR reconstruction. The GCAR prior is very effective in preserving image details and recovering high frequency information. Moreover, we use curvature refinement to remove jagged artifacts caused by aliasing due to decimation. The proposed method employs an effective feedback-control loop which contains adaptive de-convolution, re-convolution, pixel substitution, and curvature refinement. The GCAR prior is utilized in the adaptive de-convolution step. Extensive experiments on various test images demonstrate that the proposed method produces natural-looking and artifact-free SR results in terms of both visual quality and quantitative performance.     

High-quality non-blind image deconvolution with adaptive regularization

Non-blind image deconvolution is a process that obtains a sharp latent image from a blurred image when a point spread function (PSF) is known. However, ringing and noise amplification are inevitable artifacts in image deconvolution since perfect PSF estimation is impossible. The conventional regularization to reduce these artifacts cannot preserve image details in the deconvolved image when PSF estimation error is large, so strong regularization is needed. We propose a non-blind image deconvolution method which preserves image details, while suppressing ringing and noise artifacts by controlling regularization strength according to local characteristics of the image. In addition, the proposed method is performed fast with fast Fourier transforms so that it can be a practical solution to image deblurring problems. From experimental results, we have verified that the proposed method restored the sharp latent image with significantly reduced artifacts and it was performed fast compared to other non-blind image deconvolution methods.