Search alternatives:
design optimization » bayesian optimization (Expand Search)
policy optimization » topology optimization (Expand Search), wolf optimization (Expand Search), process optimization (Expand Search)
image design » images designed (Expand Search), simple design (Expand Search), space design (Expand Search)
five policy » time policy (Expand Search), crime policy (Expand Search), leave policy (Expand Search)
design optimization » bayesian optimization (Expand Search)
policy optimization » topology optimization (Expand Search), wolf optimization (Expand Search), process optimization (Expand Search)
image design » images designed (Expand Search), simple design (Expand Search), space design (Expand Search)
five policy » time policy (Expand Search), crime policy (Expand Search), leave policy (Expand Search)
-
1
-
2
-
3
-
4
-
5
-
6
-
7
-
8
-
9
Sample image for illustration.
Published 2024“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
-
10
Quadratic polynomial in 2D image plane.
Published 2024“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
-
11
Comparison analysis of computation time.
Published 2024“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
-
12
Process flow diagram of CBFD.
Published 2024“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
-
13
Precision recall curve.
Published 2024“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
-
14
-
15
-
16
Fortran & C++: design fractal-type optical diffractive element
Published 2022“…</p> <p>(2) calculate diffraction fields for fractal and/or grid-matrix (binary) phase-holograms.</p> <p>(3) optimize the fractal and/or grid-matrix holograms for given target diffraction images, using annealing algorithms. …”
-
17
-
18
-
19
-
20