Search alternatives:
design optimization » bayesian optimization (Expand Search)
codon optimization » wolf optimization (Expand Search)
image design » images designed (Expand Search), simple design (Expand Search), space design (Expand Search)
Showing 1 - 9 results of 9 for search '(( binary image design optimization algorithm ) OR ( binary class codon optimization algorithm ))', query time: 0.42s Refine Results
  1. 1
    Illustration of the transformed binary images of normal, benign, and malignant samples into grayscale.

    Illustration of the transformed binary images of normal, benign, and malignant samples into grayscale. by Tehnan I. A. Mohamed (16846175)

    Published 2023
    Save to List
    Saved in:
  2. 2
    Sample image for illustration.

    Sample image for illustration. by Indhumathi S. (19173013)

    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. …”
    Save to List
    Saved in:
  3. 3
    Quadratic polynomial in 2D image plane.

    Quadratic polynomial in 2D image plane. by Indhumathi S. (19173013)

    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. …”
    Save to List
    Saved in:
  4. 4
    Comparison analysis of computation time.

    Comparison analysis of computation time. by Indhumathi S. (19173013)

    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. …”
    Save to List
    Saved in:
  5. 5
    Process flow diagram of CBFD.

    Process flow diagram of CBFD. by Indhumathi S. (19173013)

    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. …”
    Save to List
    Saved in:
  6. 6
    Precision recall curve.

    Precision recall curve. by Indhumathi S. (19173013)

    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. …”
    Save to List
    Saved in:
  7. 7
    Fortran & C++: design fractal-type optical diffractive element

    Fortran & C++: design fractal-type optical diffractive element by I-Lin Ho (13768960)

    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. …”
    Save to List
    Saved in:
  8. 8
    Data_Sheet_1_Multiclass Classification Based on Combined Motor Imageries.pdf

    Data_Sheet_1_Multiclass Classification Based on Combined Motor Imageries.pdf by Cecilia Lindig-León (7889777)

    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. …”
    Save to List
    Saved in:
  9. 9
    Thesis-RAMIS-Figs_Slides

    Thesis-RAMIS-Figs_Slides by Felipe Santibañez-Leal (10967991)

    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.…”
    Save to List
    Saved in:

Search Tools: