Search Results - (( basic optimization system algorithm ) OR ( based optimization means algorithm ))
Search alternatives:
- optimization system »
- basic optimization »
- optimization means »
- system algorithm »
- means algorithm »
-
1
An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP
Published 2021“…To evaluate the proposed algorithm, the solutions to the TSP problem obtained from the proposed algorithm and swap sequence based PSO are compared in terms of the best solution, mean solution, and time taken to converge to the optimal solution. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
2
System identification using Extended Kalman Filter
Published 2017“…Basically, Extended Kalman Filter (EKF) generally was known as the optimal estimator for a dynamic system. …”
Get full text
Get full text
Student Project -
3
Development Of Double Stage Filter (DSF) On Stereo Matching Algorithm For 3D Computer Vision Applications
Published 2016“…Based on the results of evaluations, the results obtained by DSF is better than the algorithms, basic block matching and dynamic programming.…”
Get full text
Get full text
Get full text
Get full text
Thesis -
4
Noise Cancellation method in assistive listening system
Published 2020“…Those algorithms were Least Means Square, Normalize-Least Means Square, Recursive Least Square, Simple SetMembership Algorithm and Dynamic Set-Membership Affine Projection Algorithm. …”
Get full text
Get full text
Undergraduates Project Papers -
5
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 -
6
Even-odd scheduling based energy efficient routing for wireless sensor network (WSN) / Muhammad Zafar Iqbal Khan
Published 2022“…To achieve the task of a longer network lifetime and higher average node energy, we have proposed an energy-efficient routing protocol motivated from the concept of well-known Low Energy Adaptive Cluster Hierarchy routing algorithm also known as LEACH, and optimized it with the concept of alternate hitting, which means the even-odd scheduling-based routing. …”
Get full text
Get full text
Thesis -
7
Voting algorithms for large scale fault-tolerant systems
Published 2011“…In a nut shell, we tried to introduce voting algorithms and structures suitable for large scale fault-tolerant systems which have optimal and proper time complexity (in parallel voting algorithms) and more reliability and availability (in enhanced m-out-of-n voting algorithm) compared to the basic types.…”
Get full text
Get full text
Thesis -
8
A phonetically rich and balanced lexical corpus using zipfian distribution for an under resourced language / Aminath Farshana
Published 2018“…Since the similarity of the two distributions is close, it means that the optimized corpus can perform as efficient as the larger corpus. …”
Get full text
Get full text
Get full text
Thesis -
9
Particle swarm optimization (PSO) for CNC route problem
Published 2002“…The algorithm used in this project is the Global Best (gbest) algorithm where it is a basic algorithm of Particle Swarm Optimization which applicable the shortest time and path of CNC machine to complete the process of drilling. …”
Get full text
Get full text
Undergraduates Project Papers -
10
Optimal neural network approach for estimating state of energy of lithium-ion battery using heuristic optimization techniques
Published 2023Conference Paper -
11
Optimized clustering with modified K-means algorithm
Published 2021“…Among the techniques, the k-means algorithm is the most commonly used technique for determining optimal number of clusters (k). …”
Get full text
Get full text
Get full text
Get full text
Thesis -
12
Algorithm development for optimization of a refrigeration system
Published 2010“…This thesis deals with algorithm development for optimization of a refrigeration system. …”
Get full text
Get full text
Undergraduates Project Papers -
13
Optimal power flow based on fuzzy linear programming and modified Jaya algorithms
Published 2017“…Meanwhile, the proposed QOJaya algorithm produces better results than the basic Jaya method in terms of solution optimality and convergence speed. …”
Get full text
Get full text
Thesis -
14
Model of Improved a Kernel Fast Learning Network Based on Intrusion Detection System
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 -
15
-
16
A hybrid algorithm based on artificial bee colony and artificial rabbits optimization for solving economic dispatch problem
Published 2023“…This algorithm synergizes the ABC algorithm and Artificial Rabbits Optimization (ARO) algorithm. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
17
-
18
-
19
Impact of evolutionary algorithm on optimization of nonconventional machining process parameters
Published 2025“…This paper presents the optimization of laser beam machining in additive manufacturing of polymer-based material parameters, specifically focusing on cutting speed, gas pressure of nitrogen, and focal point locations, to achieve optimal mean surface roughness. …”
Get full text
Get full text
Get full text
Article -
20
Document clustering based on firefly algorithm
Published 2015“…Document clustering is widely used in Information Retrieval however, existing clustering techniques suffer from local optima problem in determining the k number of clusters.Various efforts have been put to address such drawback and this includes the utilization of swarm-based algorithms such as particle swarm optimization and Ant Colony Optimization.This study explores the adaptation of another swarm algorithm which is the Firefly Algorithm (FA) in text clustering.We present two variants of FA; Weight- based Firefly Algorithm (WFA) and Weight-based Firefly Algorithm II (WFAII).The difference between the two algorithms is that the WFAII, includes a more restricted condition in determining members of a cluster.The proposed FA methods are later evaluated using the 20Newsgroups dataset.Experimental results on the quality of clustering between the two FA variants are presented and are later compared against the one produced by particle swarm optimization, K-means and the hybrid of FA and -K-means. …”
Get full text
Get full text
Get full text
Article
