Showing 1 - 20 results of 24 for search '(( binary small model optimization algorithm ) OR ( binary image design optimization algorithm ))', query time: 0.49s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16

    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. …”
  17. 17

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

    Published 2024
    “…Importantly, this strategy locates samples adaptively on the transition between facies which improves the performance of conventional \emph{<i>MPS</i>} algorithms. In conclusion, this work shows that preferential sampling can contribute in \emph{<i>MPS</i>} even at very small sampling regimes and, as a corollary, demonstrates that prior models (obtained form a training image) can be used effectively not only to simulate non-sensed variables of the field, but to decide where to measure next.…”
  18. 18

    DataSheet_1_Raman Spectroscopic Differentiation of Streptococcus pneumoniae From Other Streptococci Using Laboratory Strains and Clinical Isolates.pdf by Marcel Dahms (9160118)

    Published 2022
    “…Improvement of the classification rate is expected with optimized model parameters and algorithms as well as with a larger spectral data base for training.…”
  19. 19

    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. …”
  20. 20

    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. …”