Search Results - (( using optimization method algorithm ) OR ( basic computing (matching OR machine) algorithm ))*

Refine Results
  1. 1

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

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

    Published 2011
    “…In addition, the mentioned block-matching algorithms are the baseline techniques that have been used to further develop all the enhanced or improved algorithms. …”
    Get full text
    Get full text
    Get full text
    Book Chapter
  3. 3

    Model of Improved a Kernel Fast Learning Network Based on Intrusion Detection System by Ali, Mohammed Hasan, Mohamed Fadli, Zolkipli

    Published 2019
    “…In this paper, the particle swan optimization algorithm (PSO) was used to obtain an optimal set of initial parameters for Reduce Kernel FLN (RK-FLN), thus, creating an optimal RKFLN classifier named PSO-RKELM. …”
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4

    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
    “…Fundamentally, the framework input is the stereo image which represents left and right images respectively. The proposed algorithm in this article has four steps in total, which starts with the matching cost computation using census transform, cost aggregation utilizes segment-tree, optimization using winner-takes-all (WTA) strategy, and post-processing stage uses weighted median filter. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

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

    Development of cell formation algorithm and model for cellular manufacturing system by Nouri, Hossein

    Published 2011
    “…The results show proposed algorithm approximately solved problems averagely 22% better in terms of find feasible optimal solutions depends of various performance measures in 72.2% of computational time than other previous considered key algorithms.…”
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8

    Metaheuristic-Based Neural Network Training And Feature Selector For Intrusion Detection by Ghanem, Waheed Ali Hussein Mohammed

    Published 2019
    “…Those problems lend themselves to the realm of optimization. Considering the wide success of swarm intelligence methods in optimization problems, the main objective of this thesis is to contribute to the improvement of intrusion detection technology through the application of swarm-based optimization techniques to the basic problems of selecting optimal packet features, and optimal training of neural networks on classifying those features into normal and attack instances. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Towards large scale unconstrained optimization by Abu Hassan, Malik

    Published 2007
    “…We also attempt to construct a new matrix-storage free which uses the SR1 update (MF-SR1). The MF-SR1 method is more superior than the MF-BFGS method in some problems. …”
    Get full text
    Get full text
    Get full text
    Inaugural Lecture
  10. 10
  11. 11

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

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

    Fractal coding of bio-metric image for face authentication by Ahadullah, Md

    Published 2021
    “…This thesis implements the algorithms for the Methods of CPM, BPBM fractal coding, and its application. …”
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15

    Enhancement of network security by use machine learning by Hasan, Ahmed Raheem

    Published 2019
    “…From the analysis in the simulation results, one can see that the ANNDL is the best algorithm of machine learning process. This method uses many layers to compute or process the data. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    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
  18. 18
  19. 19
  20. 20