Search Results - (( motion evaluation search algorithm ) OR ( swarm optimization _ algorithm ))*
Search alternatives:
- motion evaluation »
- evaluation search »
-
1
Performance evaluation of Black Hole Algorithm, Gravitational Search Algorithm and Particle Swarm Optimization
Published 2015“…Particle Swarm Optimization (PSO) and Gravitational Search Algorithm are a well known population-based heuristic optimization techniques. …”
Get full text
Get full text
Get full text
Article -
2
A review on particle swarm optimization algorithm and its variants to human motion tracking
Published 2014“…Several approaches have been proposed in the literature using different techniques.However, conventional approaches such as stochastic particle filtering have shortcomings in computational cost, slowness of convergence, suffers from the curse of dimensionality and demand a high number of evaluations to achieve accurate results. Particle swarm optimization (PSO) is a population-based globalized search algorithm which has been successfully applied to address human motion tracking problem and produced better results in high-dimensional search space.This paper presents a systematic literature survey on the PSO algorithm and its variants to human motion tracking. …”
Get full text
Get full text
Article -
3
Multi-state PSO GSA for solving discrete combinatorial optimization problems
Published 2016“…As a consequence, multi-state particle swarm optimization (MSPSO) and multi-state gravitational search algorithm (MSGSA) are developed. …”
Get full text
Get full text
Thesis -
4
Rule-Based Multi-State Gravitational Search Algorithm for Discrete Optimization Problem
Published 2015“…Gravitational search algorithm swarm (GSA) is a metaheuristic optimization algorithm, which is based on the Newton's law of gravity and the law of motion, has been successfully applied to solve various optimization problems in real-value search space. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
5
Variable block based motion estimation using hexagon diamond full search algorithm (HDFSA) via block subtraction technique
Published 2015“…To evaluate the performance of the developed algorithm, the average PSNR value, average search point and average elapsed processing time is calculated. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
6
Block based motion vector estimation using fuhs16 uhds16 and uhds8 algorithms for video sequence
Published 2011“…Full search (FS), three step search (TSS), new three step search (NTSS), diamond search (DS) and hexagon based search (HS) are the most well known block-matching algorithm. …”
Get full text
Get full text
Get full text
Book Chapter -
7
New Fast Block Matching Algorithm Using New Hybrid Search Pattern And Strategy To Improve Motion Estimation Process In Video Coding Technique
Published 2016“…There are 6 main designs that the algorithms proposed namely the Orthogonal-Diamond Search Algorithm with Small Diamond Search Pattern (ODS-SDSP), the Orthogonal-Diamond Search Algorithm with Large Diamond Search Pattern (ODS-LDSP), the Diamond-Orthogonal Search Algorithm with Small Diamond Pattern (DOS-SDSP), the Diamond-Orthogonal Search Algorithm with Large Diamond Pattern (DOS-LDSP), the Modified Diamond-Orthogonal Search Algorithm with Small Diamond Pattern (MDOS-SDSP), and the Modified Diamond-Orthogonal Search Algorithm with Large Diamond Pattern (MDOS-LDSP). …”
Get full text
Get full text
Get full text
Get full text
Thesis -
8
An enhancement particle-based method for dynamic object tracking
Published 2016“…Thus, to address the accuracy of object detection, we proposed a new method of dynamic template matching using Global best Local Neighborhood in Particle Swarm Optimization (GbLN-PSO). In this study, feature-based approach using a GbLN-PSO algorithm will be applied to search the minimum value of dynamic template matching process. …”
Get full text
Get full text
Thesis -
9
Block matching algorithms for motion estimation using modified Cross-Diamond-Hexagonal search / Abd Razak Mahmud
Published 2008“…A modified of Cross-Diamond-Hexagonal search (MCDHS) based on the Cross-Diamond-Hexagonal search (CDHS) is proposed to match or increase the performance of the Peak-signal-to-noise ratio (PSNR) and reduce the computational complexity of previous motion estimation techniques such as Three Step search (TSS), Simple and Efficient Three Step search (SESTSS), New Three Step search (NTSS), Four . …”
Get full text
Get full text
Thesis -
10
Normative Fish Swarm Algorithm For Global Optimization With Applications
Published 2019“…Referred to as Normative Fish Swarm Algorithm (NFSA), the proposed Fish Swarm Algorithm, Optimized by Particle Swarm Optimization with Extended Memory (PSOEM-FSA) is expanded by amalgamating the normative knowledge to provide supplementary guidelines for better global optimum achievement and convergence rate. …”
Get full text
Get full text
Thesis -
11
Empirical Study of Segment Particle Swarm Optimization and Particle Swarm Optimization Algorithms
Published 2019“…In this paper, the performance of segment particle swarm optimization (Se-PSO) algorithm was compared with that of original particle swarm optimization (PSO) algorithm. …”
Get full text
Get full text
Get full text
Article -
12
Improving Ant Swarm Optimization With Embedded Vaccination For Optimum Reducts Generation
Published 2011“…Ant Swarm Optimization refers to the hybridization of Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO) algorithms to enhance optimization performance. …”
Get full text
Get full text
Conference or Workshop Item -
13
HEURISTIC OPTIMIZATION OF BAT ALGORITHM FOR HETEROGENEOUS SWARMS USING PERCEPTION
Published 2023“…In this paper, we study the advantages of fusing the Meta-Heuristic Bat Algorithm with Heuristic Optimization. We have implemented the Meta- Heuristic Bat Algorithm and tested it on a heterogeneous swarm. …”
Get full text
Get full text
Article -
14
Enhanced Particle Swarm Optimization Algorithms With Robust Learning Strategy For Global Optimization
Published 2014“…Particle Swarm Optimization (PSO) is a metaheuristic search (MS) algorithm inspired by the social interactions of bird flocking or fish schooling in searching for food sources. …”
Get full text
Get full text
Thesis -
15
Sampling-based online motion planning for mobile robots: utilization of Tabu search and adaptive neuro-fuzzy inference system
Published 2019“…The performance of the proposed algorithm is evaluated through simulation in different motion planning queries. …”
Get full text
Get full text
Article -
16
Multi-State Particle Swarm Optimization for Discrete Combinatorial Optimization Problem
Published 2014“…The binary-based algorithms including the binary particle swarm optimization (BPSO) algorithm are proposed to solve discrete optimization problems. …”
Get full text
Get full text
Get full text
Article -
17
Improved particle swarm optimization by fast annealing algorithm
Published 2019“…The proposed algorithm is meant to solve high dimensional optimization problems based on two strategies, which are utilizing the particle swarm optimization to define the global search area and utilizing the fast-simulated annealing to refine the visited search area. …”
Get full text
Get full text
Get full text
Get full text
Proceeding Paper -
18
Improving robot Darwinian particle swarm optimization using quantum-behaved swarm theory for robot exploration and communication / Duaa Mehiar
Published 2021“…Despite the significance of the Robotic Darwinian Particle Swarm Optimization (RDPSO) algorithm on swarm-robot exploration and communication, there remain notable gaps such as premature and slow convergence, collisions between robots, and communication breaks and constraints. …”
Get full text
Get full text
Get full text
Thesis -
19
Comparison of swarm intelligence algorithms for high dimensional optimization problems
Published 2018“…This paper presents a comprehensive study of two swarm intelligence based algorithms: 1- particle swarm optimization (PSO), 2-cuckoo search (CS).The two algorithms are analyzed and compared for problems consisting of high dimensions in respect of solution accuracy, and runtime performance by various classes of benchmark functions.…”
Get full text
Get full text
Get full text
Get full text
Article -
20
