Search alternatives:
derived optimization » driven optimization (Expand Search), required optimization (Expand Search), design optimization (Expand Search)
based optimization » whale optimization (Expand Search)
ips derived » ipsc derived (Expand Search), its derived (Expand Search), hipsc derived (Expand Search)
binary plot » binary plddt (Expand Search), binary depot (Expand Search)
binary ips » binary pairs (Expand Search)
plot based » plant based (Expand Search)
derived optimization » driven optimization (Expand Search), required optimization (Expand Search), design optimization (Expand Search)
based optimization » whale optimization (Expand Search)
ips derived » ipsc derived (Expand Search), its derived (Expand Search), hipsc derived (Expand Search)
binary plot » binary plddt (Expand Search), binary depot (Expand Search)
binary ips » binary pairs (Expand Search)
plot based » plant based (Expand Search)
-
1
-
2
-
3
-
4
-
5
-
6
-
7
-
8
Sample image for illustration.
Published 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.
Published 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.
Published 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.
Published 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.
Published 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
Published 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
Published 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.
Published 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). …”