Binary leaf image rotated anti-clock wise from the origin degree to 40^<i>o</i>, 80^<i>o</i>, 120^<i>o</i>, and 160^<i>o</i> from left to ri... by Ali Ahmed (2567584)

SHAP bar plot. by Meng Cao (105914)

SHAP summary plot. by Meng Cao (105914)

A radar plot illustrating the comparison of the classification accuracy, cost values, and fitness values for the hybrids of BEOSA when applied to some high-dimensional datasets usi... by Olaide N. Oyelade (14047002)

A radar plot illustrating the comparison of the classification accuracy, cost values, and fitness values for the hybrids of BEOSA when applied to some medium-sized dimensional data... by Olaide N. Oyelade (14047002)

A radar plot illustrating the comparison of the classification accuracy, cost values, and fitness values for the hybrids of BEOSA when applied to some small-sized dimensional datas... by Olaide N. Oyelade (14047002)

Fig 3 - by Ali Ahmed (2567584)

Fig 4 - by Olaide N. Oyelade (14047002)

Fig 7 - by Olaide N. Oyelade (14047002)

Thesis-RAMIS-Figs_Slides by Felipe Santibañez-Leal (10967991)

“…<br><br>Finally, although the developed concepts, ideas and algorithms have been developed for inverse problems in geostatistics, the results are applicable to a wide range of disciplines where similar sampling problems need to be faced, included but not limited to design of communication networks, optimal integration and communication of swarms of robots and drones, remote sensing.…”

Sample image for illustration. by Indhumathi S. (19173013)

“…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). …”

Comparison analysis of computation time. by Indhumathi S. (19173013)

“…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). …”

Process flow diagram of CBFD. by Indhumathi S. (19173013)

“…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). …”

Precision recall curve. by Indhumathi S. (19173013)

“…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). …”

Quadratic polynomial in 2D image plane. by Indhumathi S. (19173013)

“…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). …”

DataSheet_1_Near infrared spectroscopy for cooking time classification of cassava genotypes.docx by Massaine Bandeira e Sousa (7866242)

“…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. …”

Table_1_Near infrared spectroscopy for cooking time classification of cassava genotypes.docx by Massaine Bandeira e Sousa (7866242)

“…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. …”

Flow diagram of the automatic animal detection and background reconstruction. by David Tadres (9120564)

“…(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). …”