2017
DOI: 10.1109/access.2016.2635378
|View full text |Cite
|
Sign up to set email alerts
|

High-Level Synthesis for Semi-Global Matching: Is the Juice Worth the Squeeze?

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 14 publications
(9 citation statements)
references
References 30 publications
0
9
0
Order By: Relevance
“…We also plan to use high-level synthesis (HLS) techniques to implement the NN on FPGA to explore more architectures and computational models (e.g., vectorization) and compare HLS implementation quality and manual optimization [50].…”
Section: Discussionmentioning
confidence: 99%
“…We also plan to use high-level synthesis (HLS) techniques to implement the NN on FPGA to explore more architectures and computational models (e.g., vectorization) and compare HLS implementation quality and manual optimization [50].…”
Section: Discussionmentioning
confidence: 99%
“…The concept of auto-generating HDL from various high level programs in nothing new as tools like Xilinx System Generator and Mathworks HDL Coder have been around since 2012. In the mid 2010s Qamar et al showcased the usability of high level synthesis and its competitive abilities against traditional manually coded designs [16] [17]. An integrated tool flow for simulating and generating HDL for computer vision algorithms was created in 2019 with the advent of the Vision HDL Toolbox which allows one to convert images composed of rows and columns into pixel streams that can be processed at the pixel line rates.…”
Section: Related Workmentioning
confidence: 99%
“…Therefore the mapping must be split up to the surrounding 4 pixels via a process known as bilinear interpolation. The interpolation is shown in (14)(15)(16)(17) and shows how a point (u, v) is represented by the surrounding pixels G 0 , G 1 , G 2 , G 3 utilizing deltaU and deltaV which describe the location of the sub-pixel in relation to the nearest pixels.…”
Section: Undistortionmentioning
confidence: 99%
“…For reducing computational complexity, two SGM methods based on the coarse-to-fine strategy are proposed in [25], [26]. Moreover, original or variant methods of SGM have been implemented on different computing architectures such as Graphics Processing Unit (GPU) [27], Field-Programmable Gate Array (FPGA) [28], and other embedded devices [29]. Although the SGM method has been widely used, this method may yield the known streaking artifacts.…”
Section: A Related Workmentioning
confidence: 99%