Performance of active and standby paths. by Yang Yu (4292)

“…This algorithm provides both a primary routing path and an alternate routing path for service transmission, ensuring the delivery of high-priority services even when both the primary and standby paths are unavailable. …”

DATA. by Yang Yu (4292)

“…This algorithm provides both a primary routing path and an alternate routing path for service transmission, ensuring the delivery of high-priority services even when both the primary and standby paths are unavailable. …”

Routing policy based on path satisfaction. by Yang Yu (4292)

“…This algorithm provides both a primary routing path and an alternate routing path for service transmission, ensuring the delivery of high-priority services even when both the primary and standby paths are unavailable. …”

Flowchart of simple ant colony algorithm. by Yang Yu (4292)

“…This algorithm provides both a primary routing path and an alternate routing path for service transmission, ensuring the delivery of high-priority services even when both the primary and standby paths are unavailable. …”

Business priorities. by Yang Yu (4292)

“…This algorithm provides both a primary routing path and an alternate routing path for service transmission, ensuring the delivery of high-priority services even when both the primary and standby paths are unavailable. …”

Topology of 14-node communication network. by Yang Yu (4292)

“…This algorithm provides both a primary routing path and an alternate routing path for service transmission, ensuring the delivery of high-priority services even when both the primary and standby paths are unavailable. …”

Changes of risk value under different parameters. by Yang Yu (4292)

“…This algorithm provides both a primary routing path and an alternate routing path for service transmission, ensuring the delivery of high-priority services even when both the primary and standby paths are unavailable. …”

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

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

DataSheet1_An integrated framework for UAV-based precision plant protection in complex terrain: the ACHAGA solution for multi-tea fields.zip by Pengyang Zhang (11256688)

DataSheet3_An integrated framework for UAV-based precision plant protection in complex terrain: the ACHAGA solution for multi-tea fields.zip by Pengyang Zhang (11256688)

DataSheet2_An integrated framework for UAV-based precision plant protection in complex terrain: the ACHAGA solution for multi-tea fields.zip by Pengyang Zhang (11256688)

DataSheet4_An integrated framework for UAV-based precision plant protection in complex terrain: the ACHAGA solution for multi-tea fields.zip by Pengyang Zhang (11256688)

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

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