• Communications for Statistical Applications and Methods
• /
• 제4권1호
• /
• pp.177-183
• /
• 1997

A data-adaptive order selection procedure is proposed for local polynomial nonparametric regression. For each given polynomial order, bias and variance are estimated and the adaptive polynomial order that has the smallest estimated mean squared error is selected locally at each location point. To estimate mean squared error, empirical bias estimate of Ruppert (1995) and local polynomial variance estimate of Ruppert, Wand, Wand, Holst and Hossjer (1995) are used. Since the proposed method does not require fitting polynomial model of order higher than the model order, it is simpler than the order selection method proposed by Fan and Gijbels (1995b).

• 한국통신학회논문지
• /
• 제21권1호
• /
• pp.251-268
• /
• 1996

In this paper, a higher-order feedforward neural network called ridge polynomial network (RPN) which shows good approximation capability for nonlnear continuous functions defined on compact subsets in multi-dimensional Euclidean spaces, is presented. This network provides more efficient and regular structure as compared to ordinary higher-order feedforward networks based on Gabor-Kolmogrov polynomial expansions, while maintating their fast learning property. the ridge polynomial network is a generalization of the pi-sigma network (PSN) and uses a specialform of ridge polynomials. It is shown that any multivariate polynomial can be exactly represented in this form, and thus realized by a RPN. The approximation capability of the RPNs for arbitrary continuous functions is shown by this representation theorem and the classical weierstrass polynomial approximation theorem. The RPN provides a natural mechanism for incremental function approximation based on learning algorithm of the PSN. Simulation results on several applications such as multivariate function approximation and pattern classification assert nonlinear approximation capability of the RPN.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2007년도 춘계학술대회 학술발표 논문집 제17권 제1호
• /
• pp.413-416
• /
• 2007

카메라 캘리브레이션은 비젼(vision) 시스템의 광학왜곡을 보정하기 위해, 영상 좌표계와 실세계 좌표계간의 변환관계를 정의해 주는 mapping을 구하는 과정으로 카메라를 이용한 측정, 검사, 위치보정 등의 응용에서 매우 중요하다. 카메라 캘리브레이션 방법으로 많이 사용되는 Tsai 알고리즘은 여러 카메라 내부 상수들을 필요로 하며, 적절한 활용을 위해서는 이에 대한 이해와 카메라와 렌즈왜곡의 모델에 대한 사전지식을 요한다. 본 논문에서는 카메라나 렌즈왜곡에 대한 모델이나 가정없이, 영상좌표와 실세계 좌표간의 변환을 고차(higher order) polynomial을 이용하여 구현하여 사용이 손쉬운 카메라 캘리브레이션 방법을 소개하고 성능을 평가하였다. 성능 평가 결과, 3차 polynomial을 이용한 카메라 캘리브레이션 방법이 Tsai알고리즘보다 정밀도에서 우수하였다.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제50권9호
• /
• pp.430-438
• /
• 2001

In this study, we introduce the adaptive Polynomial Neuro-Fuzzy Networks(PNFN) architecture generated from the fusion of fuzzy inference system and PNN algorithm. The PNFN dwells on the ideas of fuzzy rule-based computing and neural networks. Fuzzy inference system is applied in the 1st layer of PNFN and PNN algorithm is employed in the 2nd layer or higher. From these the multilayer structure of the PNFN is constructed. In order words, in the Fuzzy Inference System(FIS) used in the nodes of the 1st layer of PNFN, either the simplified or regression polynomial inference method is utilized. And as the premise part of the rules, both triangular and Gaussian like membership function are studied. In the 2nd layer or higher, PNN based on GMDH and regression polynomial is generated in a dynamic way, unlike in the case of the popular multilayer perceptron structure. That is, the PNN is an analytic technique for identifying nonlinear relationships between system's inputs and outputs and is a flexible network structure constructed through the successive generation of layers from nodes represented in partial descriptions of I/O relatio of data. The experiment part of the study involves representative time series such as Box-Jenkins gas furnace data used across various neurofuzzy systems and a comparative analysis is included as well.

• 한국정보처리학회논문지
• /
• 제4권12호
• /
• pp.3063-3068
• /
• 1997

일반적인 역전파(Back Propagation)의 알고리즘을 다층 다항식 고차 뉴럴네트워크에 적용하여 위치 변환 패턴에 있어 정확한 인식을 할 수 있도록 네트워크의 구조를 개선했다. 본 논문의 목적은 다층 다항식 고차 뉴럴네트워크를 이용하여 여러 가지 패턴 인식이 가능한 이유를 자세히 논한다. 실제 예로는 일정한 문자 인식의 예제로 변형된 영문자 T-C 패턴을 가지고 실험했으며, 네트워크의 일반성(Generalization)을 측정하기 위해서는 거울반사 대칭(Mirror Symmetry)문제를 시뮬레이션 했다. 그 결과 종래의 모델보다 기술적인 우수성을 확인 할 수가 있었다. 본 연구가 제안한 방식에 의한 위치 변환된 T-C 패턴에 대하여서는 90%의 인식율을 얻을 수 있었으며, 일반성의 실험에서 거울반사 대칭(Mirror Symmetry)에 대한 인식율은 70％를 얻었다. 이 실험결과는 종래의 모델에서는 구하기 어려운 인식율이며 기존 연구와 비교한 결과 본 제안 방식의 기술적 우위성을 확연히 판단 할 수 있다.

• 센서학회지
• /
• 제21권2호
• /
• pp.109-113
• /
• 2012

We propose an improved interpolating equation to express temperature-resistance characteristics for modern industrial platinum resistance thermometers (PRTs). Callendar-van Dusen equation which has been widely used for platinum resistance thermometer fails to fully describe temperature characteristics of high quality PRTs and leaves systematic residual when the calibration point include temperatures above $300^{\circ}C$. Expanding Callendar-van Dusen to higher-order polynomial drastically improves the uncertainty of the fitting even with reduced degrees of freedom of the fitting. We found that in the fourth-order polynomial fitting, the third-order and fourth-order coefficients have a strong correlation. Using the correlation, we suggest an improved interpolating equation in the form of fourth-order polynomial, but with three fitting parameters. Applying this interpolating equation reduced the uncertainty of the fitting to 32 % of that resulted from the traditional Callendar-van Dusen. This improvement was better than that from a simple third-order polynomial despite that the degrees of the freedom of the fitting was the same.

• 전기학회논문지
• /
• 제60권2호
• /
• pp.398-406
• /
• 2011

In this paper, we introduce a new architecture of PSO-based Polynomial Neural Networks (PNN) and discuss its comprehensive design methodology. The conventional PNN is based on a extended Group Method of Data Handling (GMDH) method, and utilized the polynomial order (viz. linear, quadratic, and modified quadratic) as well as the number of node inputs fixed (selected in advance by designer) at Polynomial Neurons located in each layer through a growth process of the network. Moreover it does not guarantee that the conventional PNN generated through learning results in the optimal network architecture. The PSO-based PNN results in a structurally optimized structure and comes with a higher level of flexibility that the one encountered in the conventional PNN. The PSO-based design procedure being applied at each layer of PNN leads to the selection of preferred PNs with specific local characteristics (such as the number of input variables, input variables, and the order of the polynomial) available within the PNN. In the sequel, two general optimization mechanisms of the PSO-based PNN are explored: the structural optimization is realized via PSO whereas in case of the parametric optimization we proceed with a standard least square method-based learning. To evaluate the performance of the PSO-based PNN, the model is experimented with using Gas furnace process data, and pH neutralization process data. For the characteristic analysis of the given entire data with non-linearity and the construction of efficient model, the given entire system data is partitioned into two type such as Division I(Training dataset and Testing dataset) and Division II(Training dataset, Validation dataset, and Testing dataset). A comparative analysis shows that the proposed PSO-based PNN is model with higher accuracy as well as more superb predictive capability than other intelligent models presented previously.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.1436-1439
• /
• 1997

The objective of this paper is to present an efficient and practical approach to the automatic classification of power quality(PQ) disturbances, where and orthogonal polynomial approximation method is emloyed for the detection and localization of PQ disturbances, and a feature vector, newly extracted form the bispectra of the detected signal, is utilized for the automatic rectgnition of the various types of PQ disturbances. To demonstrae the performance and applicabiliyt of the proposed approach, some simulation results are provided.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.1505-1509
• /
• 2005

This paper introduces a new architecture of genetically optimized self-organizing fuzzy polynomial neural networks by means of information granulation. The conventional SOFPNNs developed so far are based on mechanisms of self-organization and evolutionary optimization. The augmented genetically optimized SOFPNN using Information Granulation (namely IG_gSOFPNN) results in a structurally and parametrically optimized model and comes with a higher level of flexibility in comparison to the one we encounter in the conventional FPNN. With the aid of the information granulation, we determine the initial location (apexes) of membership functions and initial values of polynomial function being used in the premised and consequence part of the fuzzy rules respectively. The GA-based design procedure being applied at each layer of genetically optimized self-organizing fuzzy polynomial neural networks leads to the selection of preferred nodes with specific local characteristics (such as the number of input variables, the order of the polynomial, a collection of the specific subset of input variables, and the number of membership function) available within the network. To evaluate the performance of the IG_gSOFPNN, the model is experimented with using gas furnace process data. A comparative analysis shows that the proposed IG_gSOFPNN is model with higher accuracy as well as more superb predictive capability than intelligent models presented previously.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제53권1호
• /
• pp.40-49
• /
• 2004

In this paper, we propose a new architecture of Genetic Algorithms(GAs)-based Self-Organizing Polynomial Neural Networks(SOPNN), discuss a comprehensive design methodology and carry out a series of numeric experiments. The conventional SOPNN is based on the extended Group Method of Data Handling(GMDH) method and utilized the polynomial order (viz. linear, quadratic, and modified quadratic) as well as the number of node inputs fixed (selected in advance by designer) at Polynomial Neurons (or nodes) located in each layer through a growth process of the network. Moreover it does not guarantee that the SOPNN generated through learning has the optimal network architecture. But the proposed GA-based SOPNN enable the architecture to be a structurally more optimized network, and to be much more flexible and preferable neural network than the conventional SOPNN. In order to generate the structurally optimized SOPNN, GA-based design procedure at each stage (layer) of SOPNN leads to the selection of preferred nodes (or PNs) with optimal parameters- such as the number of input variables, input variables, and the order of the polynomial-available within SOPNN. An aggregate performance index with a weighting factor is proposed in order to achieve a sound balance between approximation and generalization (predictive) abilities of the model. A detailed design procedure is discussed in detail. To evaluate the performance of the GA-based SOPNN, the model is experimented with using two time series data (gas furnace and NOx emission process data of gas turbine power plant). A comparative analysis shows that the proposed GA-based SOPNN is model with higher accuracy as well as more superb predictive capability than other intelligent models presented previously.