Search Results - (( java segmentation using algorithm ) OR ( based aggregation graph algorithm ))

Search alternatives:

  • Showing 1 - 6 results of 6
Refine Results
  1. 1
    Stereo Matching Algorithm Based On Per Pixel Difference Adjustment, Iterative Guided Filter And Graph Segmentation

    Stereo Matching Algorithm Based On Per Pixel Difference Adjustment, Iterative Guided Filter And Graph Segmentation by Hamzah, Rostam Affendi, Ibrahim, Haidi, Abu Hassan, Anwar Hasni

    Published 2017
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Image clustering comparison of two color segmentation techniques

    Image clustering comparison of two color segmentation techniques by Subramaniam, Kavitha Pichaiyan

    Published 2010
    “…Finally, the algorithm found, which would solve the image segmentation problem.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Local-based stereo matching algorithm using multi-cost pyramid fusion, hybrid random aggregation and hierarchical cluster-edge refinement

    Local-based stereo matching algorithm using multi-cost pyramid fusion, hybrid random aggregation and hierarchical cluster-edge refinement by Kadmin, Ahmad Fauzan

    Published 2023
    “…Then, a new proposed cost aggregation based on the Hybrid Random Aggregation (HA) was implemented that utilized modified Iterative Non-Local Guided Filter (iNLGF), Simple Linear Iterative Clustering (SLIC), Graph Segmentation (GS) and Extended Restart Random Walk (eRWR) for error reduction. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Automatic Number Plate Recognition on android platform: With some Java code excerpts

    Automatic Number Plate Recognition on android platform: With some Java code excerpts by ., Abdul Mutholib, Gunawan, Teddy Surya, Kartiwi, Mira

    Published 2016
    “…On the other hand, the traditional algorithm using template matching only obtained 83.65% recognition rate with 0.97 second processing time. …”
    Get full text
    Get full text
    Get full text
    Book
    Save to List
    Saved in:
  5. 5
    A maximal-clique-based clustering approach for multi-observer multi-view data by using k-nearest neighbor with S-pseudo-ultrametric induced by a fuzzy similarity

    A maximal-clique-based clustering approach for multi-observer multi-view data by using k-nearest neighbor with S-pseudo-ultrametric induced by a fuzzy similarity by Khameneh, Azadeh Zahedi, Ghaznavi, Mehrdad, Kilicman, Adem, Mahad, Zahari, Mardani, Abbas

    Published 2024
    “…To this end, we first build a k-nearest neighbor (kNN) directed graph using the proposed S-distance, then transform it into an undirected graph based on the neighborhood information of the nodes so that the resultant graph is characterized based on nodes interactions and initial features information of the nodes. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Development of seven segment display recognition using TensorFlow on Raspberry Pi

    Development of seven segment display recognition using TensorFlow on Raspberry Pi by Gunawan, Teddy Surya, Mohammad Reduwan, Haque, Yaacob, Mashkuri, Mohamed Azmin, Nor Fadhillah, Ismail, Nanang, Ismail, Md Yusof, Kartiwi, Mira, A. Rahman, Azhar

    Published 2022
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:

Search Tools: