Showing 1 - 16 results of 16 for search '(( binary image global optimization algorithm ) OR ( binary image task optimization algorithm ))', query time: 0.62s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4

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

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

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

    Published 2024
    “…Importantly, the proposed methodology takes advantage of the information available from the previously sampled locations, allowing to improve the performance as compared with some of the classical non-adaptive sampling schemes used for advanced drilling tasks. From the results obtained across these three real scenarios explored in this thesis, it is possible to see that the proposed methodology achieves better performances than sampling in a structured regular grid (used as a conventional rule for sampling) in terms of both error in image reconstruction and global economic value, when considering the economic revenue of processing the ore and dumping the waste. …”
  8. 8

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

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

    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. …”
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15

    Generalized Tensor Decomposition With Features on Multiple Modes by Jiaxin Hu (1327875)

    Published 2021
    “…An efficient alternating optimization algorithm with provable spectral initialization is further developed. …”
  16. 16

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

    Published 2020
    “…In this way, for each binary problem, the CSP algorithm produces features to determine if the specific body part is engaged in the task or not. …”