为自动驾驶实时识别交通标志,提出多级近似计算方法
AppSign: Multi-level Approximate Computing for Real-Time Traffic Sign Recognition in Autonomous Vehicles
- 通过近似卷积运算降低计算开销,提升实时性
- 近似乘法使运行时间平均节省64%,准确率下降10%
- 分层自适应近似策略,兼顾精度与效率,适合资源受限系统
本文提出一种用于自动驾驶实时交通标志识别的多级近似计算方法 AppSign。由于自动驾驶系统是实时系统,必须即时获取并处理环境信息,但受限于资源,难以运行计算密集型深度学习算法。为此,本文设计了一种多级近似计算方案,在保持可接受精度的前提下显著降低计算成本。AppSign 针对基于 CNN 的交通标志识别模块,通过近似卷积操作实现加速。提出一种新型近似乘法方法 TIRuD,通过截断运算在平均减少 64% 执行时间的同时,仅导致约 10% 的准确率下降。此外,通过在不同网络层采用分层自适应近似策略,相比精确计算,在衡量精度与计算成本的指标 AoC 上提升了 27.78%。
原文摘要 · Abstract (English)
This paper presents a multi-level approximate computing approach for real-time traffic sign recognition in autonomous vehicles called AppSign. Since autonomous vehicles are real-time systems, they must gather environmental information and process them instantaneously to respond properly. However, due to the limited resources of these systems, executing computation-intensive algorithms such as deep-learning schemes that lead to precise output is impossible and takes a long time. To tackle this, imprecise computation schemes compromise the complexity and real-time operations. In this context, AppSign presents a multi-level approximate computing scheme to balance the accuracy and computation cost of the computation-intensive schemes and make them appropriate for real-time applications. AppSign is applied to the CNN-based traffic sign recognition unit by approximating the convolution operation of CNN which is the primal solution for image processing applications. In AppSign a novel approximate multiplication method called "TIRuD" is proposed that truncates the operations while keeping the accuracy acceptable. Moreover, it provides the adaptive approximation of the underlying CNN by involving various levels of computation and considering different approximation methods. The efficiency of the proposed AppSign, in real-time traffic sign recognition, is evaluated through several experiments. Based on these experiments, our proposed TIRuD reduces the accuracy by about $10\%$ while saving execution time about $64\%$ over the exact multiplication, averagely. Moreover, employing our proposed hierarchical approximation in various model layers outperforms the exact computation $27.78\%$ considering "AoC" that joins accuracy and computation cost in a parameter.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。