基于双非凸约束的遥感图像高密度条带去除算法  

High density stripe removal algorithm based on double non-convex constraints for remote sensing images

作　　者：孔祥阳[1,2] 徐保根 李传伟[2] 赵家林[2] KONG Xiangyang;XU Baogen;LI Chuanwei;ZHAO Jialin(School of Automation,Northwestern Polytechnical University,Xi’an 710072,China;Department of Basic Education,Sichuan Engineering Technical College,Deyang 618000,China;School of Science,East China Jiaotong University,Nanchang 330013,China)

机构地区：[1]西北工业大学自动化学院,陕西西安710072 [2]四川工程职业技术学院基础教学部,四川德阳618000 [3]华东交通大学理学院,江西南昌330013

出　　处：《传感器与微系统》2021年第6期114-117,共4页Transducer and Microsystem Technologies

基　　金：国家自然科学基金资助项目(11361024,11961026)。

摘　　要：针对去除高密度遥感图像条带时残留较多且易产生块效应的问题,通过分析条带和干净图像的特征,提出一种新的条带分离方法。条带的稀疏性既存在于在空间域又存在于梯度域,因此,对条带在空间域和梯度域进行非凸L0范数约束,同时采用L1范数约束干净图像的空间域连续性特征。该非凸模型可以通过均衡约束数学规划(MPEC)将其转化为凸优化问题并进行快速求解。实验结果表明:所提算法可以去除高浓度条带噪声的同时,较好地保留原图像的结构和细节信息,而且在峰值信噪比(PSNR)和结构相似性指数(SSIM)指标上显著优于当前最优秀的算法。Aiming at the problem that there are still much residues and block effect when removing high-density remote sensing image stripes, a new stripe separation method is proposed.The sparsity of stripe exists both in the spatial domain and gradient domain.Therefore, non-convex L0 norm constraint is applied to stripe sparsity in spatial domain and gradient domain, and L1 norm is adopted for constraining spatial continuity of clean images.The proposednon-convex model can be transformed into a convex optimization problem by mathematical programming of equilibrium constraint(MPEC) and solved quickly.The experimental results show that the proposed algorithm can remove high-density stripe noise, while retaining the structure and detail information of the original image, and is significantly prior to the state-of-art algorithms in terms of peak noise ratio(PSNR) and structural similarity index(SSIM).

关 键 词：遥感图像去条带 非凸优化 均衡约束的数学规划 峰值信噪比 结构相似性指数 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]