检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安电子科技大学模式识别与智能控制研究所,陕西西安710071
出 处:《光学学报》2008年第9期1697-1702,共6页Acta Optica Sinica
基 金:国家自然科学基金(60572151)资助课题
摘 要:传统的卡尔曼滤波算法利用批处理实现非均匀校正,这样不仅会带来较大的计算量和存储量,而且更重要的是该方法不能实时处理。为此,提出了一种基于稳态卡尔曼滤波的红外焦平面阵列非均匀校正算法,它可以根据固定图案噪声的特点离线计算出滤波器的增益矩阵,并且非均匀校正过程也采用了逐帧迭代方式,因此大大降低了计算复杂度和存储占用量。详细阐述了该算法的基本原理,并用仿真数据和真实红外数据对算法性能进行验证,实验结果表明:本方法平均校正一帧图像所需CPU时间和内存占用量分别为1.7188 s和131.25 KB,完全可以满足实时处理的要求。The traditional Kalman-filtering algorithm uses batch processing to realize nonuniformity correction, and causes high computational complexity and memory requirement, and it is more important is that it cannot realize real- time processing. For this reason, a novel nonuniformity correction algorithm based on steady-state Kalman filtering is developed, which can compute the gain matrix of the filter off line according to characteristics of fixed-pattern noise and correct images by using a frame-by-frame iteration. Therefore, this algorithm has lower computational complexity and memory requirements. The fundamental of the proposed technique is described in detail and the performance is demonstrated with both simulated and real infrared imagery. Experimental results indicate that the CPU time and memory requirements that the proposed algorithm needs to correct a frame of image are 1. 7188 s and 131.25 KB respectively, which are very suitable for real-time processing.
关 键 词:红外焦平面阵列 非均匀校正 固定图案噪声 卡尔曼滤波
分 类 号:TN215[电子电信—物理电子学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.144.41.223