2018
DOI: 10.1049/el.2017.3133
|View full text |Cite
|
Sign up to set email alerts
|

Reconfigurable hardware architecture for faster descriptor extraction in SURF

Abstract: Speeded up robust features (SURFs) are considered to be the most efficient feature extraction algorithm and it has been implemented in powerful hardware for real-time operation due to its characteristics of data-intensive computation of high complexity. Especially, the computational load of the descriptor extraction procedure is very significant and the overall performance of SURF can be improved by speeding up the descriptor extraction step with increasing parallel hardware accelerators. However, simply incre… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 4 publications
0
3
0
Order By: Relevance
“…Several studies are using YOLO to detect objects and compare them to FasterRCNN (Benjdira et al, 2019;Cao et al, 2019;Y. Chen et al, 2018;Y. Kim & Jung, 2018;Park et al, 2018;Redmon & Farhadi, 2018).…”
Section: Various Algorithms In Navigational Assistance For Visually I...mentioning
confidence: 99%
“…Several studies are using YOLO to detect objects and compare them to FasterRCNN (Benjdira et al, 2019;Cao et al, 2019;Y. Chen et al, 2018;Y. Kim & Jung, 2018;Park et al, 2018;Redmon & Farhadi, 2018).…”
Section: Various Algorithms In Navigational Assistance For Visually I...mentioning
confidence: 99%
“…Moreover, before training OS‐ELM neural networks, the feature data model should be built. (a) Build data model step 1 : Extract N strongest speeded up robust features (SURFs) [7] of each frame Ii, where i is the frame number. Step 2 : Match outliers eliminated features between two neighbouring frames (matching step m =1). Sorting the successfully matched features according to their matching scores and selecting the top Nnormala feature pairs with the highest matching score. Step 3 : Compute and form feature set for each frame with the following data: M affine transformation matrices with the selected Nnormala feature pairs (three matching pairs produce one affine transformation matrix), differential inertial data (normalΔnormalaccix, normalΔnormalacciy and normalΔnormalgroiz), differential time (normalΔtimnormalei).…”
Section: Proposed Algorithmmentioning
confidence: 99%
“…(a) Build data model step 1: Extract N strongest speeded up robust features (SURFs) [7] of each frame I i , where i is the frame number.…”
mentioning
confidence: 99%