Search Results - (( java (coded OR code) genetic algorithm ) OR ( basic computing matching algorithm ))

Search alternatives:

Refine Results
  1. 1

    An approach for cross-site scripting detection and removal based on genetic algorithms. by Hydara, Isatou, Md Sultan, Abu Bakar, Zulzalil, Hazura, Admodisastro, Novia

    Published 2014
    “…In this paper, we propose to explore an approach based on genetic algorithms that will be able to detect and remove cross-site scripting vulnerabilities from the source code before an application is deployed. …”
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2

    Cross-site scripting detection based on an enhanced genetic algorithm by Hydara, Isatou, Md Sultan, Abu Bakar, Zulzalil, Hazura, Admodisastro, Novia Indriaty

    Published 2015
    “…In this paper, we propose to explore an approach based on genetic algorithms that will be able to detect cross-site scripting vulnerabilities in the source code before an application is deployed. …”
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

    An approach to improve detecting and removing cross- site scripting vulnerabilities in web applications by Hydara, Isatou

    Published 2015
    “…In this research, an approach has been proposed that explores the combination of genetic algorithms with static analysis, and a code replacement method to address the problem of XSS at the source code level. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Hybrid genetic algorithm for improving fault localization by Mahamad Zakaria, Muhammad Luqman, Sharif, Khaironi Yatim, Abd Ghani, Abdul Azim, Koh, Tieng Wei, Zulzalil, Hazura

    Published 2018
    “…Therefore, there is a need for a technique which able to localize a fault effectively with less number of mutants generated. Genetic algorithm (GA) is well known in finding an optimal solution to a problem while local search is capable of removing duplication. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5
  6. 6

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

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

    Published 2011
    “…Basically, the proposed of FUHS16, UHDS16 and UHDS8 algorithm produces the best motion vector estimation finding based on the block-based matching criteria. …”
    Get full text
    Get full text
    Get full text
    Book Chapter
  8. 8

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

    Hexagon pattern particle swarm optimization based block matching algorithm for motion estimation / Siti Eshah Che Osman by Che Osman, Siti Eshah

    Published 2019
    “…Block Matching Algorithm (BMA) is a technique used to minimize the computational complexity of motion estimation in video coding application. …”
    Get full text
    Get full text
    Thesis
  10. 10
  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
  13. 13
  14. 14

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

    A genetic similarity algorithm for searching the Gene Ontology terms and annotating anonymous protein sequences by M. Othman, Razib, Deris, Safaai, Md. IIlias, Rosli

    Published 2008
    “…The genetic similarity algorithm is implemented in the Gene Ontology browser named basic UTMGO to overcome the weaknesses of the existing Gene Ontology browsers which use a conventional approach based on keyword matching. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Block Matching Algorithm (BMA) of the Hybrid Adaptive Rood Pattern Search (ARPS) Based on Its Motion Speed by Faizul Hadi Jamil, Ali Chekima, Wong Hock Tze @ Farrah Wong, Rosalyn R Porle, Razak Ali Lee, Ismail Saad

    Published 2017
    “…There are several numbers famous proposed Block Matching Algorithm (BMA) in video coding technique and among it, the ARPS is a well known BMA technique that produce lower computational complexity and higher quality of the encoded video at the same time. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  17. 17
  18. 18
  19. 19
  20. 20

    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