بدائل البحث:
robust optimization » process optimization (توسيع البحث), robust estimation (توسيع البحث), joint optimization (توسيع البحث)
codon optimization » wolf optimization (توسيع البحث)
task robust » based robust (توسيع البحث)
binary mask » binary image (توسيع البحث)
robust optimization » process optimization (توسيع البحث), robust estimation (توسيع البحث), joint optimization (توسيع البحث)
codon optimization » wolf optimization (توسيع البحث)
task robust » based robust (توسيع البحث)
binary mask » binary image (توسيع البحث)
-
1
The Pseudo-Code of the IRBMO Algorithm.
منشور في 2025"…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …"
-
2
IRBMO vs. meta-heuristic algorithms boxplot.
منشور في 2025"…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …"
-
3
IRBMO vs. feature selection algorithm boxplot.
منشور في 2025"…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …"
-
4
Pseudo Code of RBMO.
منشور في 2025"…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …"
-
5
P-value on CEC-2017(Dim = 30).
منشور في 2025"…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …"
-
6
Memory storage behavior.
منشور في 2025"…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …"
-
7
Elite search behavior.
منشور في 2025"…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …"
-
8
Description of the datasets.
منشور في 2025"…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …"
-
9
S and V shaped transfer functions.
منشور في 2025"…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …"
-
10
S- and V-Type transfer function diagrams.
منشور في 2025"…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …"
-
11
Collaborative hunting behavior.
منشور في 2025"…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …"
-
12
Friedman average rank sum test results.
منشور في 2025"…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …"
-
13
IRBMO vs. variant comparison adaptation data.
منشور في 2025"…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …"
-
14
-
15
Sample image for illustration.
منشور في 2024"…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. …"
-
16
Comparison analysis of computation time.
منشور في 2024"…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. …"
-
17
Process flow diagram of CBFD.
منشور في 2024"…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. …"
-
18
Precision recall curve.
منشور في 2024"…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. …"
-
19
Quadratic polynomial in 2D image plane.
منشور في 2024"…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. …"
-
20
Models and Dataset
منشور في 2025"…The algorithm does not rely on predefined control parameters like crossover or mutation rates, which makes it lightweight and easy to implement for various feature selection and optimization tasks.…"