Showing 1 - 20 results of 20 for search '(( binary pairs data optimization algorithm ) OR ( binary image scale optimization algorithm ))', query time: 0.43s Refine Results
  1. 1
  2. 2
  3. 3

    <i>hi</i>PRS algorithm process flow. by Michela C. Massi (14599915)

    Published 2023
    “…<p><b>(A)</b> Input data is a list of genotype-level SNPs. <b>(B)</b> Focusing on the positive class only, the algorithm exploits FIM (<i>apriori</i> algorithm) to build a list of candidate interactions of any desired order, retaining those that have an empirical frequency above a given threshold <i>δ</i>. …”
  4. 4
  5. 5
  6. 6

    Improved support vector machine classification algorithm based on adaptive feature weight updating in the Hadoop cluster environment by Jianfang Cao (1881379)

    Published 2019
    “…The MapReduce parallel programming model on the Hadoop platform is used to perform an adaptive fusion of hue, local binary pattern (LBP) and scale-invariant feature transform (SIFT) features extracted from images to derive optimal combinations of weights. …”
  7. 7
  8. 8
  9. 9

    Sample image for illustration. 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. …”
  10. 10

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

    Steps in the extraction of 14 coordinates from the CT slices for the curved MPR. by Linus Woitke (22783534)

    Published 2025
    “…The image is then cleaned in c) using morphological filtering with an <i>opening</i> operation to remove small-scale noise. …”
  12. 12
  13. 13
  14. 14
  15. 15

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

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

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

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

    Published 2020
    “…If the identical blob that was detected in panel J (bottom) is found in any of the new subtracted binary images (cyan arrow), the animal is considered as having left its original position, and the algorithm continues. …”
  20. 20

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

    Published 2022
    “…The genetic algorithm then operated over 1000 iterations, applying crossover and mutation processes to optimize bee richness. …”