Search Results - (( java implementation path algorithm ) OR ( basic using matching algorithm ))

Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

“…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
Get full text
Get full text

Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

“…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
Get full text
Get full text

Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

“…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
Get full text
Get full text
Get full text
Get full text

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

“…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

Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

“…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
Get full text
Get full text

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

“…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

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

“…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

Disparity Refinement Based on Depth Image Layers Separation for Stereo Matching Algorithms by Abd Manap, Nurulfajar, Soraghan, John J.

“…This paper presents a method to improve the raw disparity maps in the disparity refinement stage for stereo matching algorithm. The proposed algorithm will use the disparity depth map from the stereo matching algorithm as initial disparity depth output with a basic similarity metric of SAD. …”
Get full text
Get full text
Get full text

Segmentation of Malay syllables in connected digit speech using statistical approach by Salam, M.S., Mohamad, Dzulkifli, Saleh, S.H.

“…This paper reports the finding of segmentation experiment using four criterions ie. the insertion, omissions, accuracy and segmentation match between the algorithms. …”
Get full text
Get full text
Get full text

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

“…Due to the center biased nature of the videos, the HPSO algorithm uses an initial pattern (hexagon-shaped) to speed up the convergence of the algorithm. …”
Get full text
Get full text

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

“…Step search (4SS), Diamond search (DS), Adaptive Rood Pattern Search (ARPS) and Cross-Diamond-Hexagonal search (CDHS). This algorithm basically employs two crossshaped search patterns consecutively in the very beginning steps and switch using diamond-shaped patterns. …”
Get full text
Get full text

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

“…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

Finger vein verification system using repeated line tracking and dimensionality reduction using PCA algorithms with SURF matching by Ei Wei., Ting, M. Z., Ibrahim, D.J., Mulvaney

Get full text
Get full text
Get full text

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

“…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

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

“…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

A fuzzy case-based reasoning model for software requirements specifications quality assessment by Mostafa S.A., Gunasekaran S.S., Khaleefah S.H., Mustapha A., Jubair M.A., Hassan M.H.

“…Additionally, for efficient cases retrieval in the CBR, relevant cases selection and nearest cases selection heuristic search algorithms are used in the system. Basically, the input to the relevant cases algorithm is the available cases in the system case base and the output is the relevant cases. …”

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

“…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

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

“…This framework adapted the methods used in the benchmark studies with additional components and modifications in some existing components to boost the matching performance. …”
Get full text
Get full text

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

“…There are two basic strategies in using hybrid GAs, Lamarckian and Baldwinian evolution. …”
Get full text
Get full text
Get full text

Examination timetable scheduling system (ETSS) / Fong Teng Heng by Fong, Teng Heng

“…ETSS uses Visual Basic 6.0 as a programming language. …”
Get full text
Get full text