Search results for: Shuffled frog Leaping Algorithm (SFLA)
906 An Evolutionary Algorithm for Optimal Fuel-Type Configurations in Car Lines
Authors: Charalampos Saridakis, Stelios Tsafarakis
Abstract:
Although environmental concern is on the rise across Europe, current market data indicate that adoption rates of environmentally friendly vehicles remain extremely low. Against this background, the aim of this paper is to a) assess preferences of European consumers for clean-fuel cars and their characteristics and b) design car lines that optimize the combination of fuel types among models in the line-up. In this direction, the authors introduce a new evolutionary mechanism and implement it to stated-preference data derived from a large-scale choice-based conjoint experiment that measures consumer preferences for various factors affecting clean-fuel vehicle (CFV) adoption. The proposed two-step methodology provides interesting insights into how new and existing fuel-types can be combined in a car line that maximizes customer satisfaction.Keywords: Clean-fuel vehicles, product line design, conjoint analysis, choice experiment, differential evolution.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 999905 Towards for Admission Control in WIMAX Relay Station Mesh Network for Mobile Stations out of Coverage Using Ad-Hoc
Authors: Anas Majeed, A. A. Zaidan, B. B. Zaidan, Laiha Mat Kiah
Abstract:
WIMAX relay station mesh network has been approved by IEEE 802.16j as a standard to provide a highly data rate transmission, the RS was implemented to extend the coverage zone of the BS, for instance the MSs previously were out of the coverage of the BS they become in the coverage of the RS, therefore these MSs can have Admission control from the BS through the RS. This paper describe a problem in the mesh network Relay station, for instance the problem of how to serve the mobile stations (MSs) which are out of the Relay station coverage. This paper also proposed a solution for mobile stations out of the coverage of the WIMAX Relay stations mesh Network. Therefore Ad-hoc network defined as a solution by using its admission control schema and apply it on the mobiles inside and outside the Relay station coverage.
Keywords: WIMAX, relay station, mesh network, ad-hoc, WiFi, generic algorithm.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1758904 Remaining Useful Life Prediction Using Elliptical Basis Function Network and Markov Chain
Authors: Yi Yu, Lin Ma, Yong Sun, Yuantong Gu
Abstract:
This paper presents a novel method for remaining useful life prediction using the Elliptical Basis Function (EBF) network and a Markov chain. The EBF structure is trained by a modified Expectation-Maximization (EM) algorithm in order to take into account the missing covariate set. No explicit extrapolation is needed for internal covariates while a Markov chain is constructed to represent the evolution of external covariates in the study. The estimated external and the unknown internal covariates constitute an incomplete covariate set which are then used and analyzed by the EBF network to provide survival information of the asset. It is shown in the case study that the method slightly underestimates the remaining useful life of an asset which is a desirable result for early maintenance decision and resource planning.Keywords: Elliptical Basis Function Network, Markov Chain, Missing Covariates, Remaining Useful Life
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1662903 Learning Process Enhancement for Robot Behaviors
Authors: Saeed Mohammed Baneamoon, Rosalina Abdul Salam, Abdullah Zawawi Hj. Talib
Abstract:
Designing a simulated system and training it to optimize its tasks in simulated environment helps the designers to avoid problems that may appear when designing the system directly in real world. These problems are: time consuming, high cost, high errors percentage and low efficiency and accuracy of the system. The proposed system will investigate and improve the efficiency and accuracy of a simulated robot to choose correct behavior to perform its task. In this paper, machine learning, which uses genetic algorithm, is adopted. This type of machine learning is called genetic-based machine learning in which a distributed classifier system is used to improve the efficiency and accuracy of the robot. Consequently, it helps the robot to achieve optimal action.Keywords: Machine Learning, Genetic-Based MachineLearning, Learning Classifier System, Behaviors.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1529902 Face Recognition Using Morphological Shared-weight Neural Networks
Authors: Hossein Sahoolizadeh, Mahdi Rahimi, Hamid Dehghani
Abstract:
We introduce an algorithm based on the morphological shared-weight neural network. Being nonlinear and translation-invariant, the MSNN can be used to create better generalization during face recognition. Feature extraction is performed on grayscale images using hit-miss transforms that are independent of gray-level shifts. The output is then learned by interacting with the classification process. The feature extraction and classification networks are trained together, allowing the MSNN to simultaneously learn feature extraction and classification for a face. For evaluation, we test for robustness under variations in gray levels and noise while varying the network-s configuration to optimize recognition efficiency and processing time. Results show that the MSNN performs better for grayscale image pattern classification than ordinary neural networks.Keywords: Face recognition, Neural Networks, Multi-layer Perceptron, masking.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1516901 A Reconfigurable Processing Element for Cholesky Decomposition and Matrix Inversion
Authors: Aki Happonen, Adrian Burian, Erwin Hemming
Abstract:
Fixed-point simulation results are used for the performance measure of inverting matrices by Cholesky decomposition. The fixed-point Cholesky decomposition algorithm is implemented using a fixed-point reconfigurable processing element. The reconfigurable processing element provides all mathematical operations required by Cholesky decomposition. The fixed-point word length analysis is based on simulations using different condition numbers and different matrix sizes. Simulation results show that 16 bits word length gives sufficient performance for small matrices with low condition number. Larger matrices and higher condition numbers require more dynamic range for a fixedpoint implementation.Keywords: Cholesky Decomposition, Fixed-point, Matrix inversion, Reconfigurable processing.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1694900 Optimal Feedback Linearization Control of PEM Fuel Cell
Authors: E. Shahsavari, R. Ghasemi, A. Akramizadeh
Abstract:
This paper presents a new method to design nonlinear feedback linearization controller for PEMFCs (Polymer Electrolyte Membrane Fuel Cells). A nonlinear controller is designed based on nonlinear model to prolong the stack life of PEMFCs. Since it is known that large deviations between hydrogen and oxygen partial pressures can cause severe membrane damage in the fuel cell, feedback linearization is applied to the PEMFC system so that the deviation can be kept as small as possible during disturbances or load variations. To obtain an accurate feedback linearization controller, tuning the linear parameters are always important. So in proposed study NSGA (Non-Dominated Sorting Genetic Algorithm)-II method was used to tune the designed controller in aim to decrease the controller tracking error. The simulation result showed that the proposed method tuned the controller efficiently.
Keywords: Feedback Linearization controller, NSGA, Optimal Control, PEMFC.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2248899 Using Single Decision Tree to Assess the Impact of Cutting Conditions on Vibration
Authors: S. Ghorbani, N. I. Polushin
Abstract:
Vibration during machining process is crucial since it affects cutting tool, machine, and workpiece leading to a tool wear, tool breakage, and an unacceptable surface roughness. This paper applies a nonparametric statistical method, single decision tree (SDT), to identify factors affecting on vibration in machining process. Workpiece material (AISI 1045 Steel, AA2024 Aluminum alloy, A48-class30 Gray Cast Iron), cutting tool (conventional, cutting tool with holes in toolholder, cutting tool filled up with epoxy-granite), tool overhang (41-65 mm), spindle speed (630-1000 rpm), feed rate (0.05-0.075 mm/rev) and depth of cut (0.05-0.15 mm) were used as input variables, while vibration was the output parameter. It is concluded that workpiece material is the most important parameters for natural frequency followed by cutting tool and overhang.Keywords: Cutting condition, vibration, natural frequency, decision tree, CART algorithm.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1434898 Using Historical Data for Stock Prediction of a Tech Company
Authors: Sofia Stoica
Abstract:
In this paper, we use historical data to predict the stock price of a tech company. To this end, we use a dataset consisting of the stock prices over the past five years of 10 major tech companies: Adobe, Amazon, Apple, Facebook, Google, Microsoft, Netflix, Oracle, Salesforce, and Tesla. We implemented and tested three models – a linear regressor model, a k-nearest neighbor model (KNN), and a sequential neural network – and two algorithms – Multiplicative Weight Update and AdaBoost. We found that the sequential neural network performed the best, with a testing error of 0.18%. Interestingly, the linear model performed the second best with a testing error of 0.73%. These results show that using historical data is enough to obtain high accuracies, and a simple algorithm like linear regression has a performance similar to more sophisticated models while taking less time and resources to implement.
Keywords: Finance, machine learning, opening price, stock market.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 662897 Low-Complexity Channel Estimation Algorithm for MIMO-OFDM Systems
Authors: Ali Beydoun, Hamzé H. Alaeddine
Abstract:
One of the main challenges in MIMO-OFDM system to achieve the expected performances in terms of data rate and robustness against multi-path fading channels is the channel estimation. Several methods were proposed in the literature based on either least square (LS) or minimum mean squared error (MMSE) estimators. These methods present high implementation complexity as they require the inversion of large matrices. In order to overcome this problem and to reduce the complexity, this paper presents a solution that benefits from the use of the STBC encoder and transforms the channel estimation process into a set of simple linear operations. The proposed method is evaluated via simulation in AWGN-Rayleigh fading channel. Simulation results show a maximum reduction of 6.85% of the bit error rate (BER) compared to the one obtained with the ideal case where the receiver has a perfect knowledge of the channel.Keywords: Channel estimation, MIMO, OFDM, STBC, CAZAC sequence.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 881896 Impact of the Decoder Connection Schemes on Iterative Decoding of GPCB Codes
Authors: Fouad Ayoub, Mohammed Lahmer, Mostafa Belkasmi, El Houssine Bouyakhf
Abstract:
In this paper we present a study of the impact of connection schemes on the performance of iterative decoding of Generalized Parallel Concatenated block (GPCB) constructed from one step majority logic decodable (OSMLD) codes and we propose a new connection scheme for decoding them. All iterative decoding connection schemes use a soft-input soft-output threshold decoding algorithm as a component decoder. Numerical result for GPCB codes transmitted over Additive White Gaussian Noise (AWGN) channel are provided. It will show that the proposed scheme is better than Hagenauer-s scheme and Lucas-s scheme [1] and slightly better than the Pyndiah-s scheme.
Keywords: Generalized parallel concatenated block codes, OSMLD codes, threshold decoding, iterative decoding scheme, and performance.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1746895 Conditions for Model Matching of Switched Asynchronous Sequential Machines with Output Feedback
Authors: Jung–Min Yang
Abstract:
Solvability of the model matching problem for input/output switched asynchronous sequential machines is discussed in this paper. The control objective is to determine the existence condition and design algorithm for a corrective controller that can match the stable-state behavior of the closed-loop system to that of a reference model. Switching operations and correction procedures are incorporated using output feedback so that the controlled switched machine can show the desired input/output behavior. A matrix expression is presented to address reachability of switched asynchronous sequential machines with output equivalence with respect to a model. The presented reachability condition for the controller design is validated in a simple example.Keywords: Asynchronous sequential machines, corrective control, model matching, input/output control.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1479894 Adaptive Gaussian Mixture Model for Skin Color Segmentation
Authors: Reza Hassanpour, Asadollah Shahbahrami, Stephan Wong
Abstract:
Skin color based tracking techniques often assume a static skin color model obtained either from an offline set of library images or the first few frames of a video stream. These models can show a weak performance in presence of changing lighting or imaging conditions. We propose an adaptive skin color model based on the Gaussian mixture model to handle the changing conditions. Initial estimation of the number and weights of skin color clusters are obtained using a modified form of the general Expectation maximization algorithm, The model adapts to changes in imaging conditions and refines the model parameters dynamically using spatial and temporal constraints. Experimental results show that the method can be used in effectively tracking of hand and face regions.Keywords: Face detection, Segmentation, Tracking, Gaussian Mixture Model, Adaptation.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2415893 A Method for Analysis of Industrial Distributed Embedded Systems
Authors: Dmitry A. Mikoyelov
Abstract:
The paper presents a set of guidelines for analysis of industrial embedded distributed systems and introduces a mathematical model derived from these guidelines. In this study, the author examines a set of modern communication technologies that are or possibly can be used to build communication links between the subsystems of a distributed embedded system. An investigation of these guidelines results in a algorithm for analysis of specific use cases of target technologies. A goal of the paper acts as an important base for ongoing research on comparison of communication technologies. The author describes the principles of the model and presents results of the test calculations. Practical implementation of target technologies and empirical experiment data are based on a practical experience during the design and test of specific distributed systems in Latvian market.
Keywords: Distributed embedded system, analytical model, communication technology.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1520892 Deterministic Method to Assess Kalman Filter Passive Ranging Solution Reliability
Authors: Ronald M. Yannone
Abstract:
For decades, the defense business has been plagued by not having a reliable, deterministic method to know when the Kalman filter solution for passive ranging application is reliable for use by the fighter pilot. This has made it hard to accurately assess when the ranging solution can be used for situation awareness and weapons use. To date, we have used ad hoc rules-of-thumb to assess when we think the estimate of the Kalman filter standard deviation on range is reliable. A reliable algorithm has been developed at BAE Systems Electronics & Integrated Solutions that monitors the Kalman gain matrix elements – and a patent is pending. The “settling" of the gain matrix elements relates directly to when we can assess the time when the passive ranging solution is within the 10 percent-of-truth value. The focus of the paper is on surface-based passive ranging – but the method is applicable to airborne targets as well.Keywords: Electronic warfare, extended Kalman filter (EKF), fighter aircraft, passive ranging, track convergence.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2064891 Model Predictive Control of Gantry Crane with Input Nonlinearity Compensation
Authors: Steven W. Su , Hung Nguyen, Rob Jarman, Joe Zhu, David Lowe, Peter McLean, Shoudong Huang, Nghia T. Nguyen, Russell Nicholson, Kaili Weng
Abstract:
This paper proposed a nonlinear model predictive control (MPC) method for the control of gantry crane. One of the main motivations to apply MPC to control gantry crane is based on its ability to handle control constraints for multivariable systems. A pre-compensator is constructed to compensate the input nonlinearity (nonsymmetric dead zone with saturation) by using its inverse function. By well tuning the weighting function matrices, the control system can properly compromise the control between crane position and swing angle. The proposed control algorithm was implemented for the control of gantry crane system in System Control Lab of University of Technology, Sydney (UTS), and achieved desired experimental results.Keywords: Model Predictive Control, Control constraints, Input nonlinearity compensation, Overhead gantry crane.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1987890 Heuristic Set-Covering-Based Postprocessing for Improving the Quine-McCluskey Method
Authors: Miloš Šeda
Abstract:
Finding the minimal logical functions has important applications in the design of logical circuits. This task is solved by many different methods but, frequently, they are not suitable for a computer implementation. We briefly summarise the well-known Quine-McCluskey method, which gives a unique procedure of computing and thus can be simply implemented, but, even for simple examples, does not guarantee an optimal solution. Since the Petrick extension of the Quine-McCluskey method does not give a generally usable method for finding an optimum for logical functions with a high number of values, we focus on interpretation of the result of the Quine-McCluskey method and show that it represents a set covering problem that, unfortunately, is an NP-hard combinatorial problem. Therefore it must be solved by heuristic or approximation methods. We propose an approach based on genetic algorithms and show suitable parameter settings.
Keywords: Boolean algebra, Karnaugh map, Quine-McCluskey method, set covering problem, genetic algorithm.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2792889 Coefficient of Parentage for Crop Hybridization
Authors: Manpreet Singh, Parvinder Singh Sandhu, Basant Raj Singh
Abstract:
Hybridization refers to the crossing breeding of two plants. Coefficient of Parentage (COP) is used by the plant breeders to determine the genetic diversity across various varieties so as to incorporate the useful characters of the two varieties to develop a new crop variety with particular useful characters. Genetic Diversity is the prerequisite for any cultivar development program. Genetic Diversity depends upon the pedigree information of the varieties based on particular levels. Pedigree refers to the parents of a particular variety at various levels. This paper discusses the searching and analyses of different possible pairs of varieties selected on the basis of morphological characters, Climatic conditions and Nutrients so as to obtain the most optimal pair that can produce the required crossbreed variety. An algorithm was developed to determine the coefficient of parentage (COP) between the selected wheat varieties. Dummy values were used wherever actual data was not available.Keywords: Coefficient of Parentage, Morphological characters, Pedigree, Genetic Diversity.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1956888 Inter-frame Collusion Attack in SS-N Video Watermarking System
Authors: Yaser Mohammad Taheri, Alireza Zolghadr–asli, Mehran Yazdi
Abstract:
Video watermarking is usually considered as watermarking of a set of still images. In frame-by-frame watermarking approach, each video frame is seen as a single watermarked image, so collusion attack is more critical in video watermarking. If the same or redundant watermark is used for embedding in every frame of video, the watermark can be estimated and then removed by watermark estimate remodolulation (WER) attack. Also if uncorrelated watermarks are used for every frame, these watermarks can be washed out with frame temporal filtering (FTF). Switching watermark system or so-called SS-N system has better performance against WER and FTF attacks. In this system, for each frame, the watermark is randomly picked up from a finite pool of watermark patterns. At first SS-N system will be surveyed and then a new collusion attack for SS-N system will be proposed using a new algorithm for separating video frame based on watermark pattern. So N sets will be built in which every set contains frames carrying the same watermark. After that, using WER attack in every set, N different watermark patterns will be estimated and removed later.
Keywords: Watermark estimation remodulation (WER), Frame Temporal Averaging (FTF), switching watermark system.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1496887 Social, Group and Individual Mind extracted from Rule Bases of Multiple Agents
Authors: P. Cermak
Abstract:
This paper shows possibility of extraction Social, Group and Individual Mind from Multiple Agents Rule Bases. Types those Rule bases are selected as two fuzzy systems, namely Mambdani and Takagi-Sugeno fuzzy system. Their rule bases are describing (modeling) agent behavior. Modifying of agent behavior in the time varying environment will be provided by learning fuzzyneural networks and optimization of their parameters with using genetic algorithms in development system FUZNET. Finally, extraction Social, Group and Individual Mind from Multiple Agents Rule Bases are provided by Cognitive analysis and Matching criterion.Keywords: Mind, Multi-agent system, Cognitive analysis, Fuzzy system, Neural network, Genetic algorithm, Rule base.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1253886 Design of an M-Channel Cosine Modulated Filter Bank by New Cosh Window Based FIR Filters
Authors: Jyotsna Ogale, Alok Jain
Abstract:
In this paper newly reported Cosh window function is used in the design of prototype filter for M-channel Near Perfect Reconstruction (NPR) Cosine Modulated Filter Bank (CMFB). Local search optimization algorithm is used for minimization of distortion parameters by optimizing the filter coefficients of prototype filter. Design examples are presented and comparison has been made with Kaiser window based filterbank design of recently reported work. The result shows that the proposed design approach provides lower distortion parameters and improved far-end suppression than the Kaiser window based design of recent reported work.Keywords: Window function, Cosine modulated filterbank, Local search optimization.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2600885 Capacitor Placement in Distribution Systems Using Simulating Annealing (SA)
Authors: Esmail Limouzade, Mahmood.Joorabian, Najaf Hedayat
Abstract:
This paper undertakes the problem of optimal capacitor placement in a distribution system. The problem is how to optimally determine the locations to install capacitors, the types and sizes of capacitors to he installed and, during each load level,the control settings of these capacitors in order that a desired objective function is minimized while the load constraints,network constraints and operational constraints (e.g. voltage profile) at different load levels are satisfied. The problem is formulated as a combinatorial optimization problem with a nondifferentiable objective function. Four solution mythologies based on algorithms (GA),tabu search (TS), and hybrid GA-SA algorithms are presented.The solution methodologies are preceded by a sensitivity analysis to select the candidate capacitor installation locations.Keywords: Genetic Algorithm (GA) , capacitor placement, voltage profile, network losses, Simulated Annealing, distribution network.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1806884 CFD of Oscillating Airfoil Pitch Cycle by using PISO Algorithm
Authors: Muhammad Amjad Sohail, Rizwan Ullah
Abstract:
This research paper presents the CFD analysis of oscillating airfoil during pitch cycle. Unsteady subsonic flow is simulated for pitching airfoil at Mach number 0.283 and Reynolds number 3.45 millions. Turbulent effects are also considered for this study by using K-ω SST turbulent model. Two-dimensional unsteady compressible Navier-Stokes code including two-equation turbulence model and PISO pressure velocity coupling is used. Pressure based implicit solver with first order implicit unsteady formulation is used. The simulated pitch cycle results are compared with the available experimental data. The results have a good agreement with the experimental data. Aerodynamic characteristics during pitch cycles have been studied and validated.Keywords: Angle of attack, Centre of pressure, subsonic flow, pitching moment coefficient, turbulence mode
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2393883 The Modified Eigenface Method using Two Thresholds
Authors: Yan Ma, ShunBao Li
Abstract:
A new approach is adopted in this paper based on Turk and Pentland-s eigenface method. It was found that the probability density function of the distance between the projection vector of the input face image and the average projection vector of the subject in the face database, follows Rayleigh distribution. In order to decrease the false acceptance rate and increase the recognition rate, the input face image has been recognized using two thresholds including the acceptance threshold and the rejection threshold. We also find out that the value of two thresholds will be close to each other as number of trials increases. During the training, in order to reduce the number of trials, the projection vectors for each subject has been averaged. The recognition experiments using the proposed algorithm show that the recognition rate achieves to 92.875% whilst the average number of judgment is only 2.56 times.Keywords: Eigenface, Face Recognition, Threshold, Rayleigh Distribution, Feature Extraction
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1495882 An Optimization of Orbital Transfer for Spacecrafts with Finite-thrust Based on Legendre Pseudospectral Method
Authors: Yanan Yang, Zhigang Wang, Xiang Chen
Abstract:
This paper presents the use of Legendre pseudospectral method for the optimization of finite-thrust orbital transfer for spacecrafts. In order to get an accurate solution, the System-s dynamics equations were normalized through a dimensionless method. The Legendre pseudospectral method is based on interpolating functions on Legendre-Gauss-Lobatto (LGL) quadrature nodes. This is used to transform the optimal control problem into a constrained parameter optimization problem. The developed novel optimization algorithm can be used to solve similar optimization problems of spacecraft finite-thrust orbital transfer. The results of a numerical simulation verified the validity of the proposed optimization method. The simulation results reveal that pseudospectral optimization method is a promising method for real-time trajectory optimization and provides good accuracy and fast convergence.Keywords: Finite-thrust, Orbital transfer, Legendre pseudospectral method
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1801881 An Adaptive Fuzzy Clustering Approach for the Network Management
Authors: Amal Elmzabi, Mostafa Bellafkih, Mohammed Ramdani
Abstract:
The Chiu-s method which generates a Takagi-Sugeno Fuzzy Inference System (FIS) is a method of fuzzy rules extraction. The rules output is a linear function of inputs. In addition, these rules are not explicit for the expert. In this paper, we develop a method which generates Mamdani FIS, where the rules output is fuzzy. The method proceeds in two steps: first, it uses the subtractive clustering principle to estimate both the number of clusters and the initial locations of a cluster centers. Each obtained cluster corresponds to a Mamdani fuzzy rule. Then, it optimizes the fuzzy model parameters by applying a genetic algorithm. This method is illustrated on a traffic network management application. We suggest also a Mamdani fuzzy rules generation method, where the expert wants to classify the output variables in some fuzzy predefined classes.
Keywords: Fuzzy entropy, fuzzy inference systems, genetic algorithms, network management, subtractive clustering.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1883880 Walsh-Hadamard Transform for Facial Feature Extraction in Face Recognition
Authors: M. Hassan, I. Osman, M. Yahia
Abstract:
This Paper proposes a new facial feature extraction approach, Wash-Hadamard Transform (WHT). This approach is based on correlation between local pixels of the face image. Its primary advantage is the simplicity of its computation. The paper compares the proposed approach, WHT, which was traditionally used in data compression with two other known approaches: the Principal Component Analysis (PCA) and the Discrete Cosine Transform (DCT) using the face database of Olivetti Research Laboratory (ORL). In spite of its simple computation, the proposed algorithm (WHT) gave very close results to those obtained by the PCA and DCT. This paper initiates the research into WHT and the family of frequency transforms and examines their suitability for feature extraction in face recognition applications.
Keywords: Face Recognition, Facial Feature Extraction, Principal Component Analysis, and Discrete Cosine Transform, Wash-Hadamard Transform.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2571879 Mobile to Server Face Recognition: A System Overview
Authors: Nurulhuda Ismail, Mas Idayu Md. Sabri
Abstract:
This paper presents a system overview of Mobile to Server Face Recognition, which is a face recognition application developed specifically for mobile phones. Images taken from mobile phone cameras lack of quality due to the low resolution of the cameras. Thus, a prototype is developed to experiment the chosen method. However, this paper shows a result of system backbone without the face recognition functionality. The result demonstrated in this paper indicates that the interaction between mobile phones and server is successfully working. The result shown before the database is completely ready. The system testing is currently going on using real images and a mock-up database to test the functionality of the face recognition algorithm used in this system. An overview of the whole system including screenshots and system flow-chart are presented in this paper. This paper also presents the inspiration or motivation and the justification in developing this system.
Keywords: Mobile to server, face recognition, system overview.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2426878 Fast Facial Feature Extraction and Matching with Artificial Face Models
Authors: Y. H. Tsai, Y. W. Chen
Abstract:
Facial features are frequently used to represent local properties of a human face image in computer vision applications. In this paper, we present a fast algorithm that can extract the facial features online such that they can give a satisfying representation of a face image. It includes one step for a coarse detection of each facial feature by AdaBoost and another one to increase the accuracy of the found points by Active Shape Models (ASM) in the regions of interest. The resulted facial features are evaluated by matching with artificial face models in the applications of physiognomy. The distance measure between the features and those in the fate models from the database is carried out by means of the Hausdorff distance. In the experiment, the proposed method shows the efficient performance in facial feature extractions and online system of physiognomy.Keywords: Facial feature extraction, AdaBoost, Active shapemodel, Hausdorff distance
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1812877 Parallel Discrete Fourier Transform for Fast FIR Filtering Based on Overlapped-save Block Structure
Authors: Ying-Wen Bai, Ju-Maw Chen
Abstract:
To successfully provide a fast FIR filter with FTT algorithms, overlapped-save algorithms can be used to lower the computational complexity and achieve the desired real-time processing. As the length of the input block increases in order to improve the efficiency, a larger volume of zero padding will greatly increase the computation length of the FFT. In this paper, we use the overlapped block digital filtering to construct a parallel structure. As long as the down-sampling (or up-sampling) factor is an exact multiple lengths of the impulse response of a FIR filter, we can process the input block by using a parallel structure and thus achieve a low-complex fast FIR filter with overlapped-save algorithms. With a long filter length, the performance and the throughput of the digital filtering system will also be greatly enhanced.
Keywords: FIR Filter, Overlapped-save Algorithm, ParallelStructure
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1669