Search Results - (( process evaluation matching algorithm ) OR ( java application optimized algorithm ))

Refine Results
  1. 1

    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
  2. 2

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…The proposed algorithm can overcome stagnation problem, minimize processing time, match jobs with suitable resources, and balance entire resources in grid environment. …”
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3
  4. 4

    Evaluation of dynamic programming among the existing stereo matching algorithms by Teo, Chee Huat, Nurulfajar, Abd Manap

    Published 2015
    “…There are various types of existing stereo matching algorithms on image processing which applied on stereo vision images to get better results of disparity depth map. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Performance evaluation of automatic number plate recognition on android smartphone platform by Gunawan, Teddy Surya, Mutholib, Abdul, Kartiwi, Mira

    Published 2017
    “…On the other hand, the traditional algorithm using template matching only obtained 83.7% recognition rate with 0.98 second processing time. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    GPU-based odd and even hybrid string matching algorithm by Rahbari, Ghazal, Abdul Rashid, Nur’Aini, Husain, Wahidah

    Published 2016
    “…String matching is considered as one of the fundamental problems in computer science.Many computer applications provide the string matching utility for their users, and how fast one or more occurrences of a given pattern can be found in a text plays a prominent role in their user satisfaction.Although numerous algorithms and methods are available to solve the string matching problem, the remarkable increase in the amount of data which is produced and stored by modern computational devices demands researchers to find much more efficient ways for dealing with this issue.In this research, the Odd and Even (OE) hybrid string matching algorithm is redesigned to be executed on the Graphics Processing Unit (GPU), which can be utilized to reduce the burden of compute-intensive operations from the Central Processing Unit (CPU).In fact, capabilities of the GPU as a massively parallel processor are employed to enhance the performance of the existing hybrid string matching algorithms.Different types of data are used to evaluate the impact of parallelization and implementation of both algorithms on the GPU. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7
  8. 8

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
  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
  11. 11

    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
  12. 12

    Disparity map algorithm for stereo matching process using local based method by Gan, Melvin Yeou Wei

    Published 2022
    “…The proposed SVDM algorithm involves four stages which starts from matching cost computation. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

    Variable block based motion estimation using hexagon diamond full search algorithm (HDFSA) via block subtraction technique by Hardev Singh, Jitvinder Dev Singh

    Published 2015
    “…To evaluate the performance of the developed algorithm, the average PSNR value, average search point and average elapsed processing time is calculated. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

    A New Pre-Processing Technique For Computational Of Stereo Matching Algorithm by Kadmin, Ahmad Fauzan, Hamzah, Rostam Affendi, Abd Manap, Nurulfajar, Hamid, Mohd Saad

    Published 2021
    “…This paper presents a new composition of stereo vision algorithm for disparity map measurement from matching process. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
    Get full text
    Get full text
    Final Year Project
  16. 16

    Disparity Refinement Process Based On Ransac Plane Fitting For Machine Vision Applications by Hamzah, Rostam Affendi, Kadmin, Ahmad Fauzan, Abd Gani, Shamsul Fakhar, Hamid, Mohd Saad, Salam, Saifullah

    Published 2017
    “…This paper presents a new disparity map refinement process for stereo matching algorithm and the refinement stage that will be implemented by partitioning the place or mask image and re-projected to the preliminary disparity images. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Development Of Stereo-Matching Algorithm Based On Adaptive Weighted Prediction by Abd Razak, Siti Safwana

    Published 2019
    “…The experimental result on the proposed algorithm is able to reduce 17.4% of weighted average error for all and 9.62% of weighted average error for nonocc (nonoccluded) compared to others Stereo Matching Algorithm without the proposed framework. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19

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

    Published 2011
    “…To improve the UHDS16 algorithm, 8 × 8 block-matching technique has been tested. …”
    Get full text
    Get full text
    Get full text
    Book Chapter
  20. 20

    PRE AND POST PROCESSING APPROACHES FOR EFFICIENT FEATURE MATCHING PROCESS by MAT DAUD, MARIZUANA

    Published 2014
    “…In this paper, the accuracy of SURF feature descriptors used in feature matching between two input images of extreme illumination levels are evaluated. …”
    Get full text
    Get full text
    Thesis