Search Results - (( developing affecting matching algorithm ) OR ( java optimization path algorithm ))
Search alternatives:
- developing affecting »
- java optimization »
- optimization path »
- path algorithm »
- matching »
-
1
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019“…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
Thesis -
2
SecPath: Energy efficient path reconstruction in wireless sensor network using iterative smoothing
Published 2019“…This work uses iterative smoothing algorithm to find an alternative path with less distance and energy consumption. …”
Get full text
Get full text
Thesis -
3
Energy efficient path reconstruction in wireless sensor network using iPath
Published 2019“…This work uses iterative boosting algorithm to find an alternative path with less distance and energy consumption. …”
Get full text
Get full text
Get full text
Article -
4
Visdom: Smart guide robot for visually impaired people
Published 2025“…Core functionalities such as path planning, autonomous movement, voice feedback, and app-to-robot communication have been thoroughly tested and optimized. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
5
Development Of Stereo-Matching Algorithm Based On Adaptive Weighted Prediction
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 -
6
Scale-invariant and adaptive-search template matching for monocular visual odometry in low-textured environment
Published 2016“…Therefore, a new technique and algorithm were developed to resolve the image scale uncertainty. …”
Get full text
Get full text
Thesis -
7
Investigation And Development Of Flattening Algorithms For Curved Latent Fingerprint Images
Published 2015“…Algorithm that applies ellipse approximation provides better performance as compared with the algorithm that developed based on parabolic approximation. …”
Get full text
Get full text
Thesis -
8
-
9
Enhanced Image View Synthesis Using Multistage Hybrid Median Filter For Stereo Images
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 -
10
Detection and Recognition of Broken Character in Car Plate Image
Published 2020“…Therefore, this study is concerned to develop a tool with recognition algorithm that able to detect the broken character on car plate by using Template Matching. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
11
Adaptive template matching of photoplethysmogram pulses to detect motion artefact
Published 2018“…The developed algorithm was evaluated against a manually annotated 'gold standard' (GS). …”
Get full text
Get full text
Article -
12
DC-based PV-powered home energy system
Published 2017“…Therefore, this work proposes the design and development of a wireless low power consumption prototype energy monitoring system using a novel solar-battery charge controller based on the DC voltage matching concept. …”
Get full text
Get full text
Thesis -
13
Plant identification using combination of fuzzy c-means spatial pyramid matching, gist, multi-texton histogram and multiview dictionary learning
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
New filtering framework for web personalization search / Anitawati Mohd Lokman and Aishah Ahmad
Published 2012“…The Filtering framework provides foundation in developing the algorithm for searching tools. This algorithm can be implemented in both website and search engine.…”
Get full text
Get full text
Research Reports -
15
Hybrid dynamic scheduling model for flexible manufacturing system with machine availability and new job arrivals
Published 2015“…The BBO-VNS match-up algorithm manipulates the idle times on machines within the time horizon for assigning the affected operations by breakdown and/or newly arrived orders. …”
Get full text
Get full text
Thesis -
16
Development of automatic pest sampling and detection system for cash crops
Published 2019“…Different kernel functions such as disk, diamond, square, and sphere are used as matching functions for insect detection and counting algorithm. …”
Get full text
Get full text
Thesis -
17
SEDF: a spoofed email detection framework employed by a lightweight web browser plug-in for detecting the spoofed email / Al Ya@Geogiana Buja...[et al.]
Published 2014“…Boyer - Moore algorithm was claimed to be the fastest algorithm among the others. …”
Get full text
Get full text
Research Reports -
18
Evolutionary cost-cognizant regression test case prioritization for object-oriented programs
Published 2019“…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
Get full text
Get full text
Thesis -
19
Hybrid Artificial Bees Colony algorithms for optimizing carbon nanotubes characteristics
Published 2018“…Optimization is a crucial process to select the best parameters in single and multi-objective problems for manufacturing process.However,it is difficult to find an optimization algorithm that obtain the global optimum for every optimization problem.Artificial Bees Colony (ABC) is a well-known swarm intelligence algorithm in solving optimization problems.It has noticeably shown better performance compared to the state-of-art algorithms.This study proposes a novel hybrid ABC algorithm with β-Hill Climbing (βHC) technique (ABC-βHC) in order to enhance the exploitation and exploration process of the ABC in optimizing carbon nanotubes (CNTs) characteristics.CNTs are widely used in electronic and mechanical products due to its fascinating material with extraordinary mechanical,thermal,physical and electrical properties. …”
Get full text
Get full text
Get full text
Thesis -
20
Efficiency improvement of a standalone photovoltaic system using fuzzy-based maximum power point tracking algorithm
Published 2016“…The MPPT algorithms imply the optimal duty ratio to drive the matching converter for optimal maximum power tracking. …”
Get full text
Get full text
Thesis
