Showing 61 - 67 results of 67 for search '(( binary time resource optimization algorithm ) OR ( binary scale based optimization algorithm ))', query time: 0.48s Refine Results
  1. 61

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

    Published 2024
    “…The results demonstrate that CBFD achieves a average precision of 0.97 for the test image, outperforming Superpoint, Directional Intensified Tertiary Filtering (DITF), Binary Robust Independent Elementary Features (BRIEF), Binary Robust Invariant Scalable Keypoints (BRISK), Speeded Up Robust Features (SURF), and Scale Invariant Feature Transform (SIFT), which achieve scores of 0.95, 0.92, 0.72, 0.66, 0.63 and 0.50 respectively. …”
  2. 62

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

    Published 2024
    “…The results demonstrate that CBFD achieves a average precision of 0.97 for the test image, outperforming Superpoint, Directional Intensified Tertiary Filtering (DITF), Binary Robust Independent Elementary Features (BRIEF), Binary Robust Invariant Scalable Keypoints (BRISK), Speeded Up Robust Features (SURF), and Scale Invariant Feature Transform (SIFT), which achieve scores of 0.95, 0.92, 0.72, 0.66, 0.63 and 0.50 respectively. …”
  3. 63

    Precision recall curve. by Indhumathi S. (19173013)

    Published 2024
    “…The results demonstrate that CBFD achieves a average precision of 0.97 for the test image, outperforming Superpoint, Directional Intensified Tertiary Filtering (DITF), Binary Robust Independent Elementary Features (BRIEF), Binary Robust Invariant Scalable Keypoints (BRISK), Speeded Up Robust Features (SURF), and Scale Invariant Feature Transform (SIFT), which achieve scores of 0.95, 0.92, 0.72, 0.66, 0.63 and 0.50 respectively. …”
  4. 64

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

    Published 2024
    “…The results demonstrate that CBFD achieves a average precision of 0.97 for the test image, outperforming Superpoint, Directional Intensified Tertiary Filtering (DITF), Binary Robust Independent Elementary Features (BRIEF), Binary Robust Invariant Scalable Keypoints (BRISK), Speeded Up Robust Features (SURF), and Scale Invariant Feature Transform (SIFT), which achieve scores of 0.95, 0.92, 0.72, 0.66, 0.63 and 0.50 respectively. …”
  5. 65

    Seed mix selection model by Bethanne Bruninga-Socolar (10923639)

    Published 2022
    “…</p> <p>  </p> <p>We applied the seed mix selection model using a binary genetic algorithm to select seed mixes (R package ‘GA’; Scrucca 2013; Scrucca 2017). …”
  6. 66

    Flow diagram of the automatic animal detection and background reconstruction. by David Tadres (9120564)

    Published 2020
    “…(E) The threshold value is calculated based on the histogram: it is the mean of the image subtracted by 4 (optimal value defined by trial and error). …”
  7. 67

    Machine Learning-Ready Dataset for Cytotoxicity Prediction of Metal Oxide Nanoparticles by Soham Savarkar (21811825)

    Published 2025
    “…</p><p dir="ltr"><b>Applications and Model Compatibility:</b></p><p dir="ltr">The dataset is optimized for use in supervised learning workflows and has been tested with algorithms such as:</p><p dir="ltr">Gradient Boosting Machines (GBM),</p><p dir="ltr">Support Vector Machines (SVM-RBF),</p><p dir="ltr">Random Forests, and</p><p dir="ltr">Principal Component Analysis (PCA) for feature reduction.…”