Search alternatives:
design optimization » bayesian optimization (Expand Search)
path optimization » swarm optimization (Expand Search), whale optimization (Expand Search), based optimization (Expand Search)
image design » images designed (Expand Search), simple design (Expand Search), space design (Expand Search)
scale path » scale data (Expand Search)
design optimization » bayesian optimization (Expand Search)
path optimization » swarm optimization (Expand Search), whale optimization (Expand Search), based optimization (Expand Search)
image design » images designed (Expand Search), simple design (Expand Search), space design (Expand Search)
scale path » scale data (Expand Search)
-
1
-
2
-
3
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. …”
-
4
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. …”
-
5
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. …”
-
6
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. …”
-
7
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. …”
-
8
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. …”
-
9
MCLP_quantum_annealer_V0.5
Published 2025“…This paper presents a quantum computing path for Transformation-to-Sampling-to-Verification of geospatial optimization problems, adaptable to the controlled qubit scale and coherence constraints under current NISQ conditions. …”
-
10
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. …”
-
11
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.…”
-
12
Steps in the extraction of 14 coordinates from the CT slices for the curved MPR.
Published 2025“…In e), the image is skeletonized by creating a line along the center of the lower jaw. Protruding paths are then eliminated using graph-based optimization algorithms, as demonstrated in f). …”