基于FPGA的轻量级和实时红外图像处理器
Xiaoqing Wang1,2, Xiang He3, Xiangyu Zhu3
1Center for Quantum Technology Research and Key Laboratory of Advanced Optoelectronic Quantum Architecture and Measurements (MOE), School of Physics, Beijing Institute of Technology, Beijing 100081, China.
Sensors (Basel, Switzerland)
|February 24, 2024
概括
本研究介绍了一种基于FPGA的新型红外图像处理器,利用硬件优化的算法实现实时性能. 处理器有效地纠正传感器的不均性,并补偿盲点像素,同时保留图像细节,提供更低的功耗.
科学领域:
- 电气工程 电气工程
- 计算机工程 计算机工程
- 图像处理 图像处理
背景情况:
- 红外成像系统经常遭受传感器不均和有缺陷的像素,降低图像质量.
- 红外图像的实时处理需要高效的算法和硬件加速.
- 现有的解决方案可能具有高资源开销或高功耗.
研究的目的:
- 使用FPGA技术开发一种轻量级的实时红外图像处理器.
- 实施面向硬件的算法来纠正不均性和盲点像素补偿.
- 为了优化处理器以实现最小的资源利用和低功耗.
主要方法:
- 实现传感器非统一性校准的两点校正算法.
- 使用一级近似方法开发一个盲点检测算法.
- 应用侧窗过方法用于盲点补偿与同时卷积内核计算.
- 整合轻量级组图平衡,以增强视觉观察.
- 在Xilinx XC7A100T-2 FPGA上的硬件实现.
主要成果:
- 实现了对640x480分辨率图像的实时不均性校正.
- 有效补偿盲点像素,同时保留图像细节.
- 处理器使用了10,894个LUT,9367个FF,4个BRAM和5个DSP48.
- 在50MHz时钟下以每秒30的速度运行,耗电1800mW.
- 最大运行频率达到了186 MHz.
结论:
- 拟议的基于FPGA的红外图像处理器为实时图像处理提供了轻量级和高效的解决方案.
- 实施的算法提供了有效的非统一性校正和盲点补偿,使用最小的资源开销.
- 该设计的功耗低于现有的类似工程,因此适用于各种红外成像应用.
相关概念视频
IR Frequency Region: Fingerprint Region
893
IR spectra are divided into two main regions: the diagnostic region and the fingerprint region. The diagnostic region of the spectrum lies above 1500 cm−1. The absorptions resulting from single-bond vibrations of the N–H, C–H, and O–H stretch at higher wavenumbers and appear on the left side of the spectrum. The stretching absorptions of the C≡C and C≡N occur between 2100–2300 cm−1. In contrast, those arising from stretching absorptions of the...
893
Infrared (IR) Spectroscopy: Overview
1.8K
When electromagnetic radiation passes through a material, atoms or molecules transition from a lower to a higher energy state by absorbing radiation corresponding to the energy difference between the two states. The absorption of infrared (IR) radiation causes transitions between vibrational energy levels in a molecule. Therefore, IR spectroscopy is a useful analytical tool for determining the molecular structure of molecules.
Different compounds display unique properties due to their...
Different compounds display unique properties due to their...
1.8K
Fast Fourier Transform
324
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
324


