液晶与显示, 2016, 31 (2): 179, 网络出版: 2016-03-22  

低复杂度Bayer图像色彩重建算法

Low complexity demosaicing algorithm for Bayer pattern image
作者单位
1 中国科学院 长春光学精密机械与物理研究所, 吉林 长春 130033
2 中国科学院大学, 北京 100049
摘要
针对Bayer图像色彩重建效果越好的算法需要越多计算量, 占用越多硬件资源问题, 提出了一种低复杂度的色彩重建算法。首先使用Hamilton-Adam (H-A)算法对Bayer图像进行预插值并求出色差通道, 接着通过求出5×5模板内判断插值方向的综合梯度因子, 重新更新G通道缺失像元值, 最后利用已重建的G通道求出缺失的R和B通道颜色。柯达测试图仿真结果表明, 相对于其他算法, 所提出的算法在PSNR上有较大优势; 相机输出图像的色彩重建结果表明, 本文算法在判断插值方向上的准确率更高; 可抑制其他算法插值后出现的斑点现象, 图像边缘清晰、完整。平均每个像元, 本文算法只需要56次算数运算, 不需要乘法和除法运算, 减轻了FPGA算法实现中IP核的负担, 易于硬件实现, 完全满足项目需要。
Abstract
Algorithms that have better performance also need more arithmetic operations. As a result, they will consume more hardware sources. In this paper, a new algorithm which has low complexity is proposed. Bayer pattern image is pre-interpolated by using Hamilton-Adam (H-A) algorithm firstly. Then the color-difference channel (CDC) and a direction factor (DF) in a 5×5 template are evaluated. Green channel is updated by using CDC and DF. R and B channel is evaluated via interpolated G channel. Simulation by Kodak test images shows that the algorithm has high PSNR. Experimental results also show that the algorithm not only maintains the sharp edges but also suppresses the speckle phenomenon which will be induced by VCD and MSG algorithm. Moreover, the algorithm just needs 56 arithmetic operations per pixel and can be accomplished via FPGA while MUL (multiplication) and DIV (division) are not needed. As a result, the proposed algorithm eases the burden of IP core in FPGA accomplishment and it’s easy to be accomplished. The algorithm satisfies the needs for our camera.

徐少雄, 张宇, 陈长征, 任建岳. 低复杂度Bayer图像色彩重建算法[J]. 液晶与显示, 2016, 31(2): 179. XU Shao-xiong, ZHANG Yu, CHEN Chang-zheng, REN Jian-yue. Low complexity demosaicing algorithm for Bayer pattern image[J]. Chinese Journal of Liquid Crystals and Displays, 2016, 31(2): 179.

关于本站 Cookie 的使用提示

中国光学期刊网使用基于 cookie 的技术来更好地为您提供各项服务,点击此处了解我们的隐私策略。 如您需继续使用本网站,请您授权我们使用本地 cookie 来保存部分信息。
全站搜索
您最值得信赖的光电行业旗舰网络服务平台!