Area-time efficient streaming architecture for FAST and BRIEF detector

The combination of features from an accelerated segment test (FAST) corners and binary robust independent elementary feature (BRIEF) descriptors provide highly robust image features. We present a novel detector for computing the FAST-BRIEF features from streaming images. To reduce the complexity of...

Full description

Saved in:
Bibliographic Details
Main Authors: Lam, Siew-Kei, Jiang, Guiyuan, Wu, Meiqing, Cao, Bin
Other Authors: School of Computer Science and Engineering
Format: Article
Language:English
Published: 2020
Subjects:
Online Access:https://hdl.handle.net/10356/142793
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Description
Summary:The combination of features from an accelerated segment test (FAST) corners and binary robust independent elementary feature (BRIEF) descriptors provide highly robust image features. We present a novel detector for computing the FAST-BRIEF features from streaming images. To reduce the complexity of the BRIEF descriptor, we employ an optimized adder tree to perform summation by accumulation on streaming pixels for the smoothing operation. Since the window buffer used in existing designs for computing the BRIEF point-pairs are often poorly utilized, we propose an efficient sampling scheme that exploits register reuse to minimize the number of registers. Synthesis results based on 65-nm CMOS technology show that the proposed FAST-BRIEF core achieves over 40% reduction in area-delay product compared to the baseline design. In addition, we show that the proposed architecture can achieve 1.4× higher throughput than the baseline architecture with slightly lower energy consumption.