2019
DOI: 10.1007/s11554-019-00927-1
|View full text |Cite
|
Sign up to set email alerts
|

FPGA-accelerated textured surface defect segmentation based on complete period Fourier reconstruction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2021
2021
2025
2025

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 15 publications
(5 citation statements)
references
References 17 publications
0
5
0
Order By: Relevance
“…3) Shape feature-based methods. The shape feature belongs to the middle layer feature of the image, which mainly describes the contour and the regional feature [18].…”
Section: A Traditional Defect Detection Methodsmentioning
confidence: 99%
“…3) Shape feature-based methods. The shape feature belongs to the middle layer feature of the image, which mainly describes the contour and the regional feature [18].…”
Section: A Traditional Defect Detection Methodsmentioning
confidence: 99%
“…At present, there are many ways to speed up models, such as model weight quantization and model pruning. Pan et al [13] applied the FPGA accelerated Fourier reconstruction operator to texture surface defect segmentation, and the parallel acceleration structure of FPGA was three times that of the CPU of the same level. Although existing deep learning models use the GPU as a general-purpose computing unit, FPGA will become an attractive alternative as the technology evolves.…”
Section: Real-time Problemmentioning
confidence: 99%
“…Hwang et al proposed a fast and stable Zernike moment algorithm based on the iterative relation of Zernike moment polynomials, and similarly, Pan et al proposed a fast and stable algorithm for Fourier Merlin moments. By using such an iterative relation for the calculation, the high power exponential operation in the direct calculation of 2 Advances in Mathematical Physics the higher-order moment kernel function by equation is avoided; thus, the overflow error and the computational accuracy error are well suppressed, and the computational speed and computational accuracy of the algorithm are improved at the same time [16]. In summary, although such iterative algorithms improve the overflow and computational accuracy errors, they still do not solve the problem of numerical integration errors.…”
Section: Related Workmentioning
confidence: 99%