Search alternatives:
design optimization » bayesian optimization (Expand Search)
based optimization » whale optimization (Expand Search)
binary space » banach space (Expand Search)
design optimization » bayesian optimization (Expand Search)
based optimization » whale optimization (Expand Search)
binary space » banach space (Expand Search)
-
41
-
42
-
43
Sample image for illustration.
Published 2024“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
-
44
A new fast filtering algorithm for a 3D point cloud based on RGB-D information
Published 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. …”
-
45
-
46
Improved support vector machine classification algorithm based on adaptive feature weight updating in the Hadoop cluster environment
Published 2019“…<div><p>An image classification algorithm based on adaptive feature weight updating is proposed to address the low classification accuracy of the current single-feature classification algorithms and simple multifeature fusion algorithms. …”
-
47
Quadratic polynomial in 2D image plane.
Published 2024“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
-
48
Supplementary file 1_Encodings of the weighted MAX k-CUT problem on qubit systems.pdf
Published 2025“…This study explores encoding methods for MAX k-CUT on qubit systems by utilizing quantum approximate optimization algorithms (QAOA) and addressing the challenge of encoding integer values on quantum devices with binary variables. …”
-
49
Comparison analysis of computation time.
Published 2024“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
-
50
Process flow diagram of CBFD.
Published 2024“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
-
51
Precision recall curve.
Published 2024“…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
-
52
-
53
-
54
-
55
-
56
Testing results for classifying AD, MCI and NC.
Published 2024“…The study introduced a scheme for enhancing images to improve the quality of the datasets. Specifically, an image enhancement algorithm based on histogram equalization and bilateral filtering techniques was deployed to reduce noise and enhance the quality of the images. …”
-
57
Summary of existing CNN models.
Published 2024“…The study introduced a scheme for enhancing images to improve the quality of the datasets. Specifically, an image enhancement algorithm based on histogram equalization and bilateral filtering techniques was deployed to reduce noise and enhance the quality of the images. …”
-
58
Flowchart scheme of the ML-based model.
Published 2024“…<b>I)</b> Testing data consisting of 20% of the entire dataset. <b>J)</b> Optimization of hyperparameter tuning. <b>K)</b> Algorithm selection from all models. …”
-
59
-
60