<span lang="EN-US">This paper presents the comparison between optimized unscented Kalman filter (UKF) and optimized extended Kalman filter (EKF) for sensorless direct field orientation control induction motor (DFOCIM) drive. The high performance of UKF and EKF depends on the accurate selection of state and noise covariance matrices. For this goal, multi objective function genetic algorithm is used to find the optimal values of state and noise covariance matrices. The main objectives of genetic algorithm to be minimized are the mean square errors (MSE) between actual and estimation of speed, current, and flux. Simulation results show the optimal state and noise covariance matrices can improve the estimation of speed, current, t

This paper explores a fuzzy-logic based speed controller of an interior permanent magnet synchronous motor (IPMSM) drive based on vector control. PI controllers were mostly used in a speed control loop based field oriented control of an IPMSM. The fundamentals of fuzzy logic algorithms as related to drive control applications are illustrated. A complete comparison between two tuning algorithms of the classical PI controller and the fuzzy PI controller is explained. A simplified fuzzy logic controller (FLC) for the IPMSM drive has been found to maintain high performance standards with a much simpler and less computation implementation. The Matlab simulink results have been given for different mechanical operating conditions. The simulated

Support vector machine (SVM) is a popular supervised learning algorithm based on margin maximization. It has a high training cost and does not scale well to a large number of data points. We propose a multiresolution algorithm MRH-SVM that trains SVM on a hierarchical data aggregation structure, which also serves as a common data input to other learning algorithms. The proposed algorithm learns SVM models using high-level data aggregates and only visits data aggregates at more detailed levels where support vectors reside. In addition to performance improvements, the algorithm has advantages such as the ability to handle data streams and datasets with imbalanced classes. Experimental results show significant performance improvements in compa

This paper proposes a new method Object Detection in Skin Cancer Image, the minimum
spanning tree Detection descriptor (MST). This ObjectDetection descriptor builds on the
structure of the minimum spanning tree constructed on the targettraining set of Skin Cancer
Images only. The Skin Cancer Image Detection of test objects relies on their distances to the
closest edge of thattree. Our experimentsshow that the Minimum Spanning Tree (MST) performs
especially well in case of Fogginessimage problems and in highNoisespaces for Skin Cancer
Image.
The proposed method of Object Detection Skin Cancer Image wasimplemented and tested on
different Skin Cancer Images. We obtained very good results . The experiment showed that

Lowpass spatial filters are adopted to match the noise statistics of the degradation seeking
good quality smoothed images. This study imply different size and shape of smoothing
windows. The study shows that using a window square frame shape gives good quality
smoothing and at the same time preserving a certain level of high frequency components in
comparsion with standard smoothing filters.

In this paper two main stages for image classification has been presented. Training stage consists of collecting images of interest, and apply BOVW on these images (features extraction and description using SIFT, and vocabulary generation), while testing stage classifies a new unlabeled image using nearest neighbor classification method for features descriptor. Supervised bag of visual words gives good result that are present clearly in the experimental part where unlabeled images are classified although small number of images are used in the training process.

Groupwise non-rigid image alignment is a difficult non-linear optimization problem involving many parameters and often large datasets. Previous methods have explored various metrics and optimization strategies. Good results have been previously achieved with simple metrics, requiring complex optimization, often with many unintuitive parameters that require careful tuning for each dataset. In this chapter, the problem is restructured to use a simpler, iterative optimization algorithm, with very few free parameters. The warps are refined using an iterative Levenberg-Marquardt minimization to the mean, based on updating the locations of a small number of points and incorporating a stiffness constraint. This optimization approach is eff