• Title/Summary/Keyword: higher order algorithms

Search Result 213, Processing Time 0.029 seconds

Centroid Neural Network with Bhattacharyya Kernel (Bhattacharyya 커널을 적용한 Centroid Neural Network)

  • Lee, Song-Jae;Park, Dong-Chul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9C
    • /
    • pp.861-866
    • /
    • 2007
  • A clustering algorithm for Gaussian Probability Distribution Function (GPDF) data called Centroid Neural Network with a Bhattacharyya Kernel (BK-CNN) is proposed in this paper. The proposed BK-CNN is based on the unsupervised competitive Centroid Neural Network (CNN) and employs a kernel method for data projection. The kernel method adopted in the proposed BK-CNN is used to project data from the low dimensional input feature space into higher dimensional feature space so as the nonlinear problems associated with input space can be solved linearly in the feature space. In order to cluster the GPDF data, the Bhattacharyya kernel is used to measure the distance between two probability distributions for data projection. With the incorporation of the kernel method, the proposed BK-CNN is capable of dealing with nonlinear separation boundaries and can successfully allocate more code vector in the region that GPDF data are densely distributed. When applied to GPDF data in an image classification probleml, the experiment results show that the proposed BK-CNN algorithm gives 1.7%-4.3% improvements in average classification accuracy over other conventional algorithm such as k-means, Self-Organizing Map (SOM) and CNN algorithms with a Bhattacharyya distance, classed as Bk-Means, B-SOM, B-CNN algorithms.

Gene Expression Data Analysis Using Parallel Processor based Pattern Classification Method (병렬 프로세서 기반의 패턴 분류 기법을 이용한 유전자 발현 데이터 분석)

  • Choi, Sun-Wook;Lee, Chong-Ho
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.6
    • /
    • pp.44-55
    • /
    • 2009
  • Diagnosis of diseases using gene expression data obtained from microarray chip is an active research area recently. It has been done by general machine learning algorithms, because it is difficult to analyze directly. However, recent research results about the analysis based on the interaction between genes is essential for the gene expression analysis, which means the analysis using the traditional machine learning algorithms has limitations. In this paper, we classify the gene expression data using the hyper-network model that considers the higher-order correlations between the features, and then compares the classification accuracies. And also, we present the new hypo-network model that improve the disadvantage of existing model, and compare the processing performances of the existing hypo-network model based on general sequential processor and the improved hypo-network model implemented on parallel processors. In the experimental results, we show that the performance of our model shows improved and competitive classification performance than traditional machine learning methods, as well as, the existing hypo-network model. We show that the performance is maximized when the hypernetwork model is implemented on our parallel processors.

A Fast Sorting Strategy Based on a Two-way Merge Sort for Balancing the Capacitor Voltages in Modular Multilevel Converters

  • Zhao, Fangzhou;Xiao, Guochun;Liu, Min;Yang, Daoshu
    • Journal of Power Electronics
    • /
    • v.17 no.2
    • /
    • pp.346-357
    • /
    • 2017
  • The Modular Multilevel Converter (MMC) is particularly attractive for medium and high power applications such as High-Voltage Direct Current (HVDC) systems. In order to reach a high voltage, the number of cascaded submodules (SMs) is generally very large. Thus, in the applications with hundreds or even thousands of SMs such as MMC-HVDCs, the sorting algorithm of the conventional voltage balancing strategy is extremely slow. This complicates the controller design and increases the hardware cost tremendously. This paper presents a Two-Way Merge Sort (TWMS) strategy based on the prediction of the capacitor voltages under ideal conditions. It also proposes an innovative Insertion Sort Correction for the TWMS (ISC-TWMS) to solve issues in practical engineering under non-ideal conditions. The proposed sorting methods are combined with the features of the MMC-HVDC control strategy, which significantly accelerates the sorting process and reduces the implementation efforts. In comparison with the commonly used quicksort algorithm, it saves at least two-thirds of the sorting execution time in one arm with 100 SMs, and saves more with a higher number of SMs. A 501-level MMC-HVDC simulation model in PSCAD/EMTDC has been built to verify the validity of the proposed strategies. The fast speed and high efficiency of the algorithms are demonstrated by experiments with a DSP controller (TMS320F28335).

Multi-channel Active Noise Control Using Subband Hybrid Adaptive Filters (서브밴드 하이브리드 적응필터를 이용한 다중채널 능동소음제어)

  • 남현도;김덕중;박용식
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.14 no.1
    • /
    • pp.94-101
    • /
    • 2000
  • In this paper, a multi-channel active noise control(ANC) system using subband hybrid control techniques is proposed. Subband techniques could reduce computational burden and improve the performance of ANC systems by dividing several frequency subband and adjusting adaptive filter coefficients. So it can effectively cancel noises at wanted frequency range and use lower order adaptive filter than the existing algorithms. The adjoint LMS algorithm, which prefilter the error signals instead of the divided reference signals in frequency band, is also used for adaptive filter algorithms to reduce the computational burden of the subband adaptive systems. To improve performance of the ANC system, a weighted hybrid control technique, which has weightily properties of feedforward control systems and feedback control systems, is applied. This algorithm shows higher stability and good noise attenuation property in broad band ANC systems. Computer simulations were performed to show the effectiveness of the proposed algorithm.

  • PDF

Comparison of Snow Cover Fraction Functions to Estimate Snow Depth of South Korea from MODIS Imagery

  • Kim, Daeseong;Jung, Hyung-Sup;Kim, Jeong-Cheol
    • Korean Journal of Remote Sensing
    • /
    • v.33 no.4
    • /
    • pp.401-410
    • /
    • 2017
  • Estimation of snow depth using optical image is conducted by using correlation with Snow Cover Fraction (SCF). Various algorithms have been proposed for the estimation of snow cover fraction based on Normalized Difference Snow Index (NDSI). In this study we tested linear, quadratic, and exponential equations for the generation of snow cover fraction maps using data from the Moderate Resolution Imaging Spectroradiometer (MODIS) Aqua satellite in order to evaluate their applicability to the complex terrain of South Korea and to search for improvements to the estimation of snow depth on this landscape. The results were validated by comparison with in-situ snowfall data from weather stations, with Root Mean Square Error (RMSE) calculated as 3.43, 2.37, and 3.99 cm for the linear, quadratic, and exponential approaches, respectively. Although quadratic results showed the best RMSE, this was due to the limitations of the data used in the study; there are few number of in-situ data recorded on the station at the time of image acquisition and even the data is mostly recorded on low snowfall. So, we conclude that linear-based algorithms are better suited for use in South Korea. However, in the case of using the linear equation, the SCF with a negative value can be calculated, so it should be corrected. Since the coefficients of the equation are not optimized for this area, further regression analysis is needed. In addition, if more variables such as Normalized Difference Vegetation Index (NDVI), land cover, etc. are considered, it could be possible that estimation of national-scale snow depth with higher accuracy.

Robust Recurrent Wavelet Interval Type-2 Fuzzy-Neural-Network Control for DSP-Based PMSM Servo Drive Systems

  • El-Sousy, Fayez F.M.
    • Journal of Power Electronics
    • /
    • v.13 no.1
    • /
    • pp.139-160
    • /
    • 2013
  • In this paper, an intelligent robust control system (IRCS) for precision tracking control of permanent-magnet synchronous motor (PMSM) servo drives is proposed. The IRCS comprises a recurrent wavelet-based interval type-2 fuzzy-neural-network controller (RWIT2FNNC), an RWIT2FNN estimator (RWIT2FNNE) and a compensated controller. The RWIT2FNNC combines the merits of a self-constructing interval type-2 fuzzy logic system, a recurrent neural network and a wavelet neural network. Moreover, it performs the structure and parameter-learning concurrently. The RWIT2FNNC is used as the main tracking controller to mimic the ideal control law (ICL) while the RWIT2FNNE is developed to approximate an unknown dynamic function including the lumped parameter uncertainty. Furthermore, the compensated controller is designed to achieve $L_2$ tracking performance with a desired attenuation level and to deal with uncertainties including approximation errors, optimal parameter vectors and higher order terms in the Taylor series. Moreover, the adaptive learning algorithms for the compensated controller and the RWIT2FNNE are derived by using the Lyapunov stability theorem to train the parameters of the RWIT2FNNE online. A computer simulation and an experimental system are developed to validate the effectiveness of the proposed IRCS. All of the control algorithms are implemented on a TMS320C31 DSP-based control computer. The simulation and experimental results confirm that the IRCS grants robust performance and precise response regardless of load disturbances and PMSM parameters uncertainties.

The Design of Adaptive Fuzzy Polynomial Neural Networks Architectures Based on Fuzzy Neural Networks and Self-Organizing Networks (퍼지뉴럴 네트워크와 자기구성 네트워크에 기초한 적응 퍼지 다항식 뉴럴네트워크 구조의 설계)

  • Park, Byeong-Jun;Oh, Sung-Kwun;Jang, Sung-Whan
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.2
    • /
    • pp.126-135
    • /
    • 2002
  • The study is concerned with an approach to the design of new architectures of fuzzy neural networks and the discussion of comprehensive design methodology supporting their development. We propose an Adaptive Fuzzy Polynomial Neural Networks(APFNN) based on Fuzzy Neural Networks(FNN) and Self-organizing Networks(SON) for model identification of complex and nonlinear systems. The proposed AFPNN is generated from the mutually combined structure of both FNN and SON. The one and the other are considered as the premise and the consequence part of AFPNN, respectively. As the premise structure of AFPNN, FNN uses both the simplified fuzzy inference and error back-propagation teaming rule. The parameters of FNN are refined(optimized) using genetic algorithms(GAs). As the consequence structure of AFPNN, SON is realized by a polynomial type of mapping(linear, quadratic and modified quadratic) between input and output variables. In this study, we introduce two kinds of AFPNN architectures, namely the basic and the modified one. The basic and the modified architectures depend on the number of input variables and the order of polynomial in each layer of consequence structure. Owing to the specific features of two combined architectures, it is possible to consider the nonlinear characteristics of process system and to obtain the better output performance with superb predictive ability. The availability and feasibility of the AFPNN are discussed and illustrated with the aid of two representative numerical examples. The results show that the proposed AFPNN can produce the model with higher accuracy and predictive ability than any other method presented previously.

Evolutionary Design of Radial Basis Function-based Polynomial Neural Network with the aid of Information Granulation (정보 입자화를 통한 방사형 기저 함수 기반 다항식 신경 회로망의 진화론적 설계)

  • Park, Ho-Sung;Jin, Yong-Ha;Oh, Sung-Kwun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.4
    • /
    • pp.862-870
    • /
    • 2011
  • In this paper, we introduce a new topology of Radial Basis Function-based Polynomial Neural Networks (RPNN) that is based on a genetically optimized multi-layer perceptron with Radial Polynomial Neurons (RPNs). This study offers a comprehensive design methodology involving mechanisms of optimization algorithms, especially Fuzzy C-Means (FCM) clustering method and Particle Swarm Optimization (PSO) algorithms. In contrast to the typical architectures encountered in Polynomial Neural Networks (PNNs), our main objective is to develop a design strategy of RPNNs as follows : (a) The architecture of the proposed network consists of Radial Polynomial Neurons (RPNs). In here, the RPN is fully reflective of the structure encountered in numeric data which are granulated with the aid of Fuzzy C-Means (FCM) clustering method. The RPN dwells on the concepts of a collection of radial basis function and the function-based nonlinear (polynomial) processing. (b) The PSO-based design procedure being applied at each layer of RPNN leads to the selection of preferred nodes of the network (RPNs) whose local characteristics (such as the number of input variables, a collection of the specific subset of input variables, the order of the polynomial, and the number of clusters as well as a fuzzification coefficient in the FCM clustering) can be easily adjusted. The performance of the RPNN is quantified through the experimentation where we use a number of modeling benchmarks - NOx emission process data of gas turbine power plant and learning machine data(Automobile Miles Per Gallon Data) already experimented with in fuzzy or neurofuzzy modeling. A comparative analysis reveals that the proposed RPNN exhibits higher accuracy and superb predictive capability in comparison to some previous models available in the literature.

Classification Strategies for High Resolution Images of Korean Forests: A Case Study of Namhansansung Provincial Park, Korea

  • Park, Chong-Hwa;Choi, Sang-Il
    • Proceedings of the KSRS Conference
    • /
    • 2002.10a
    • /
    • pp.708-708
    • /
    • 2002
  • Recent developments in sensor technologies have provided remotely sensed data with very high spatial resolution. In order to fully utilize the potential of high resolution images, new image classification strategies are necessary. Unfortunately, the high resolution images increase the spectral within-field variability, and the classification accuracy of traditional methods based on pixel-based classification algorithms such as Maximum-Likelihood method may be decreased (Schiewe 2001). Recent development in Object Oriented Classification based on image segmentation algorithms can be used for the classification of forest patches on rugged terrain of Korea. The objectives of this paper are as follows. First, to compare the pros and cons of image classification methods based on pixel-based and object oriented classification algorithm for the forest patch classification. Landsat ETM+ data and IKONOS data will be used for the classification. Second, to investigate ways to increase classification accuracy of forest patches. Supplemental data such as DTM and Forest Type Map of 1:25,000 scale are used for topographic correction and image segmentation. Third, to propose the best classification strategy for forest patch classification in terms of accuracy and data requirement. The research site for this paper is Namhansansung Provincial Park located at the eastern suburb of Seoul Metropolitan City for its diverse forest patch types and data availability. Both Landsat ETM+ and IKONOS data are used for the classification. Preliminary results can be summarized as follows. First, topographic correction of reflectance is essential for the classification of forest patches on rugged terrain. Second, object oriented classification of IKONOS data enables higher classification accuracy compared to Landsat ETM+ and pixel-based classification. Third, multi-stage segmentation is very useful to investigate landscape ecological aspect of forest communities of Korea.

  • PDF

Maximum Power Point Tracking of Photovoltaic using Improved Particle Swarm Optimization Algorithm (개선된 입자 무리 최적화 알고리즘 이용한 태양광 패널의 최대 전력점 추적)

  • Kim, Jae-Jung;Kim, Chang-Bok
    • Journal of Advanced Navigation Technology
    • /
    • v.24 no.4
    • /
    • pp.291-298
    • /
    • 2020
  • This study proposed a model that can track MPP faster than the existing MPPT algorithm using the particle swarm optimization algorithm (PSO). The proposed model highly sets the acceleration constants of gbest and pbest in the PSO algorithm to quickly track the MPP point and eliminates the power instability problem. In addition, this algorithm was re-executed by detecting the change in power of the solar panel according to the rapid change in solar radiation. As a result of the experiment, MPP time was 0.03 seconds and power was 131.65 for 691.5 W/m2, and MPP was tracked at higher power and speed than the existing P&O and INC algorithms. The proposed model can be applied when a change in the amount of power is detected by partial shading in a Photovoltaic power plant with Photovoltaic connected in parallel. In order to improve the MPPT algorithm, this study needs a comparative study on optimization algorithms such as moth flame optimization (MFO) and whale optimization algorithm (WOA).