Search Results - (( using function method algorithm ) OR ( basic evaluation matching algorithm ))

Refine Results
  1. 1

    Stereo matching algorithm using census transform and segment tree for depth estimation by Hamzah, Rostam Affendi, Zainal Azali, Muhammad Nazmi, Mohd Noh, Zarina, Tengku Wook, Tg Mohd Faisal, Zainal Abidin, Izwan

    Published 2023
    “…This article proposes an algorithm for stereo matching corresponding process that will be used in many applications such as augmented reality, autonomous vehicle navigation and surface reconstruction. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Online food ordering application using Boyer-Moore algorithm / Muhammad Zulhilmie Dzulkifli by Dzulkifli, Muhammad Zulhilmie

    Published 2021
    “…The main goal of this study is to create an online food ordering app using the corresponding Boyer-Moore string matching algorithm. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Development Of Double Stage Filter (DSF) On Stereo Matching Algorithm For 3D Computer Vision Applications by Teo, Chee Huat

    Published 2016
    “…Based on the results of evaluations, the results obtained by DSF is better than the algorithms, basic block matching and dynamic programming.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    Fingerprint Image Compression Using Wavelet Transform by Hanashi, Abdalla Musbah

    Published 2003
    “…In fact, wavelet refers to a set of basic function, which is recursively defined form, a set of scaling coefficients and scaling function. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Evaluation of stereo matching algorithms and dynamic programming for 3D triangulation by Teo, Chee Huat, Manap, Nurulfajar

    Published 2015
    “…The stereo matching algorithms that we applied for experimental purpose are basic block matching, sub-pixel accuracy and dynamic programming. …”
    Get full text
    Get full text
    Book Chapter
  6. 6

    Evaluation Of Stereo Matching Algorithms And Dynamic Programming For 3D Triangulation by Teo , Chee Huat, Abd Manap, Nurulfajar

    Published 2014
    “…The stereo matching algorithms that we applied for experimental purpose are basic block matching, sub-pixel accuracy and dynamic programming. …”
    Get full text
    Get full text
    Get full text
    Book Chapter
  7. 7

    Block based motion vector estimation using fuhs16 uhds16 and uhds8 algorithms for video sequence by S. S. S. , Ranjit

    Published 2011
    “…On the theoretical side, four fundamental issues are explored: (1) division of frame, (2) basic block-based matching, (3) motion vector estimation, and (4) block-matching algorithm development. …”
    Get full text
    Get full text
    Get full text
    Book Chapter
  8. 8
  9. 9

    Instance matching framework for heterogeneous semantic web content over linked data environment by Mansir, Abubakar

    Published 2021
    “…The evaluation is performed on real-world datasets provided in different Ontology Alignment Evaluation Initiative (OAEI) campaign as benchmark data for instance matching track evaluation. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Enhanced Image View Synthesis Using Multistage Hybrid Median Filter For Stereo Images by Ali Hussein Aboali, Maged Yahya

    Published 2018
    “…Disparity depth map estimation of stereo matching algorithm is one of the most active research topics in computer vision.In the field of image processing,many existing stereo matching algorithms to obtain disparity depth map are developed and designed with low accuracy.To improve the accuracy of disparity depth map is quite challenging and difficult especially with uncontrolled dynamic environment.The accuracy is affected by many unwanted aspects including random noises,horizontal streaks,low texture,depth map non-edge preserving, occlusion,and depth discontinuities.Thus,this research proposed a new robust method of hybrid stereo matching algorithm with significant accuracy of computation.The thesis will present in detail the development,design, and analysis of performance on Multistage Hybrid Median Filter (MHMF).There are two main parts involved in our developed method which combined in two main stages.Stage 1 consists of the Sum of Absolute Differences (SAD) from Basic Block Matching (BBM) algorithm and the part of Scanline Optimization (SO) from Dynamic Programming (DP) algorithm.While,Stage 2 is the main core of our MHMF as a post-processing step which included segmentation,merging, and hybrid median filtering.The significant feature of the post-processing step is on its ability to handle efficiently the unwanted aspects obtained from the raw disparity depth map on the step of optimization.In order to remove and overcome the challenges unwanted aspects, the proposed MHMF has three stages of filtering process along with the developed approaches in Stage 2 of MHMF algorithm.There are two categories of evaluation performed on the obtained disparity depth map: subjective evaluation and objective evaluation.The objective evaluation involves the evaluation on Middlebury Stereo Vision system and evaluation using traditional methods such as Mean Square Errors (MSE),Peak to Signal Noise Ratio (PSNR) and Structural Similarity Index Metric (SSIM).Based on the results of the standard benchmarking datasets from Middlebury,the proposed algorithm is able to reduce errors of non-occluded and all errors respectively.While,the subjective evaluation is done for datasets captured from MV BLUE FOX camera using human's eyes perception.Based on the results,the proposed MHMF is able to obtain accurate results, specifically 69% and 71% of non-occluded and all errors for disparity depth map, and it outperformed some of the existing methods in the literature such as BBM and DP algorithms.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    Block matching algorithms for motion estimation using modified Cross-Diamond-Hexagonal search / Abd Razak Mahmud by Mahmud, Abd Razak

    Published 2008
    “…The fast search for ME techniques have their own shapes or patterns to work with in order to produce the best matching algorithm. The shape is actually representing the number of candidate need to be evaluated and fewer numbers of candidates will reduce the complexity of computational yet trying to keep a good block matching. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Comparison between Lamarckian Evolution and Baldwin Evolution of neural network by Taha, Imad, Inazy, Qabas

    Published 2006
    “…Hybrid genetic algorithms are the combination of learning algorithms(Back propagation), usually working as evaluation functions, and genetic algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13
  14. 14

    Finding the root of nonlinear function using five bracketing method / Nur Afiqah Mohamed Azhar by Mohamed Azhar, Nur Afiqah

    Published 2019
    “…Therefore, numerical method in the form of bracketing method is often used to find only the approximate root of the function. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Gravitational search – bat algorithm for solving single and bi-objective of non-linear functions by Abbas, Iraq Tareq

    Published 2018
    “…The second technique is to solve bi-objective functions by using the BOBAT algorithm. The third technique is an integration of BOGSA with BOBAT to produce a BOGSBAT algorithm. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Determining the preprocessing clustering algorithm in radial basis function neural network by S.L. Ang, H.C. Ong, H.C. Law

    Published 2008
    “…Three types of method used in this study to find the centres include random selections, K-means clustering algorithm and also K-median clustering algorithm. …”
    Get full text
    Get full text
    Article
  17. 17

    Genetic Algorithms In Optimizing Membership Function For Fuzzy Logic Controller by Ismail, H. Muh Yusuf

    Published 2010
    “…Thus it is important to select the accurate membership functions but these methods possess one common weakness where conventional FLC use membership function and control rules generated by human operator. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    The efficiency of conjugate gradient methods with global convergence / Siti Nur Hafiza Shamsudin by Shamsudin, Siti Nur Hafiza

    Published 2019
    “…The global convergence result is established using exact line searches. Numerical result shows that algorithm 2 which is one of the proposed CG methods is more efficiency when compared to other algorithms.…”
    Get full text
    Get full text
    Thesis
  19. 19

    Statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm by Dalatu, Paul Inuwa

    Published 2018
    “…It shows that the IQR-HEOM method is more efficient to rectify the problem caused by using range in HEOM. …”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20