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

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

Bayesian Spatial Binary Regression for Label Fusion in Structural Neuroimaging by D. Andrew Brown (6584837)

Data_Sheet_1_Posiform planting: generating QUBO instances for benchmarking.pdf by Georg Hahn (12530469)

“…<p>We are interested in benchmarking both quantum annealing and classical algorithms for minimizing quadratic unconstrained binary optimization (QUBO) problems. …”

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)

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

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

Identification and quantitation of clinically relevant microbes in patient samples: Comparison of three k-mer based classifiers for speed, accuracy, and sensitivity by George S. Watts (7962206)

Image1_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.TIF by Sizhuo Yu (11429743)

“…Its current hardware implementation relies on D-Wave’s Quantum Processing Units, which are limited in terms of number of qubits and architecture while being restricted to solving quadratic unconstrained binary optimization (QUBO) problems. …”

Image3_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.TIF by Sizhuo Yu (11429743)

“…Its current hardware implementation relies on D-Wave’s Quantum Processing Units, which are limited in terms of number of qubits and architecture while being restricted to solving quadratic unconstrained binary optimization (QUBO) problems. …”

Image2_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.TIF by Sizhuo Yu (11429743)

“…Its current hardware implementation relies on D-Wave’s Quantum Processing Units, which are limited in terms of number of qubits and architecture while being restricted to solving quadratic unconstrained binary optimization (QUBO) problems. …”

DataSheet1_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.pdf by Sizhuo Yu (11429743)

“…Its current hardware implementation relies on D-Wave’s Quantum Processing Units, which are limited in terms of number of qubits and architecture while being restricted to solving quadratic unconstrained binary optimization (QUBO) problems. …”

Image 1_A multimodal AI-driven framework for cardiovascular screening and risk assessment in diverse athletic populations: innovations in sports cardiology.png by Minjin Guo (22751300)

PathOlOgics_RBCs Python Scripts.zip by Ahmed Elsafty (16943883)

“…</p><p dir="ltr">In terms of classification, a second algorithm was developed and employed to preliminary sort or group the individual cells (after excluding the overlapping cells manually) into different categories using five geometric measurements applied to the extracted contour from each binary image mask (see PathOlOgics_script_2; preliminary shape measurements). …”

Table 1_Heavy metal biomarkers and their impact on hearing loss risk: a machine learning framework analysis.docx by Ali Nabavi (21097424)

“…Multiple machine learning algorithms, including Random Forest, XGBoost, Gradient Boosting, Logistic Regression, CatBoost, and MLP, were optimized and evaluated. …”