基于行程累加的目标标记硬件加速算法  

Accelerated hardware target labeling based on run-length accumulation

作　　者：郑红[1] 李俊[1] 

机构地区：[1]北京航空航天大学自动化科学与电气工程学院,北京100191

出　　处：《北京航空航天大学学报》2012年第11期1425-1429,共5页Journal of Beijing University of Aeronautics and Astronautics

基　　金：光电信息重点实验室基金资助项目(9140C150105100C1502);国家自然科学基金资助项目(60543006)

摘　　要：针对目标标记算法的长耗时、大延迟严重影响目标跟踪的效果和实时性问题,提出了快速的基于行程累加的目标标记硬件加速算法.通过对像素进行行程编码,按照定义的累加规则对相邻行的行程进行累加运算,避免了标号冲突的发生,无需建立等价表,实现了一遍扫描完成连通域标记和连通域特征的计算.实验结果表明提出的算法资源占用较少,输出延迟小,与软件算法相比具有很高的加速比,有利于后续目标跟踪的高速实时处理.To solve the problem that long time consuming and delay of target labeling algorithm seriously affected the effect and real-time performance of target tracking, fast accelerated hardware target labeling algo- rithm based on run-length accumulation was proposed. The pixels of image were converted to runs, and then the two runs of adjacent lines were accomplished accumulation calculation according to the defined accumula tion rulers. The labeling conflicts were avoided. The algorithm could complete connected components labeling and calculate connected components features in a single pass without establishing equivalence table. Experi- ments show that the algorithm uses less memory resources with smaller result delay, and has higher speed ratio compared with software algorithms. So it can benefit to the fast and real-time processing of later target track- ing.

关 键 词：并行计算 目标标记 硬件加速 行程累加 

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