Search alternatives:
based optimization » whale optimization (Expand Search)
binary marked » binary mask (Expand Search)
marked swarm » marked scale (Expand Search)
binary plot » binary plddt (Expand Search), binary depot (Expand Search)
plot based » plant based (Expand Search)
based optimization » whale optimization (Expand Search)
binary marked » binary mask (Expand Search)
marked swarm » marked scale (Expand Search)
binary plot » binary plddt (Expand Search), binary depot (Expand Search)
plot based » plant based (Expand Search)
-
1
-
2
-
3
-
4
-
5
-
6
-
7
-
8
GSE96058 information.
Published 2024“…Subsequently, feature selection was conducted using ANOVA and binary Particle Swarm Optimization (PSO). During the analysis phase, the discriminative power of the selected features was evaluated using machine learning classification algorithms. …”
-
9
The performance of classifiers.
Published 2024“…Subsequently, feature selection was conducted using ANOVA and binary Particle Swarm Optimization (PSO). During the analysis phase, the discriminative power of the selected features was evaluated using machine learning classification algorithms. …”
-
10
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). …”
-
11
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). …”
-
12
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). …”
-
13
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). …”
-
14
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). …”
-
15
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. …”
-
16
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. …”
-
17
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). …”