Compressive near-field millimeter wave imaging algorithm based on Gini index and total variation mixed regularization

A compressive near-field millimeter wave(MMW)imaging algorithm is proposed.From the compressed sensing(CS)theory,the compressive near-field MMW imaging process can be considered to reconstruct an image from the under-sampled sparse data.The Gini index(GI)has been founded that it is the only sparsity measure that has all sparsity attributes that are called Robin Hood,Scaling,Rising Tide,Cloning,Bill Gates,and Babies.By combining the total variation(TV)operator,the GI-TV mixed regularization introduced compressive near-field MMW imaging model is proposed.In addition,the corresponding algorithm based on a primal-dual framework is also proposed.Experimental results demonstrate that the proposed GI-TV mixed regularization algorithm has superior convergence and stability performance compared with the widely used l1-TV mixed regularization algorithm.

Image decomposition and staircase effect reduction based on total generalized variation

Total variation （TV） is widely applied in image process-ing. The assumption of TV is that an image consists of piecewise constants, however, it suffers from the so-cal ed staircase effect. In order to reduce the staircase effect and preserve the edges when textures of image are extracted, a new image decomposition model is proposed in this paper. The proposed model is based on the to-tal generalized variation method which involves and balances the higher order of the structure. We also derive a numerical algorithm based on a primal-dual formulation that can be effectively imple-mented. Numerical experiments show that the proposed method can achieve a better trade-off between noise removal and texture extraction, while avoiding the staircase effect efficiently.

Total Variation Constrained Non-Negative Matrix Factorization for Medical Image Registration

This paper presents a novel medical image registration algorithm named total variation constrained graphregularization for non-negative matrix factorization(TV-GNMF).The method utilizes non-negative matrix factorization by total variation constraint and graph regularization.The main contributions of our work are the following.First,total variation is incorporated into NMF to control the diffusion speed.The purpose is to denoise in smooth regions and preserve features or details of the data in edge regions by using a diffusion coefficient based on gradient information.Second,we add graph regularization into NMF to reveal intrinsic geometry and structure information of features to enhance the discrimination power.Third,the multiplicative update rules and proof of convergence of the TV-GNMF algorithm are given.Experiments conducted on datasets show that the proposed TV-GNMF method outperforms other state-of-the-art algorithms.

Dark channel prior based blurred image restoration method using total variation and morphology

The blurred image restoration method can dramatically highlight the image details and enhance the global contrast, which is of benefit to improvement of the visual effect during practical ap- plications. This paper is based on the dark channel prior principle and aims at the prior information absent blurred image degradation situation. A lot of improvements have been made to estimate the transmission map of blurred images. Since the dark channel prior principle can effectively restore the blurred image at the cost of a large amount of computation, the total variation （TV） and image morphology transform （specifically top-hat transform and bottom- hat transform） have been introduced into the improved method. Compared with original transmission map estimation methods, the proposed method features both simplicity and accuracy. The es- timated transmission map together with the element can restore the image. Simulation results show that this method could inhibit the ill-posed problem during image restoration, meanwhile it can greatly improve the image quality and definition.

Novel image restoration model coupling gradient fidelity term based on adaptive total variation

A novel image restoration model coupling with a gradient fidelity term based on adaptive total variation is proposed in this paper. In order to choose proper parameters, the selection criteria were analyzed theoretically, and a simple scheme to demonstrate its validity was adopted experimentally. To make fair comparisons of performances of three models, the same numerical algorithm was used to solve partial differential equations. Both the international standard test image on Lena and HR image of CBERS-02B of Dalian city were used to verify the performance of the model. Experimental results illustrate that the new model not only preserved the edge and important details but also alleviated the staircase effect effectively.

Multiquadric Radial Basis Function Approximation Scheme for Solution of Total Variation Based Multiplicative Noise Removal Model

This article introduces a fastmeshless algorithm for the numerical solution nonlinear partial differential equations(PDE)by Radial Basis Functions(RBFs)approximation connected with the Total Variation(TV)-basedminimization functional and to show its application to image denoising containing multiplicative noise.These capabilities used within the proposed algorithm have not only the quality of image denoising,edge preservation but also the property of minimization of staircase effect which results in blocky effects in the images.It is worth mentioning that the recommended method can be easily employed for nonlinear problems due to the lack of dependence on a mesh or integration procedure.The numerical investigations and corresponding examples prove the effectiveness of the recommended algorithm regarding the robustness and visual improvement as well as peak-signal-to-noise ratio(PSNR),signal-to-noise ratio(SNR),and structural similarity index(SSIM)corresponded to the current conventional TV-based schemes.

稀疏角度CT图像重建的Huber-TV正则化方法

对于稀疏角度下的投影数据,计算机断层扫描重建图像容易出现分辨率低、伪影较多的问题,难以满足工业及医学诊断要求。文中从迭代重建的角度出发,提出一个结合全变分(TV)和Huber函数(Huber-TV)的CT重建方法。该方法利用Huber函数替代传统全变分模型中的L1范数,在合理控制函数阈值的条件下,充分利用Huber函数的线性部分对大于阈值的梯度图像进行较轻的惩罚,以保持图像边缘连续性;再结合二次项对小于阈值的梯度图像进行较大的惩罚,以抑制图像中不连续梯度跳跃。新模型目标函数的光滑性可以使得梯度下降法快速收敛到最优值,避开传统全变分模型中的次梯度计算,从而降低计算复杂度并加快迭代速度。实验结果表明,在稀疏角度重建条件下,与传统TV模型相比,Huber-TV模型的均方根误差降低19%,信噪比提升22.33 dB,说明所提方法高效可行。

利用VMD-SSA-LSTM的电离层总电子含量预报研究

针对太阳活动影响下机器学习模型对电离层总电子含量(TEC)短期预报精度不高的问题,本文提出了一种基于变分模态分解(VMD)、麻雀搜索算法(SSA)、长短期记忆神经网络(LSTM)的组合模型(VMD-SSA-LSTM),以期提高TEC短期预报精度。利用VMD算法对不同时期太阳活动程度影响下的东、西半球TEC格网点数据分解,利用SSA优化LSTM模型,将分解的TEC样本分量及模型最优初始权值和阈值输入到LSTM模型中,将分量预测序列合并重构,得到电离层TEC预测值。实验表明:VMD-SSA-LSTM组合模型在东、西半球太阳活动强烈、适中、较弱时期的均方根误差分别为0.77、0.56、0.69;0.92、0.76、0.73个TECu,平均绝对误差平均值分别为0.69、0.47、0.56;0.79、0.65、0.58个TECu,平均相对精度分别达到94%、94%、93%;93%、91%、91%以上,残差绝对值分布在0~1个TECu的比例均值分别为75.56%、96.11%、85%;74.44%、80.55%、78.33%,较VMD-LSTM、LSTM两种模型预报精度有显著提升。

基于TV约束和Toeplitz矩阵分解的波阻抗反演

利用波阻抗剖面的非高斯分布特点以及地震子波褶积矩阵的Toeplitz结构,对波阻抗剖面进行全变分(TV)约束,可以在压制随机噪声的同时保持剖面的不连续性,对地震子波褶积矩阵进行Toeplitz稀疏矩阵分解得到地震子波的稀疏表达。地震资料的低频损失导致无法反演出波阻抗的低频背景,故将测井或解释层位信息通过最小二乘法建立约束条件。建立的约束最优化目标函数可以同时反演子波和波阻抗。文中将地震剖面整体处理,反演结果比常规的逐道反演具有更高的精度、横向连续性和抗噪性。

基于TV模型的改进算法在图像修复中的应用

基于TV(total variation)模型的修复算法有较好的恢复效果,但对参数的选取比较敏感,且运算量大。文章提出了基于TV模型的改进的自适应算法,可根据破损区域外部参考像素对待修补点的相关度,通过设置不同的参数和权值,将不同形状的待修复区域所用的不同算法统一表示,使其应用范围更广、速度更快;此外,在迭代过程中,设置不同的参数以解决参数选取的敏感问题,从而达到更好的修复效果。实验表明,该算法能高效、稳定地处理破损区域的图像信息。

综合自适应阈值与多尺度的TV图像修复方法

基于TV模型的图像修复算法具有较好的修复效果,但其对参数的选取较敏感,且运算量较大。该文提出了一种综合自适应阈值与多尺度的TV图像修复算法,该方法不仅可以提高TV图像修复模型的修复稳定性,还可以进一步压缩运算量,提高修复速度。

改进TV复原模型的彩色-灰度图像变换方法

针对彩色图像到灰度图像的变换这一问题,提出了一种新的基于TV(全变分)复原模型的新方法。利用Sapiro等所提出的矢量图像的水平集概念,结合全变分复原,建立新的变换模型,实现算法。实验表明,所提方法实现的彩色一灰度图像变换,不仅很好地解决了原来传统变换不能保持形状的问题,并且能解决Sapiro等所提出方法的边缘模糊化缺点,使变换后图像的边缘锐利程度得到了较大的提高。

基于ADMM的TV图像重建算法研究:设计、实现及评估

稀疏重建是当前CT(computed tomography)领域的研究热点,其实质是用稀疏视角下的投影来重建图像,以减少扫描过程中对病患的辐射剂量。随着压缩感知理论的提出,稀疏重建算法已经被广泛应用到了医学CT中。TV(total variation)算法是可以实现稀疏重建的一种有效方法。本文设计了一种基于ADMM(alternating direction method of multipliers)的TV算法,先将非约束的优化问题转换为约束形式,然后引入乘子,最后通过交替方向法实现迭代过程。该方法将复杂的优化问题分解为了若干个具有闭合形式的子优化问题,故迭代速度较快。仿真实验表明,与传统的滤波反投影算法相比,该算法可以实现稀疏角度下的高精度图像重建。同时还初步探讨了平衡因子在不同噪声情形下对重建精度的影响。

基于自适应中值滤波器和TV修复的椒盐噪声去除(英文)

提出一种两步式椒盐噪声去除方法.第一步利用自适应中值滤波器来识别出被噪声污染的候选点;第二步利用一种边缘保持技术(全变差图像修复)来恢复出被噪声污染的点.由于椒盐噪声点的灰度值和原始像素灰度独立,所以在采用恢复技术时不使用噪声点自身的灰度信息.在噪声率不很高的情况下,这种方法可以获得比现有最好方法更高的信噪比;当噪声率高达70%以上时,该方法的信噪比与现有方法非常接近,但是主观视觉效果(例如边缘保持能力)更佳.

基于TV与SSIM的图像质量评价方法

提出一种基于全变分(TV)模型与结构相似度(SSIM)的图像质量评价方法。对待评价图像进行主动定量加噪,得到降质图像,利用自适应的TV去噪模型得到消噪图像,采用SSIM方法对待评价图像与消噪图像进行全参考评价,得到待评价图像的无参考评价指标。采用标准测试图像和LIVE库的降质图像进行实验,结果表明,该方法可在无参考图像的条件下对图像质量进行评估,评价结果与主观评价结果具有较高的一致性。

自适应Snake-TV模型在彩色图像修复中的应用

文章在整体变分模型(TV)的基础上引入蛇(Snake)模型,同时考虑待修复区域的形状,提出了自适应Snake-TV模型,并将其应用到灰度图像和彩色图像的修复,该模型能很好地保持图像的视觉连通性。试验结果表明:该算法在迭代次数相同的条件下修复彩色图像的效果比TV模型好得多;与Snake-CDD模型相比,修复效果更好,同时所用时间也大大减少。

基于Chambolle-Pock算法的TV重建方法研究

为实现CT稀疏视角下的投影图像重建,Sidky等设计了基于Chambolle-Pock(CP)算法,论文在此基础上实现了CP算法。仿真实验表明,与传统的滤波反投影算法相比,CP算法不存在伪影,在含噪情况下,CP算法具有较好的性能,可以实现稀疏角度下的高精度图像重建。同时,探讨了平衡因子的选取对重建精度的影响。

DART-TV:高精度离散断层图像重建算法

本文提出了一种基于离散代数迭代(DART)和全变差(TV)最小化的高精度图像重建算法,即DART-TV。该算法适用于工业CT辅助制造中对于单一材料物体的尺寸检测,特别是在物体对某些角度无法被穿透的情况。传统的CT重建算法如FBP或ART无法有效处理这类数据缺失的病态问题,重建图像分辨率差。本文提出的算法的核心思想是:(1)利用DART的结果限制重建物体的支撑域,改善问题的病态性;(2)迭代过程中施加TV约束,以抑制噪声;(3)每次迭代后自动更新支撑域,不断逼近真实解,使得图像边缘更加清晰。初步的模拟结果和实验结果显示,DART-TV算法在有限角情况下可以得到更精确的重建图像边缘,并且该算法对于投影噪声和灰度值估计误差有更好的鲁棒性,可以应用于实际工程。

去除阶梯效应的TV+H^1+H^0变分分解模型

针对基于全变分(Total Variation,TV)极小的变分分解中,结构分量中容易出现阶梯现象而降低图像视觉效果的缺点,提出了一个去除阶梯效应的TV+H1+H0变分分解模型。新模型分别采用TV刻画结构分量的分片常值,采用H1半范数刻画分片光滑,则图像结构被看成是TV分量与H1分量之和。由于新的结构中包含了分片光滑的H1分量,所以可以一定程度去除阶梯现象。理论证明了模型的解的非平凡性,并且采用交替迭代算法对模型进行了数值求解。实验中以噪声人造图像和自然图像为实验对象,将分解模型应用到图像去噪,相对于经典的ROF模型和PVD模型,新模型取得了明显的优势。