Homomorphic binary tree. حسب Jianhua He (341366)

Validation of image processing steps and metric results using images of a microfluidic device. حسب Gavrielle R. Untracht (11820311)

tUbenet Foundation Model Weights حسب Natalie Holroyd (7099391)

Flowchart of software workflow. حسب Gavrielle R. Untracht (11820311)

Improved support vector machine classification algorithm based on adaptive feature weight updating in the Hadoop cluster environment حسب 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. …"

Experimental observation of gastruloids and shape quantification using LOCO-EFA. حسب Martijn A. de Jong (17896732)

Analysis and design of algorithms for the manufacturing process of integrated circuits حسب Sonia Fleytas (16856403)

"…Additionally, the results obtained from our new ILP model indicate that our genetic algorithm results are very close to the optimal values.…"

Fig 3 - حسب Ali Ahmed (2567584)

Sample image for illustration. حسب 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. حسب 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. …"

Steps in the extraction of 14 coordinates from the CT slices for the curved MPR. حسب Linus Woitke (22783534)

"…The image is then cleaned in c) using morphological filtering with an <i>opening</i> operation to remove small-scale noise. …"

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

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

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

Comparison analysis of computation time. حسب 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. حسب 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. حسب 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. …"

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

"…If the identical blob that was detected in panel J (bottom) is found in any of the new subtracted binary images (cyan arrow), the animal is considered as having left its original position, and the algorithm continues. …"