Search alternatives:
design optimization » bayesian optimization (Expand Search)
from optimization » fox optimization (Expand Search), swarm optimization (Expand Search), codon optimization (Expand Search)
image design » images designed (Expand Search), simple design (Expand Search), space design (Expand Search)
scale from » scale free (Expand Search), scale flow (Expand Search)
design optimization » bayesian optimization (Expand Search)
from optimization » fox optimization (Expand Search), swarm optimization (Expand Search), codon optimization (Expand Search)
image design » images designed (Expand Search), simple design (Expand Search), space design (Expand Search)
scale from » scale free (Expand Search), scale flow (Expand Search)
-
1
-
2
-
3
Datasets and their properties.
Published 2023“…To address this, we proposed a novel hybrid binary optimization capable of effectively selecting features from increasingly high-dimensional datasets. …”
-
4
Parameter settings.
Published 2023“…To address this, we proposed a novel hybrid binary optimization capable of effectively selecting features from increasingly high-dimensional datasets. …”
-
5
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. …”
-
6
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. …”
-
7
-
8
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. …”
-
9
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. …”
-
10
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. …”
-
11
Fortran & C++: design fractal-type optical diffractive element
Published 2022“…</p> <p>(2) calculate diffraction fields for fractal and/or grid-matrix (binary) phase-holograms.</p> <p>(3) optimize the fractal and/or grid-matrix holograms for given target diffraction images, using annealing algorithms. …”
-
12
-
13
-
14
Improved support vector machine classification algorithm based on adaptive feature weight updating in the Hadoop cluster environment
Published 2019“…The MapReduce parallel programming model on the Hadoop platform is used to perform an adaptive fusion of hue, local binary pattern (LBP) and scale-invariant feature transform (SIFT) features extracted from images to derive optimal combinations of weights. …”
-
15
Data_Sheet_1_Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer.pdf
Published 2019“…The Digital Annealer's algorithm is currently based on simulated annealing; however, it differs from it in its utilization of an efficient parallel-trial scheme and a dynamic escape mechanism. …”
-
16
-
17
-
18
Data_Sheet_1_Multiclass Classification Based on Combined Motor Imageries.pdf
Published 2020“…And we propose two new multilabel uses of the Common Spatial Pattern (CSP) algorithm to optimize the signal-to-noise ratio, namely MC2CMI and MC2SMI approaches. …”
-
19
Thesis-RAMIS-Figs_Slides
Published 2024“…<br><br>Finally, although the developed concepts, ideas and algorithms have been developed for inverse problems in geostatistics, the results are applicable to a wide range of disciplines where similar sampling problems need to be faced, included but not limited to design of communication networks, optimal integration and communication of swarms of robots and drones, remote sensing.…”
-
20
Predictive Analysis of Mushroom Toxicity Based Exclusively on Their Natural Habitat.
Published 2025“…Both the SVM model with a linear kernel and the one with an RBF kernel achieved identical results. Optimization with GridSearchCV corroborated this stagnation, identifying a simple linear model (C=0.05, gamma='scale') as the optimal configuration, indicating that the additional complexity of nonlinear kernels did not confer predictive gains. …”