• Title/Summary/Keyword: 최소 자승 알고리즘

Search Result 231, Processing Time 0.023 seconds

Characteristics of Fuzzy Inference Systems by Means of Partition of Input Spaces in Nonlinear Process (비선형 공정에서의 입력 공간 분할에 의한 퍼지 추론 시스템의 특성 분석)

  • Park, Keon-Jun;Lee, Dong-Yoon
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.3
    • /
    • pp.48-55
    • /
    • 2011
  • In this paper, we analyze the input-output characteristics of fuzzy inference systems according to the division of entire input spaces and the fuzzy reasoning methods to identify the fuzzy model for nonlinear process. And fuzzy model is expressed by identifying the structure and parameters of the system by means of input variables, fuzzy partition of input spaces, and consequence polynomial functions. In the premise part of the rules Min-Max method using the minimum and maximum values of input data set and C-Means clustering algorithm forming input data into the hard clusters are used for identification of fuzzy model and membership function is used as a series of triangular membership function. In the consequence part of the rules fuzzy reasoning is conducted by two types of inferences. The identification of the consequence parameters, namely polynomial coefficients, of the rules are carried out by the standard least square method. And lastly, we use gas furnace process which is widely used in nonlinear process and we evaluate the performance for this nonlinear process.

MHN Filter-based Brush Stroke Generation for Painterly Rendering (회화적 렌더링을 위한 MHN 필터 기반 브러시 스트로크 생성기법)

  • Seo, Sang-Hyun;Yoon, Kyung-Hyun
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.8
    • /
    • pp.1045-1053
    • /
    • 2006
  • We introduce a new method of painterly rendering. Instead of using the gradient direction of the source image to generate a brush stroke, we extract regions that can be drawn in one stroke using MHN filtering followed by identification of connected components, and make a brush stroke from each, based on an approximation to the medial axis. This method results in realistic-looking brush strokes of varying width that have an irregular directions where necessary.

  • PDF

Trajectory Control of Robot Manipulators Based on the Preview Algorithms (예측 알고리즘을 이용한 로보트 매니퓰레이터의 경로제어)

  • 윤원식;송창섭;양해원;서일홍;오재응
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.14 no.5
    • /
    • pp.486-502
    • /
    • 1989
  • This paper proposes two types of the preview algorithms to predict the velocities and joint positions, and deals with a control approach using the preview algorithms for the precise trajectory control. Specifically, a predictor as the form of discrete time state equations is proposed based on the robot dynamics model linearized by the computed toque method. And another state predictor is proposed by the best line fitting in the least square sense, where present joint velocities and positions and several past positions are employed. Then computer simulations are performed for the SCARA robot with two d.o.f to show the validities of the proposed algorithms.

  • PDF

Thin film thickness profile measurement using white light scanning interferometry (백색광 주사 간섭법을 이용한 박막의 두께 형상 측정법)

  • 김기홍;김승우
    • Korean Journal of Optics and Photonics
    • /
    • v.10 no.5
    • /
    • pp.373-378
    • /
    • 1999
  • White light scanning interferometry is increasingly used for precision profile metrology of engineering surfaces, but its current application is primarily limited to opaque surfaces with relatively simple optical reflection behaviors. In this paper, a new attempt is made to extend the interferometric method to the thickness profile measurement of transparent thin film layers. An extensive frequency domain analysis of multiple reflection is performed to allow both the top and bottom interfaces of a thin film layer to be measured independently at the same time using nonlinear least squares technique. This rigorous approach provides not only point-by-point thickness probing but also complete volumetric film profiles digitized in three dimensions.

  • PDF

The design method for a vector codebook using a variable weight and employing an improved splitting method (개선된 미세분할 방법과 가변적인 가중치를 사용한 벡터 부호책 설계 방법)

  • Cho, Che-Hwang
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.4
    • /
    • pp.462-469
    • /
    • 2002
  • While the conventional K-means algorithms use a fixed weight to design a vector codebook for all learning iterations, the proposed method employs a variable weight for learning iterations. The weight value of two or more beyond a convergent region is applied to obtain new codevectors at the initial learning iteration. The number of learning iteration applying a variable weight must be decreased for higher weight value at the initial learning iteration to design a better codebook. To enhance the splitting method that is used to generate an initial codebook, we propose a new method, which reduces the error between a representative vector and the member of training vectors. The method is that the representative vector with maximum squared error is rejected, but the vector with minimum error is splitting, and then we can obtain the better initial codevectors.

Model Fitting using an Active Surface with Global Detormations (전역 변형을 갖는 활성곡면을 사용한 모델 적합)

  • Kim, Dong-Geun;Choe, Jeung-Won;Hwang, Chi-Jeong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.3
    • /
    • pp.792-801
    • /
    • 1997
  • In this paper we propose an algorithm which fits a surface to noise-corrupted data points using an aceive sur-vace with global deformations.It is 3-dimensional surface extension of our precious works on 2-dimensional curve modell[11,12].We use fimite differences,and represent shapes of surface as global transfromation suring evolution based on the ballon [odel[2,3]which allows partial inflation or deflation by using niegborhood'sextermal foreces on each node points.At first,we make local deformations based on the balloon [odel,and then the blobal transformation from the surface before deformations to the defomed surface is calcualted by the deterministic lest squre method,finally we apply the global transformation to the surface before deformations.In experiments we fit a surface(elliposid,B-spline)to noise-corrupted 3D data points using the active surface with affine deformations.

  • PDF

Optimization of fuzzy systems based on information granules (정보 Granules 기반 퍼지 시스템의 최적화)

  • Park, Keon-Jun;Lee, Dong-Yoon;Oh, Sung-Kwun
    • Proceedings of the KIEE Conference
    • /
    • 2003.07d
    • /
    • pp.2567-2569
    • /
    • 2003
  • 본 논문은 비선형 시스템의 퍼지모델을 위해 정보 Granules 기반 퍼지추론 시스템 모델의 최적화를 제시한다. 퍼지모델은 주로 경험적 방법에 의해 추출되기 때문에 보다 구체적이고 체계적인 방법에 의한 동정 및 최적화 될 필요성이 요구된다. 제안된 규칙베이스 퍼지모델은 HCM 클러스터링 방법, 컴플렉스 알고리즘 및 퍼지추론 방법을 이용하여 시스템 구조와 파라미터 동정을 수행한다. 두 가지 형태의 퍼지모델 추론 방법은 간략추론, 선형추론에 의해 시행된다. 본 논문에서는 퍼지모델의 입력변수와 퍼지 입력 공간 분할 및 입출력 데이타의 중심값을 구해서 후반부 다항식함수에 의한 정보 Granules 기반 구조 동정과 파라미터 동정을 통해 비선형 시스템을 표현한다. 전반부 파라미터의 동정에는 HCM 클러스터링 방법과 컴플렉스 알고리즘을 사용하고, 후반부는 표준 HCM 클러스터링과 표준 최소자승법을 사용하여 동정한다. 그리고 학습 및 테스트 데이타의 성능견과의 상호균형을 얻기 위한 하중값을 가진 성능지수를 제시함으로써 근사화와 예측성능의 향상을 꾀한다. 제안된 비선형 모델의 성능평가를 통해 그 우수성을 보인다.

  • PDF

Improved time delay estimation by adaptive eigenvector decomposition for two noisy acoustic sensors (잡음이 있는 두 음향 센서를 이용한 시간 지연 추정을 위한 향상된 적응 고유벡터 추정 기반 알고리즘)

  • Lim, Jun-Seok
    • The Journal of the Acoustical Society of Korea
    • /
    • v.37 no.6
    • /
    • pp.499-505
    • /
    • 2018
  • Time delay estimation between two acoustic sensors is widely used in room acoustics and sonar for target position estimation, tracking and synchronization. A cross-correlation based method is representative for the time delay estimation. However, this method does not have enough consideration for the noise added to the receiving acoustic sensors. This paper proposes a new time delay estimation method considering the added noise on the receiver acoustic sensors. From comparing with the existing GCC (Generalized Cross Correlation) method, and adaptive eigen decomposition method, we show that the proposed method outperforms other methods for a colored signal source in the white Gaussian noise condition.

OD Matrix Estimation from Traffic Counts Using Genetic Algorithm (유전알고리즘을 이용한 링크관측교통량으로부터의 기종점 통행행렬 추정)

  • 백승걸
    • Proceedings of the KOR-KST Conference
    • /
    • 2002.02a
    • /
    • pp.17-42
    • /
    • 2002
  • 전통적인 OD조사에 의한 OD추정의 여러 문제점들로 인해 링크관측교통량과 기존OD를 결합해 OD를 추정하고자 하는 연구들이 제시되고 있다. Yang(1995)은 일반화최소자승법을 풀기 위한 IEA와 SAB 알고리즘을 제시하였다. 그러나 두 알고리즘의 문제점은 첫째 실제 OD를 알기가 어렵기 때문에 기존 OD를 중요한 추정기준으로 설정한다는 것으로, 이러한 추정의 종속성으로 인해, 기존 OD와 실제 OD의 차이가 큰 경우 정확한 해를 도출하지 못한다. 두 번째 문제는 통행패턴 추정시 선형근사화를 가정하기 때문에 게임이론적 측면에서 전제로 설정한 완전한 Stackelberg 상황을 구현하지 못한다는 것이다. 이러한 문제점을 피하기 위해서는 기존 OD나 관측교통량의 오차에 일관적인 해도출 기법이 필요하다. OD추정 문제는 본질적으로 비선형이고 비볼록하여 전역해 탐색기법이 필요하기 때문에 전역최적화가 가능한 유전알고리즘을 이용한 OD추정모형(GAM)을 개발하였다. 사례네트워크 분석결과, GAM은 기존 OD의 오차에 대해 크게 종속적이지 않으며 OD구조가 변하는 경우에도 추정이 가능하여, 일반적으로 실제 OD를 알 수 없는(기존OD의 오차가 어느 정도인지를 알 수 없는) 도시부 네트워크에서 신뢰성있는 추정력을 보였다. 또한 기존 OD 추정모형은 비교적 용이하게 차종별로 관측할 수 있는 링크교통량을 차종구분 없이 단일차종으로 이용함으로써, 정보의 손실을 초래하여 결과적으로 모형의 추정력을 저하시켰다. 그렇지만 다차종 링크관측교통량으로부터 다차종 OD 추정연구는 거의 없었으며, 그 결과가 단일차종에 대한 추정결과와 어떻게 다른지에 대한 연구도 전무하였다. 본 연구에서는 유전알고리즘을 이용한 OD 추정모형을 다수단 OD 추정모형(GAMUC)으로 확대하였다. 사례 분석 결과 단일차종 OD추정기법은 심각한 추정오류를 범할 수 있으며, 그 적용성도 낮다는 것을 보였다. 다차종 OD 추정기법이 단일차종 OD 추정기법보다 양호한 추정력을 보였으며, 다차종 기법 중에서는 GAMUC가 IEAMUC보다 우수한 추정력을 보였다.

  • PDF

Efficient Correlation Channel Modeling for Transform Domain Wyner-Ziv Video Coding (Transform Domain Wyner-Ziv 비디오 부호를 위한 효과적인 상관 채널 모델링)

  • Oh, Ji-Eun;Jung, Chun-Sung;Kim, Dong-Yoon;Park, Hyun-Wook;Ha, Jeong-Seok
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.3
    • /
    • pp.23-31
    • /
    • 2010
  • The increasing demands on low-power, and low-complexity video encoder have been motivating extensive research activities on distributed video coding (DVC) in which the encoder compresses frames without utilizing inter-frame statistical correlation. In DVC encoder, contrary to the conventional video encoder, an error control code compresses the video frames by representing the frames in the form of syndrome bits. In the meantime, the DVC decoder generates side information which is modeled as a noisy version of the original video frames, and a decoder of the error-control code corrects the errors in the side information with the syndrome bits. The noisy observation, i.e., the side information can be understood as the output of a virtual channel corresponding to the orignal video frames, and the conditional probability of the virtual channel model is assumed to follow a Laplacian distribution. Thus, performance improvement of DVC systems depends on performances of the error-control code and the optimal reconstruction step in the DVC decoder. In turn, the performances of two constituent blocks are directly related to a better estimation of the parameter of the correlation channel. In this paper, we propose an algorithm to estimate the parameter of the correlation channel and also a low-complexity version of the proposed algorithm. In particular, the proposed algorithm minimizes squared-error of the Laplacian probability distribution and the empirical observations. Finally, we show that the conventional algorithm can be improved by adopting a confidential window. The proposed algorithm results in PSNR gain up to 1.8 dB and 1.1 dB on Mother and Foreman video sequences, respectively.