Optimization method for trajectory combination in surveillance video synopsis based on genetic algorithm

2015 ◽  
Vol 6 (5) ◽  
pp. 623-633 ◽  
Author(s):  
Ling Xu ◽  
Hailin Liu ◽  
Xinhua Yan ◽  
Shengping Liao ◽  
Xiaohong Zhang
Keyword(s):  
Genetic Algorithm ◽  
Optimization Method ◽  
Surveillance Video ◽  
Video Synopsis

Object-Based Surveillance Video Synopsis Using Genetic Algorithm

2017 ◽  
pp. 193-219
Author(s):  
Shefali Gandhi ◽  
Tushar V. Ratanpara
Keyword(s):  
Genetic Algorithm ◽  
Background Subtraction ◽  
Moving Objects ◽  
Time Lapse ◽  
Original Video ◽  
Surveillance Video ◽  
Time Activity ◽  
Video Synopsis ◽  
Object Based ◽  
Poisson Image Editing

Video synopsis provides representation of the long surveillance video, while preserving the essential activities of the original video. The activity in the original video is covered into a shorter period by simultaneously displaying multiple activities, which originally occurred at different time segments. As activities are to be displayed in different time segments than original video, the process begins with extracting moving objects. Temporal median algorithm is used to model background and foreground objects are detected using background subtraction method. Each moving object is represented as a space-time activity tube in the video. The concept of genetic algorithm is used for optimized temporal shifting of activity tubes. The temporal arrangement of tubes which results in minimum collision and maintains chronological order of events is considered as the best solution. The time-lapse background video is generated next, which is used as background for the synopsis video. Finally, the activity tubes are stitched on the time-lapse background video using Poisson image editing.

Object-Based Surveillance Video Synopsis Using Genetic Algorithm

2019 ◽  
pp. 857-883
Author(s):  
Shefali Gandhi ◽  
Tushar V. Ratanpara
Keyword(s):  
Genetic Algorithm ◽  
Background Subtraction ◽  
Moving Objects ◽  
Time Lapse ◽  
Original Video ◽  
Surveillance Video ◽  
Time Activity ◽  
Video Synopsis ◽  
Object Based ◽  
Poisson Image Editing

Video synopsis provides representation of the long surveillance video, while preserving the essential activities of the original video. The activity in the original video is covered into a shorter period by simultaneously displaying multiple activities, which originally occurred at different time segments. As activities are to be displayed in different time segments than original video, the process begins with extracting moving objects. Temporal median algorithm is used to model background and foreground objects are detected using background subtraction method. Each moving object is represented as a space-time activity tube in the video. The concept of genetic algorithm is used for optimized temporal shifting of activity tubes. The temporal arrangement of tubes which results in minimum collision and maintains chronological order of events is considered as the best solution. The time-lapse background video is generated next, which is used as background for the synopsis video. Finally, the activity tubes are stitched on the time-lapse background video using Poisson image editing.

scholarly journals Optimal Placement and Sizing of D-STATCOM in Radial and Meshed Distribution Networks Using a Discrete-Continuous Version of the Genetic Algorithm

Electronics ◽  
2021 ◽  
Vol 10 (12) ◽  
pp. 1452
Author(s):  
Cristian Mateo Castiblanco-Pérez ◽  
David Esteban Toro-Rodríguez ◽  
Oscar Danilo Montoya ◽  
Diego Armando Giral-Ramírez
Keyword(s):  
Genetic Algorithm ◽  
Objective Function ◽  
Programming Model ◽  
Distribution Networks ◽  
Optimization Method ◽  
Optimal Placement ◽  
Mixed Integer ◽  
Power Balance ◽  
Continuous Version ◽  
Discrete Part

In this paper, we propose a new discrete-continuous codification of the Chu–Beasley genetic algorithm to address the optimal placement and sizing problem of the distribution static compensators (D-STATCOM) in electrical distribution grids. The discrete part of the codification determines the nodes where D-STATCOM will be installed. The continuous part of the codification regulates their sizes. The objective function considered in this study is the minimization of the annual operative costs regarding energy losses and installation investments in D-STATCOM. This objective function is subject to the classical power balance constraints and devices’ capabilities. The proposed discrete-continuous version of the genetic algorithm solves the mixed-integer non-linear programming model that the classical power balance generates. Numerical validations in the 33 test feeder with radial and meshed configurations show that the proposed approach effectively minimizes the annual operating costs of the grid. In addition, the GAMS software compares the results of the proposed optimization method, which allows demonstrating its efficiency and robustness.

scholarly journals Optimization of a 3D-Printed Permanent Magnet Coupling Using Genetic Algorithm and Taguchi Method

Electronics ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 494
Author(s):  
Ekaterina Andriushchenko ◽  
Ants Kallaste ◽  
Anouar Belahcen ◽  
Toomas Vaimann ◽  
Anton Rassõlkin ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Taguchi Method ◽  
Permanent Magnet ◽  
Optimization Problems ◽  
Optimization Method ◽  
Taguchi Optimization ◽  
Torque Density ◽  
Electromagnetic Devices ◽  
3D Printed ◽  
Manufacturing Techniques

In recent decades, the genetic algorithm (GA) has been extensively used in the design optimization of electromagnetic devices. Despite the great merits possessed by the GA, its processing procedure is highly time-consuming. On the contrary, the widely applied Taguchi optimization method is faster with comparable effectiveness in certain optimization problems. This study explores the abilities of both methods within the optimization of a permanent magnet coupling, where the optimization objectives are the minimization of coupling volume and maximization of transmitted torque. The optimal geometry of the coupling and the obtained characteristics achieved by both methods are nearly identical. The magnetic torque density is enhanced by more than 20%, while the volume is reduced by 17%. Yet, the Taguchi method is found to be more time-efficient and effective within the considered optimization problem. Thanks to the additive manufacturing techniques, the initial design and the sophisticated geometry of the Taguchi optimal designs are precisely fabricated. The performances of the coupling designs are validated using an experimental setup.

scholarly journals A Two-Stage Mono- and Multi-Objective Method for the Optimization of General UPS Parallel Manipulators

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 543
Author(s):  
Alejandra Ríos ◽  
Eusebio E. Hernández ◽  
S. Ivvan Valdez
Keyword(s):  
Genetic Algorithm ◽  
Performance Metrics ◽  
Tracking Error ◽  
Parallel Manipulators ◽  
Optimization Method ◽  
Statistical Hypothesis ◽  
Two Stage ◽  
Multi Objective ◽  
Second Stage ◽  
Conflicting Objectives

This paper introduces a two-stage method based on bio-inspired algorithms for the design optimization of a class of general Stewart platforms. The first stage performs a mono-objective optimization in order to reach, with sufficient dexterity, a regular target workspace while minimizing the elements’ lengths. For this optimization problem, we compare three bio-inspired algorithms: the Genetic Algorithm (GA), the Particle Swarm Optimization (PSO), and the Boltzman Univariate Marginal Distribution Algorithm (BUMDA). The second stage looks for the most suitable gains of a Proportional Integral Derivative (PID) control via the minimization of two conflicting objectives: one based on energy consumption and the tracking error of a target trajectory. To this effect, we compare two multi-objective algorithms: the Multiobjective Evolutionary Algorithm based on Decomposition (MOEA/D) and Non-dominated Sorting Genetic Algorithm-III (NSGA-III). The main contributions lie in the optimization model, the proposal of a two-stage optimization method, and the findings of the performance of different bio-inspired algorithms for each stage. Furthermore, we show optimized designs delivered by the proposed method and provide directions for the best-performing algorithms through performance metrics and statistical hypothesis tests.

Structural Optimization of Composite Panel with Lamination Parameters and Equivalent Stiffness Laminate Method

2014 ◽  
Vol 496-500 ◽  
pp. 429-435
Author(s):  
Xiao Ping Zhong ◽  
Peng Jin
Keyword(s):  
Genetic Algorithm ◽  
Structural Optimization ◽  
Composite Structure ◽  
Optimization Procedure ◽  
Optimization Method ◽  
Composite Panel ◽  
Analysis Tool ◽  
Equivalent Stiffness ◽  
Lamination Parameters ◽  
Design Variables

Firstly, a two-level optimization procedure for composite structure is investigated with lamination parameters as design variables and MSC.Nastran as analysis tool. The details using lamination parameters as MSC.Nastran input parameters are presented. Secondly, with a proper equivalent stiffness laminate built to substitute for the lamination parameters, a two-level optimization method based on the equivalent stiffness laminate is proposed. Compared with the lamination parameters-based method, the layer thicknesses of the equivalent stiffness laminate are adopted as continuous design variables at the first level. The corresponding lamination parameters are calculated from the optimal layer thicknesses. At the second level, genetic algorithm (GA) is applied to identify an optimal laminate configuration to target the lamination parameters obtained. The numerical example shows that the proposed method without considering constraints of lamination parameters can obtain better optimal results.

Sign in / Sign up

Export Citation Format

Share Document