2019
DOI: 10.1109/tvlsi.2019.2905242
|View full text |Cite
|
Sign up to set email alerts
|

A High-Throughput and Power-Efficient FPGA Implementation of YOLO CNN for Object Detection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
111
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 334 publications
(144 citation statements)
references
References 19 publications
0
111
0
Order By: Relevance
“…clustering method to obtain anchor boxes by suppressing the interference boxes [26]. More speci cally, the K-means algorithm randomly selects bounding boxes as the initial clustering center, and the distance between each bounding box to the cluster center is calculated.…”
Section: Bounding Box Generationmentioning
confidence: 99%
“…clustering method to obtain anchor boxes by suppressing the interference boxes [26]. More speci cally, the K-means algorithm randomly selects bounding boxes as the initial clustering center, and the distance between each bounding box to the cluster center is calculated.…”
Section: Bounding Box Generationmentioning
confidence: 99%
“…is the maximum size of shortcut's output in the second group. As shown in Table I in [9], for layers in [1,i], row_buffl = (Kl+1) × Nl × Hl × QA, out_buffl = To × × QS, and for layers in [i+1,L], in_frame_buffl = Hl 2 × Nl × QA, out_buffl = To × Hl 2 × QS, respectively. , , , are the kernel size, feature map width (height), number of input channels, and number of output channels, respectively.…”
Section: B Optimization For the Mixed Data Flow Designmentioning
confidence: 99%
“…It is assumed that the provided DRAM bandwidth is sufficient to not affect the execution time. In fact, this assumption is true in most design Table I in [9]. It should be noted that Scheme 1 (no reuse) in [9] is not listed here.…”
Section: =1mentioning
confidence: 99%
See 2 more Smart Citations