بدائل البحث:
derived optimization » driven optimization (توسيع البحث), required optimization (توسيع البحث), design optimization (توسيع البحث)
robust optimization » process optimization (توسيع البحث), robust estimation (توسيع البحث), joint optimization (توسيع البحث)
risks derived » risks perceived (توسيع البحث), virus derived (توسيع البحث), lines derived (توسيع البحث)
binary risks » dietary risks (توسيع البحث), binary mask (توسيع البحث)
derived optimization » driven optimization (توسيع البحث), required optimization (توسيع البحث), design optimization (توسيع البحث)
robust optimization » process optimization (توسيع البحث), robust estimation (توسيع البحث), joint optimization (توسيع البحث)
risks derived » risks perceived (توسيع البحث), virus derived (توسيع البحث), lines derived (توسيع البحث)
binary risks » dietary risks (توسيع البحث), binary mask (توسيع البحث)
-
1
-
2
-
3
-
4
-
5
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. …"
-
6
-
7
-
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
-
14
Variable Selection with Multiply-Imputed Datasets: Choosing Between Stacked and Grouped Methods
منشور في 2022"…Building on existing work, we (i) derive and implement efficient cyclic coordinate descent and majorization-minimization optimization algorithms for continuous and binary outcome data, (ii) incorporate adaptive shrinkage penalties, (iii) compare these methods through simulation, and (iv) develop an R package <i>miselect</i>. …"