2018
DOI: 10.1007/978-981-13-2384-3_44
|View full text |Cite
|
Sign up to set email alerts
|

A New Real-Time FPGA-Based Implementation of K-Means Clustering for Images

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 12 publications
0
0
0
Order By: Relevance
“…There are several previous works that propose FPGA-based implementations of k-means, but none of them are purely RTL hardware designs built from the ground up. Instead, they use techniques like HLS [39], [40], which partially automates the hardware implementation process, simplifying development at a cost of reducing scalability (since both references are unable to change the number of clusters) and sacrificing performance due to tool limitations. There are also hardware-software codesigns [24], that despite of their flexibility, fail to accelerate the whole algorithm and still conceive k-means as a sequence of instructions, causing a bottleneck.…”
Section: Comparison To Previous Workmentioning
confidence: 99%
“…There are several previous works that propose FPGA-based implementations of k-means, but none of them are purely RTL hardware designs built from the ground up. Instead, they use techniques like HLS [39], [40], which partially automates the hardware implementation process, simplifying development at a cost of reducing scalability (since both references are unable to change the number of clusters) and sacrificing performance due to tool limitations. There are also hardware-software codesigns [24], that despite of their flexibility, fail to accelerate the whole algorithm and still conceive k-means as a sequence of instructions, causing a bottleneck.…”
Section: Comparison To Previous Workmentioning
confidence: 99%