Search Results - (( problem application matching algorithm ) OR ( using optimization method algorithm ))

Refine Results
  1. 1

    Simulated kalman filter (SKF) based image template matching for distance measurement by using stereo vision system by Nurnajmin Qasrina Ann, Ayop Azmi

    Published 2018
    “…That is why, image template matching problem is now considered as an optimization problem. …”
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

    Assisted History Matching by Using Genetic Algorithm and Discrete Cosine Transform by Abdul Rashid, Abdul Hadi

    Published 2014
    “…Overall, an algorithm showing the combination method of both GA and DCT was successfully developed. …”
    Get full text
    Get full text
    Final Year Project
  4. 4

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

    Published 2022
    “…Therefore, it is not suitable for real-time applications. However, local method solves the matching problem via a local analysis and aggregating matching costs over a support region at each pixel in the images. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    Hybrid firefly and particle swarm optimization algorithm for multi-objective optimal power flow with distributed generation by Khan, Abdullah

    Published 2022
    “…Thus, evaluating the applicability and performance of the HFPSO algorithm, it is evident that the proposed method provides a better tool to solve OPF problems of electric power networks. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Fingerprint verification using clonal selection algorithm / Farah Syadiyah Shamsudin by Shamsudin, Farah Syadiyah

    Published 2017
    “…Therefore, the aim for this project is to develop a new approach in the fingerprint verification system by applying Clonal Selection Algorithm (CSA) that is known to be good in pattern matching and optimization of problems. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Design Of Perturbative Hyper-Heuristics For Combinatorial Optimisation by Choong, Shin Siang

    Published 2019
    “…Approximation algorithm is a sub-class of techniques which is able to provide sub-optimal solution(s) with reasonable computational cost. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Disparity map algorithm using hierarchical of bitwise pixel differences and segment-tree from stereo image by Zainal Azali, Muhammad Nazmi

    Published 2024
    “…Local methods excel in solving matching problems through local-based analysis with fast execution and low computational demands. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    Combining Recursive Least Square and Principal Component Analysis for Assisted History Matching by Md. Anuar, Nurul Syaza

    Published 2014
    “…This project will study the applicability of the combined algorithm for history matching problem. …”
    Get full text
    Get full text
    Final Year Project
  10. 10

    Dissimilarity algorithm on conceptual graphs to mine text outliers by Kamaruddin, Siti Sakira, Hamdan, Abdul Razak, Abu Bakar, Azuraliza, Mat Nor, Fauzias

    Published 2009
    “…The graphical text representation method such as Conceptual Graphs (CGs) attempts to capture the structure and semantics of documents.As such, they are the preferred text representation approach for a wide range of problems namely in natural language processing, information retrieval and text mining.In a number of these applications, it is necessary to measure the dissimilarity (or similarity) between knowledge represented in the CGs.In this paper, we would like to present a dissimilarity algorithm to detect outliers from a collection of text represented with Conceptual Graph Interchange Format (CGIF).In order to avoid the NP-complete problem of graph matching algorithm, we introduce the use of a standard CG in the dissimilarity computation.We evaluate our method in the context of analyzing real world financial statements for identifying outlying performance indicators.For evaluation purposes, we compare the proposed dissimilarity function with a dice-coefficient similarity function used in a related previous work.Experimental results indicate that our method outperforms the existing method and correlates better to human judgements. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Iterative And Single-Step Solutions Of Two Dimensional Time-Domain Inverse Scattering Problem Featuring Ultra Wide Band Sensors by Binajjaj, Saeed Ali Saeed

    Published 2010
    “…First, the algorithms‘ performances were evaluated using numerical simulation employing two different scanning geometries: limited and full view scanning geometries, where the applicability of these algorithms was accessed by comparing the reconstructed images with actual model. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    Plant identification using combination of fuzzy c-means spatial pyramid matching, gist, multi-texton histogram and multiview dictionary learning by Safa, Soodabeh

    Published 2016
    “…Moreover, instead of concatenating feature vectors together and send to classifier, sparse coding and dictionary learning methods are used and instead of considering all features as one view (visual feature), K-SVD algorithm that is one of the famous algorithms for sparse representation is optimized and developed to multi-view model.The experimental results prove that the proposed methods has improved accuracy by 53.77% compared to concatenating features and classic K-SVD dictionary learning model as well.…”
    Get full text
    Get full text
    Thesis
  14. 14

    Assisted History Matching by Using Recursive Least Square and Discrete Cosine Transform by Abu Talib, Muhammad Ashraf

    Published 2014
    “…Thus, this project is carried to do assisted history matching and to determine whether Recursive least square as optimization method and Discrete cosine transform as parameter reduction method can be combined or not. …”
    Get full text
    Get full text
    Final Year Project
  15. 15

    Scheduling of the battery for peak shaving using Model Predictive Control (MPC) by Zainal Abidin, Siti Aisyah, Yusoff, Siti Hajar, Mansor, Hasmah, Mohd Sapihie, Siti Nadiah, Muhamad Fahmi, Muhammad Aqil Muqri

    Published 2023
    “…The MPC design will be done by using MATLAB as the main software as it is very ideal to simulate the peak shaving by using MPC optimization…”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  16. 16
  17. 17

    Online teleoperation of writing manipulator through graphics processing unit based accelerated stereo vision by Abu Raid, Fadi Imad Osman

    Published 2021
    “…Furthermore, the algorithms avoid computationally intensive correspondence problem by matching only the points of interest of a labeled pen to compute its position and orientation. …”
    Get full text
    Get full text
    Thesis
  18. 18

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