بدائل البحث:
based optimization » whale optimization (توسيع البحث)
art optimization » swarm optimization (توسيع البحث), after optimization (توسيع البحث), path optimization (توسيع البحث)
binary mask » binary image (توسيع البحث)
binary plot » binary plddt (توسيع البحث), binary depot (توسيع البحث)
plot based » plant based (توسيع البحث)
mask art » mask a (توسيع البحث)
based optimization » whale optimization (توسيع البحث)
art optimization » swarm optimization (توسيع البحث), after optimization (توسيع البحث), path optimization (توسيع البحث)
binary mask » binary image (توسيع البحث)
binary plot » binary plddt (توسيع البحث), binary depot (توسيع البحث)
plot based » plant based (توسيع البحث)
mask art » mask a (توسيع البحث)
-
1
-
2
-
3
-
4
-
5
-
6
-
7
-
8
Sample image for illustration.
منشور في 2024"…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …"
-
9
Comparison analysis of computation time.
منشور في 2024"…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …"
-
10
Process flow diagram of CBFD.
منشور في 2024"…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …"
-
11
Precision recall curve.
منشور في 2024"…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …"
-
12
Quadratic polynomial in 2D image plane.
منشور في 2024"…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …"
-
13
DataSheet_1_Near infrared spectroscopy for cooking time classification of cassava genotypes.docx
منشور في 2024"…Fifteen roots from five plants per plot, featuring diameters ranging from 4 to 7 cm, were randomly chosen for cooking analysis and spectral data collection. …"
-
14
Table_1_Near infrared spectroscopy for cooking time classification of cassava genotypes.docx
منشور في 2024"…Fifteen roots from five plants per plot, featuring diameters ranging from 4 to 7 cm, were randomly chosen for cooking analysis and spectral data collection. …"
-
15
Flow diagram of the automatic animal detection and background reconstruction.
منشور في 2020"…(E) The threshold value is calculated based on the histogram: it is the mean of the image subtracted by 4 (optimal value defined by trial and error). …"