基于IECM特征匹配的红外弱点目标快速检测算法

提出了一种新的复杂背景下低信噪比红外弱点目标检测算法。根据红外弱点目标在图像中的三维空间特征,从空间认知的角度出发,将三维的灰度分布特征转化为二维的等高线曲线特征,建立红外图像的等高线图(IECM)描述,利用图论中的树结构(等高线树)形式化地表达等高线的空间关系,在此基础上,给出弱点目标检测的等高线树检测准则,同时给出了等高线划分等级的选择方法。理论分析与实验结果表明,该算法具有良好的检测性能,且结构简单,利于硬件实时实现。在信噪比为1.4的情况下,对红外图像序列的检测概率为96.3%。     

AKAZE结合自适应局部仿射匹配的视差图像特征匹配算法

针对常用的图像特征匹配算法对具有视差的图像在图像特征匹配阶段会产生大量误匹配点的问题,提出了一种AKAZE（accelerated-KAZE）算法结合自适应局部仿射匹配的特征匹配算法。首先,采用AKAZE算法提取特征点;接着,采用二进制描述符M-LDB(modified-local difference binary)进行描述并进行暴力匹配产生粗匹配点对;最后,基于图像的仿射变换可以提供较强的几何约束这一特性,采用自适应局部仿射匹配完成精匹配。实验结果表明,该算法针对具有旋转变化、尺度变化、视角变化的图像匹配,具有提取特征点均匀、匹配准确等效果,提取的正确特征点数量分别平均相对于SIFT算法提升了1.66倍、SURF算法提升了1.08倍、ORB算法提升了6.92倍、GMS算法提升了1.23倍,能够满足具有较大视差图像匹配的需求。     

A new adaptive contrast enhancement algorithm for infrared images based on double plateaus histogram equalization

In infrared images, detail pixels are easily immerged in large quantity of low-contrast background pixels. According to these characteristics, an adaptive contrast enhancement algorithm based on double plateaus histogram equalization for infrared images was presented in this paper. Traditional double plateaus histogram equalization algorithm used constant threshold and could not change the threshold value in various scenes, so that its practical usage is limited. In the proposed algorithm, the upper and lower threshold value could be calculated by searching local maximum and predicting minimum gray interval and be updated in real time. With the proposed algorithm, the background of infrared image was constrained while the details could also be enhanced. Experimental results proved that the proposed algorithm can effectively enhance the contrast of infrared images, especially the details of infrared images.     

Rapid matching algorithm for hyperspectral image based on norm sifting

We propose a rapid spectral matching method by lowering number of comparisons, processing time can be saved. Firstly, 1-norm is chosen as length measure of spectrum, and with this criterion, a 1-norm database is built. Secondly, a subspace is constructed from the whole reference library by retaining the references with the most similar 1-norm values. Finally, matching operations are performed in the subspace to obtain the match result. Simulations of geological mapping with ASTER spectral library show that the proposed method can significantly reduce processing time and enhance accuracy compared with traditional and dimension reduction methods.     

一种基于自适应权值的立体匹配方法

提出了一种新的自适应权值的立体匹配方法,在匹配中无需逐像素确定其支持窗口的尺寸。首先根据像素间的相似性和邻近性对匹配窗口内每一像素的支持权值进行调整,使与待匹配点位于同一区域的像素权值增大,然后在匹配的代价函数中引入视差平滑性约束项,从而获得最终视差。在Middlebury提供的标准图像上进行了测试。实验结果表明,该方法可以获得良好的视差图。     

自适应多方向灰度形态学图像边缘检测算法

针对传统的多方向灰度形态学边缘检测算法存在计算量大、效率低的缺点,提出了一种基于自适应噪声抑制的多方向灰度形态学图像边缘检测算法。根据图像所含噪声的种类,采用不同尺度的结构元素对图像进行分类滤波,再根据像素点间灰度值的变化确定边缘方向,由相应方向的结构元素进行边缘检测。实验结果表明,与传统的多方向灰度形态学边缘检测算法相比,检测到的边缘重构相似度和边缘置信度更高,边缘连续性更强,且计算量低,运行效率高。     

基于灰度相关的图像匹配算法的改进

针对目前图像匹配算法中存在的匹配精度不高和匹配速度慢的缺点，对基于灰度相关的2类匹配算法——最小误差法和相关系数法进行了改进。最小误差法采用新的ML距离法，提出动态调整阈值的方法，既保证了匹配精度，又避免了局部噪声的影响；相关系数法对相关系数的计算公式进行了简化，并采用三步搜索策略进行匹配，以达到减少计算量和搜索位置的目的。实验证明：改进后的算法，在保证一定匹配精度的条件下，匹配速度大大提高，能够满足实际应用中的实时性要求。     

一种基于灰度变换的红外图像增强算法

针对红外图像，采用双门限分割法进行图像分割，然后采用分段灰度变换法进行图像增强。根据具体图像，通过人机交互的方式确定2个阈值，将图像分割为目标区、过渡区和背景区3部分；按照每一部分的特点，设计不同的灰度变换，对图像进行分段线性增强，得到感兴趣目标区的最佳视觉效果。通过对16位红外图像进行实验，得到了满意的结果。实验表明,该算法灵活便捷，在增加对比度和去除噪声的同时，还抑制了背景，达到了预期的效果。     

一种基于稀疏编码空间金字塔匹配的图像分类算法

图像分类技术是近年来计算机视觉领域中的研究热点,在移动互联网领域中取得了成功应用。提出了一种基于稀疏编码空间金字塔匹配的图像分类算法。该方法首先对图像的SIFT特征进行稀疏编码,替代了传统的矢量量化方法,可以有效降低量化误差,构建更为准确的图像表征方式,然后结合空间金字塔匹配算法采用线性分类器对图像进行分类识别。在标准测试图像数据库上的实验结果表明,相比BOF和SPM方法,该算法可以将图像分类准确率提高4%~12%。     

Nonuniformity correction algorithm based on adaptive filter for infrared focal plane arrays

Response nonuniformity is a key problem that influences the imaging performance of infrared focal plane arrays (IRFPA) imaging system. A parallel processing algorithm to adaptively estimate the nonuniformity correction (NUC) parameters for IRFPA is presented. In this algorithm, a bank of the adaptive filter is applied to adaptively estimate the NUC parameters for every detector in IRFPA. The infrared image sequences are input into the bank of adaptive filter. After certain times recursion calculations are executed frame-by-frame, then the optimal coefficients of the gain and the offset of detector in IRFPA are achieved. Then the NUC is fulfilled ultimately. The algorithm reduces the influence that the response drift with time imposed on NUC effectively, and achieves good NUC effect. It was validated by real experimental imaging procedures.     

An infrared salient object stereo matching algorithm based on epipolar rectification

Due to the higher noise and less details in infrared images, general matching algorithms are prone to obtaining unsatisfying results. Combining the idea of salient object, we propose a novel infrared stereo matching algorithm which applies to unconstrained stereo rigs. Firstly, we present an epipolar rectification method introducing particle swarm optimization and K-nearest neighbor to deal with the problem of epipolar constraint. Then we make use of transition region to extract salient object in the rectified infrared image pairs. Finally, disparity map is generated by matching salient regions. Experiments show that our algorithm deals with the infrared stereo matching of unconstrained stereo rigs with better accuracy and higher speed.     

Variational infrared image enhancement based on adaptive dual-threshold gradient field equalization

Infrared images are characterized by low signal to noise ratio (SNR) and fuzzy texture edges. This article introduces the variational infrared image enhancement algorithm based on gradient field equalization with adaptive dual thresholds. Firstly, we transform the image into gradient domain and get the gradient histogram. Then, we do the gradient histogram equalization. By setting adaptive dual thresholds to qualify the gradients, the image is prevented from over enhancement. The total variation (TV) model is adopted in the reconstruction of the enhanced image to suppress noise. It is shown from experimental results that the image edge details are significantly enhanced, and therefore the algorithm is qualified for enhancement of infrared images in different applications.     

基于自适应侧抑制网络的红外弱小目标检测

 为了提高远距离红外弱小目标的检测效率,提出了一种基于自适应侧抑制网络的复杂背景下的红外弱小目标检测方法。该方法建立了改进的侧抑制网络数学模型,利用各向异性滤波来自适应地确定侧抑制网络的抑制系数,不需要人为干预,实现了侧抑制网络与各向异性高斯滤波的有机结合。同时,在各向异性高斯滤波器两轴确定方面进行了改进,两轴分别采用对比度尺度模型和强度尺度传播模型来独立确定。通过与传统弱小目标检测方法的对比实验,验证了方法的有效性。     

基于自适应侧抑制网络的红外弱小目标检测

为了提高远距离红外弱小目标的检测效率,提出了一种基于自适应侧抑制网络的复杂背景下的红外弱小目标检测方法。该方法建立了改进的侧抑制网络数学模型,利用各向异性滤波来自适应地确定侧抑制网络的抑制系数,不需要人为干预,实现了侧抑制网络与各向异性高斯滤波的有机结合。同时,在各向异性高斯滤波器两轴确定方面进行了改进,两轴分别采用对比度尺度模型和强度尺度传播模型来独立确定。通过与传统弱小目标检测方法的对比实验,验证了方法的有效性。     

一种基于小波分析的唐卡图像划痕检测

唐卡图像在其保存和搬运过程中较易出现细微的划痕,针对所出现的垂直(水平)划痕进行了自动检测算法研究。垂直(水平)划痕实质上属于特殊的边缘,首先利用该特性采用小波模极大值描述图像中目标的多尺度边界;然后再通过投影变换放大划痕中心的亮度极值特性,并基于多尺度突变点检测找到划痕的位置;最终采用标注联通分量、设置高度和宽度约束得到划痕的掩膜。实验结果表明,利用该方法取得了较好的检测效果。     

基于自适应扩散模型的单帧红外条纹非均匀性校正算法

针对红外焦平面成像系统存在列向条纹非均匀性的现象,采用了一种基于自适应PM扩散模型的非均匀校正新算法。首先,综合利用图像梯度信息和局部灰度统计信息,自适应计算PM模型的扩散阈值;然后将每列像素的PM模型估计值作为该列像素的期望值;最后采用最陡下降法迭代计算得到每列像元的校正参数,并对结果进行循环校正以提高校正效果。实验结果表明:该算法可以保护图像边缘信息,与同类算法相比,能够更有效地抑制条纹非均匀性,并且能够防止图像产生鬼影。     

基于局部光流约束的角点匹配算法

提出了一种基于局部光流约束的角点匹配算法。首先采用Harris算子获得当前帧和参考帧的角点,然后以角点的光流特征作为约束条件,根据两帧图像角点集的坐标分布,排除异常角点,完成角点的精确匹配,实现图像之间的高精度运动估计。通过对视频序列进行实验,采用差图法可主观地发现该运动估计算法的有效性;以峰值信噪比作为评价指标,发现原始视频序列的帧间峰值信噪比明显低于仿射视频序列的帧间峰值信噪比。前者的平均值为22.8072,后者的平均值为33.3854,从而客观地说明了该算法的有效性和稳定性。     

基于图像分离块操作的快速模板匹配跟踪算法

传统的模板匹配跟踪算法存在运算量大和实时性差的缺陷,限制了它的应用范围。针对这一问题,在已有的基于位置预测相关跟踪算法的基础上,提出了利用图像分离块操作对相关跟踪算法进行改进,进一步减少相关跟踪算法的计算量,以满足系统的实时性要求。对改进算法进行了模拟仿真实验验证。仿真结果表明：该改进算法不仅在很大程度上减少了计算量,提高了跟踪系统的实时性,而且能够有效地减少随机噪声的影响,使得跟踪更加快速准确。     

An image joint compression-encryption algorithm based on adaptive arithmetic coding

Through a series of studies on arithmetic coding and arithmetic encryption, a novel image joint compression- encryption algorithm based on adaptive arithmetic coding is proposed. The contexts produced in the process of image compression are modified by keys in order to achieve image joint compression encryption. Combined with the bit-plane coding technique, the discrete wavelet transform coefficients in different resolutions can be encrypted respectively with different keys, so that the resolution selective encryption is realized to meet different application needs. Zero-tree coding is improved, and adaptive arithmetic coding is introduced. Then, the proposed joint compression-encryption algorithm is simulated. The simulation results show that as long as the parameters are selected appropriately, the compression efficiency of proposed image joint compression-encryption algorithm is basically identical to that of the original image compression algorithm, and the security of the proposed algorithm is better than the joint encryption algorithm based on interval splitting.     

An image compressed sensing algorithm based on adaptive nonlinear network

Traditional compressed sensing algorithm is used to reconstruct images by iteratively optimizing a small number of measured values. The computation is complex and the reconstruction time is long. The deep learning-based compressed sensing algorithm can greatly shorten the reconstruction time, but the algorithm emphasis is placed on reconstructing the network part mostly. The random measurement matrix cannot measure the image features well, which leads the reconstructed image quality to be improved limitedly. Two kinds of networks are proposed for solving this problem. The first one is Recon Net's improved network IRecon Net, which replaces the traditional linear random measurement matrix with an adaptive nonlinear measurement network. The reconstruction quality and anti-noise performance are greatly improved.Because the measured values extracted by the measurement network also retain the characteristics of image spatial information, the image is reconstructed by bilinear interpolation algorithm(Bilinear) and dilate convolution. Therefore a second network USDCNN is proposed. On the BSD500 dataset, the sampling rates are 0.25, 0.10, 0.04, and 0.01, the average peak signal-noise ratio(PSNR) of USDCNN is 1.62 d B, 1.31 d B, 1.47 d B, and 1.95 d B higher than that of MSRNet. Experiments show the average reconstruction time of USDCNN is 0.2705 s, 0.3671 s, 0.3602 s, and 0.3929 s faster than that of Recon Net. Moreover, there is also a great advantage in anti-noise performance.