Section Channel classification (Binary classification part): Weights obtained by the optimised classification algorithm. by Fabien Raphel (9421987)

Overview of the segmentation algorithm. by Michael C. Robitaille (11949174)

An example of a type of texture of binary preferred/non-preferred ranges of raw vegetation index values type feature. by Elise Varaela Voltura (17592996)

Reproducing kernel-based semiparametric functional smoothed score estimation with binary responses by Meichen Liu (8168148)

<i>hi</i>PRS algorithm process flow. by Michela C. Massi (14599915)

“…<b>(C)</b> The whole training data is then scanned, searching for these sequences and deriving a re-encoded dataset where interaction terms are binary features (i.e., 1 if sequence <i>i</i> is observed in <i>j</i>-th patient genotype, 0 otherwise). …”

Schematic representation of semi-automated algorithm for organoids analyzing. by Anna Demchenko (18449439)

A new fast filtering algorithm for a 3D point cloud based on RGB-D information by Chaochuan Jia (7256237)

“…Then, the optimal segmentation threshold of the V image that is calculated by using the Otsu algorithm is applied to segment the color mapping image into a binary image, which is used to extract the valid point cloud from the original point cloud with outliers. …”

Symmetry test result. by Jiyong Moon (16819302)

Supplementary Material for: Penalized Logistic Regression Analysis for Genetic Association Studies of Binary Phenotypes by Yu Y. (3096192)

“…We consider two approximate approaches to maximizing the marginal likelihood: (i) a Monte Carlo EM algorithm (MCEM) and (ii) a Laplace approximation (LA) to each integral, followed by derivative-free optimization of the approximation. …”

Flowchart scheme of the ML-based model. by Noshaba Qasmi (20405009)

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

“…The results demonstrate that CBFD achieves a average precision of 0.97 for the test image, outperforming Superpoint, Directional Intensified Tertiary Filtering (DITF), Binary Robust Independent Elementary Features (BRIEF), Binary Robust Invariant Scalable Keypoints (BRISK), Speeded Up Robust Features (SURF), and Scale Invariant Feature Transform (SIFT), which achieve scores of 0.95, 0.92, 0.72, 0.66, 0.63 and 0.50 respectively. …”

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

“…The results demonstrate that CBFD achieves a average precision of 0.97 for the test image, outperforming Superpoint, Directional Intensified Tertiary Filtering (DITF), Binary Robust Independent Elementary Features (BRIEF), Binary Robust Invariant Scalable Keypoints (BRISK), Speeded Up Robust Features (SURF), and Scale Invariant Feature Transform (SIFT), which achieve scores of 0.95, 0.92, 0.72, 0.66, 0.63 and 0.50 respectively. …”

Improved support vector machine classification algorithm based on adaptive feature weight updating in the Hadoop cluster environment by Jianfang Cao (1881379)

“…The MapReduce parallel programming model on the Hadoop platform is used to perform an adaptive fusion of hue, local binary pattern (LBP) and scale-invariant feature transform (SIFT) features extracted from images to derive optimal combinations of weights. …”

An example of a type of percent cover of preferred ranges of vegetation index texture values type feature. by Elise Varaela Voltura (17592996)

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

“…The results demonstrate that CBFD achieves a average precision of 0.97 for the test image, outperforming Superpoint, Directional Intensified Tertiary Filtering (DITF), Binary Robust Independent Elementary Features (BRIEF), Binary Robust Invariant Scalable Keypoints (BRISK), Speeded Up Robust Features (SURF), and Scale Invariant Feature Transform (SIFT), which achieve scores of 0.95, 0.92, 0.72, 0.66, 0.63 and 0.50 respectively. …”

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

“…The results demonstrate that CBFD achieves a average precision of 0.97 for the test image, outperforming Superpoint, Directional Intensified Tertiary Filtering (DITF), Binary Robust Independent Elementary Features (BRIEF), Binary Robust Invariant Scalable Keypoints (BRISK), Speeded Up Robust Features (SURF), and Scale Invariant Feature Transform (SIFT), which achieve scores of 0.95, 0.92, 0.72, 0.66, 0.63 and 0.50 respectively. …”

Precision recall curve. by Indhumathi S. (19173013)

“…The results demonstrate that CBFD achieves a average precision of 0.97 for the test image, outperforming Superpoint, Directional Intensified Tertiary Filtering (DITF), Binary Robust Independent Elementary Features (BRIEF), Binary Robust Invariant Scalable Keypoints (BRISK), Speeded Up Robust Features (SURF), and Scale Invariant Feature Transform (SIFT), which achieve scores of 0.95, 0.92, 0.72, 0.66, 0.63 and 0.50 respectively. …”

Latent state estimations for experimental data with no stressors. by Samiul Alam (18563323)

Latent state estimations for experimental data with interruptions for subject 18. by Samiul Alam (18563323)

Latent state estimations for experimental data with time limit. by Samiul Alam (18563323)