Search alternatives:
required optimization » guided optimization (Expand Search), resource optimization (Expand Search), feature optimization (Expand Search)
task optimization » based optimization (Expand Search), phase optimization (Expand Search), path optimization (Expand Search)
space required » force required (Expand Search), size required (Expand Search)
binary space » banach space (Expand Search)
image task » imagery tasks (Expand Search)
required optimization » guided optimization (Expand Search), resource optimization (Expand Search), feature optimization (Expand Search)
task optimization » based optimization (Expand Search), phase optimization (Expand Search), path optimization (Expand Search)
space required » force required (Expand Search), size required (Expand Search)
binary space » banach space (Expand Search)
image task » imagery tasks (Expand Search)
-
1
-
2
-
3
-
4
-
5
-
6
-
7
-
8
-
9
-
10
-
11
-
12
-
13
-
14
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. …”
-
15
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. …”
-
16
-
17
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. …”
-
18
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. …”
-
19
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. …”
-
20