بدائل البحث:
robust optimization » process optimization (توسيع البحث), robust estimation (توسيع البحث), joint optimization (توسيع البحث)
based optimization » whale optimization (توسيع البحث)
binary art » binary pairs (توسيع البحث)
art based » arts based (توسيع البحث), ct based (توسيع البحث), ai based (توسيع البحث)
robust optimization » process optimization (توسيع البحث), robust estimation (توسيع البحث), joint optimization (توسيع البحث)
based optimization » whale optimization (توسيع البحث)
binary art » binary pairs (توسيع البحث)
art based » arts based (توسيع البحث), ct based (توسيع البحث), ai based (توسيع البحث)
-
1
-
2
-
3
-
4
A new fast filtering algorithm for a 3D point cloud based on RGB-D information
منشور في 2019"…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. …"
-
5
-
6
-
7
Analysis and design of algorithms for the manufacturing process of integrated circuits
منشور في 2023"…The (approximate) solution proposals of state-of-the-art methods include rule-based approaches, genetic algorithms, and reinforcement learning. …"
-
8
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. …"
-
9
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. …"
-
10
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. …"
-
11
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. …"
-
12
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. …"
-
13
datasheet1_Graph Neural Networks for Maximum Constraint Satisfaction.pdf
منشور في 2021"…Despite being generic, we show that our approach matches or surpasses most greedy and semi-definite programming based algorithms and sometimes even outperforms state-of-the-art heuristics for the specific problems.…"
-
14
-
15