• Title/Summary/Keyword: 최소 자승

Search Result 1,179, Processing Time 0.031 seconds

Fast and Rigid 3D Shape Deformation Based on Moving Least Squares (이동 최소 자승법 기반의 빠르고 강체성이 유지되는 3차원 형상 변형 기법)

  • Lee, Jung;Kim, Chang-Hun
    • The KIPS Transactions:PartA
    • /
    • v.16A no.2
    • /
    • pp.61-68
    • /
    • 2009
  • We present a fast 3D shape deformation method that achieves smoothly deformed result by approximating a rigid transformation based on moving least squares (MLS). Our modified MLS formulation reduces the computation cost for computing the optimal transformation of each point and still keeps the rigidity of the deformed results. Even complex geometric shapes are easily, intuitively, and interactively deformed by manipulating point and ellipsoidal handles.

Reliability Based Design Optimization using Moving Least Squares (이동최소자승법을 이용한 신뢰성 최적설계)

  • Park, Jang-Won;Lee, Oh-Young;Im, Jong-Bin;Lee, Soo-Yong;Park, Jung-Sun
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.36 no.5
    • /
    • pp.438-447
    • /
    • 2008
  • This study is focused on reliability based design optimization (RBDO) using moving least squares. A response surface is used to derive a limit-state equation for reliability based design optimization. Response surface method (RSM) with least square method (LSM) or Kriging will be used as a response surface. RSM is fast to make the response surface. On the other hand, RSM has disadvantage to make the response surface of nonlinear equation. Kriging can make the response surface in nonlinear equation precisely but needs considerable amount of computations. The moving least square method (MLSM) is made of both methods (RSM with LSM+Kriging). Numerical results by MLSM are compared with those by LMS in Rosenbrock function and six-hump carmel back function. The RBDO of engine duct of smart UAV is pursued in this paper. It is proved that RBDO is useful tool for aerospace structural optimal design problems.

Fault Detection Performance Analysis of GNSS Integrity RAIM (GNSS 무결성을 위한 RAIM 기법의 고장검출 성능 분석)

  • Kim, Ji Hye;Park, Kwan Dong;Kim, Du Sik
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.20 no.3
    • /
    • pp.49-56
    • /
    • 2012
  • Performance analysis on RAIM, which is one of the techniques for monitoring integrity to ensure the reliability of GPS, was conducted in this study. RAIM is such a method which allows its user to monitor integrity in the stand-alone mode. Among the existing RAIM procedures, the representative methods including the RCM (Range Comparison Method), LSRM (Least Square Residual Method), Parity approach and WRAIM (Weighted RAIM) were evaluated, and their performance was analyzed. To validate the performance of the implemented algorithms, fault detection was tried on the clock malfunctioning event of PRN 23 occurred on January 1st, 2004. As a result, it was identified that the LSRM and the WRAIM detected all the faults happened in the event. In the case of RCM, all the states of fault were detected except for the error which occurred as a false alarm at one epoch. Furthermore, simulated biases were added for each satellite to analyze the sensitivity of each algorithm. Consequently, when biases of the 9-13 meters range were simulated for the RCM and LSRM algorithm, all the malfunctions were detected. For the WRAIM method, it could detect range biases greater than 15 meters.

The Compensation Algorithm for Localization Using the Least-Squares Method in NLOS Environment (NLOS환경에서의 최소자승법을 적용한 위치인식 보정 알고리즘)

  • Jung, Moo-Kyung;Choi, Chang-Yong;Lee, Dong-Myung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.4B
    • /
    • pp.309-316
    • /
    • 2012
  • The compensation algorithm for localization using the least-squires method in NLOS(Non Line of Sight) environment is suggested and the performance of the algorithm is analyzed in this paper. In order to improve the localization correction rate of the moving node, 1) the distance value of the moving node that is moving as an constant speed is measured by SDS-TWR(Symmetric Double-Sided Two-Way Ranging); 2) the location of the moving node is measured using the triangulation scheme; 3) the location of the moving node measured in 2) is compensated using the least-squares method. By the experiments in NLOS environment, it is confirmed that the average localization error rates are measured to ${\pm}1m$, ${\pm}0.2m$ and ${\pm}0.1m$ by the triangulation scheme, the Kalman filter and the least-squires method respectively. As a result, we can see that the localization error rate of the suggested algorithm is higher than that of the triangulation as average 86.0% and the Kalman filter as average 16.0% respectively.

Iterative Weighted MMSE Beamforming for Downlink multiuser MISO System (하향링크 다중사용자 다중안테나 시스템을 지원하는 반복 가중치 최소평균자승오류 빔형성 기법)

  • Choi, Ilgyu;Hwang, Youngsoo;Lee, Chungyong
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.3
    • /
    • pp.3-8
    • /
    • 2013
  • Conventional MMSE beamforming scheme shows better performance than ZF or MF beamforming, but it does not aim increase of sum rate. This paper proposes sum rate maximizing scheme by representing sum rate as a function of weighted MSE. Proposed scheme increases sum rate iteratively by updating weights and beam whose initial form is conventional MMSE beam. Simulation result shows sum rate of proposed scheme is higher than those of conventional schemes and increases as the number of users increases.

Simulated Annealing 기법을 이용한 실험적 베리오그램의 모델링

  • 정대인;최종근;기세일
    • Proceedings of the Korean Society of Soil and Groundwater Environment Conference
    • /
    • 2002.09a
    • /
    • pp.156-160
    • /
    • 2002
  • 실험적 베리오그램의 모델링에 SA(Simulated Annealing)기법을 이용하였다. 최소 자승법의 해를 구하기 위하여 기존의 상용 프로그램에서 많이 이용되고 있는 반복법에 근거한 방법에 비해서 SA 기법은 초기 가정값에 크게 영향을 받지 않고 일정한 모델 인자의 값을 제시하였다. 임의의 초기 가정값을 입력하여도 충분한 반복 계산을 통하여 목적함수의 값이 광역적 최소값으로 수렴하는 것을 확인할 수 있었다. 베리오그램 모델이 일반적으로 비선형 모델이기 때문에 목적함수의 지역적 최소값으로의 수렴이 문제가 되고 이로 인하여 구해지는 인자의 값이 정확하지 않을 수 있지만 SA 기법을 이용하여 최소 자승법의 해를 구하게 되면 정확한 인자의 값을 구할 수 있음을 확인하였다.

  • PDF

Least Squares Based Adaptive Motion Vector Prediction Algorithm for Video Coding (동영상 압축 방식을 위한 최소 자승 기반 적응 움직임 벡터 예측 알고리즘)

  • Kim, Ji-hee;Jeong, Jong-woo;Hong, Min-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.9C
    • /
    • pp.1330-1336
    • /
    • 2004
  • This paper addresses an adaptive motion vector prediction algorithm to improve the performance of video encoder. The block-based motion vector is characterized by non-stationary local statistics so that the coefficients of LS (Least Squares) based linear motion can be optimized. However, it requires very expensive computational cost. The proposed algorithm using LS approach with spatially varying motion-directed property adaptively controls the coefficients of the motion predictor and reduces the computational cost as well as the motion prediction error. Experimental results show the capability of the proposed algorithm.

직교화와 SVD를 도입한 광학설계의 최적화기법에 대한 연구

  • 김기태
    • Korean Journal of Optics and Photonics
    • /
    • v.4 no.4
    • /
    • pp.363-372
    • /
    • 1993
  • An optimization technique with variable orthogonalization and SVD(singular value decomposition) is examined in a double-Gauss type photographic lens design and its convergence and stability are compared with ordinary least squares and DLS(damped least squares) method. It is known that there are close relationship between the stability of optimization and condition number of nomal equation, the ratio between maximum and minimum of eigenvalues. In this study, the stability is greatly improved by limiting the condition number, the SVD, as expeded. The case of DLS with small damping, orthogonalization and SVD shows the most rapid convergence and stability. It means that the unstability of DLS method with small damping is overcome by using the variable orthogonalization and SVD.

  • PDF

Convergence Analysis of the Least Mean Fourth Adaptive Algorithm (최소평균사승 적응알고리즘의 수렴특성 분석)

  • Cho, Sung-Ho;Kim, Hyung-Jung;Lee, Jong-Won
    • The Journal of the Acoustical Society of Korea
    • /
    • v.14 no.1E
    • /
    • pp.56-64
    • /
    • 1995
  • The least mean fourth (LMF) adaptive algorithm is a stochastic gradient method that minimizes the error in the mean fourth sense. Despite its potential advantages, the algorithm is much less popular than the conventional least mean square (LMS) algorithm in practice. This seems partly because the analysis of the LMF algorithm is much more difficult than that of the LMS algorithm, and thus not much still has been known about the algorithm. In this paper, we explore the statistical convergence behavior of the LMF algorithm when the input to the adaptive filter is zero-mean, wide-sense stationary, and Gaussian. Under a system idenrification mode, a set of nonlinear evolution equations that characterizes the mean and mean-squared behavior of the algorithm is derived. A condition for the conbergence is then found, and it turns out that the conbergence of the LMF algorithm strongly depends on the choice of initial conditions. Performances of the LMF algorithm are compared with those of the LMS algorithm. It is observed that the mean convergence of the LMF algorithm is much faster than that of the LMS algorithm when the two algorithms are designed to achieve the same steady-state mean-squared estimation error.

  • PDF

Least Square Method for Analysis of Microstrip Line (최소 자승법을 이용한 마이크로스트립선로의수치해석에 관한 연구)

  • 최성진;나극환;최호열
    • The Journal of the Acoustical Society of Korea
    • /
    • v.4 no.2
    • /
    • pp.56-63
    • /
    • 1985
  • 마이크로스트립선로의 특성파라메타 분석을 위한 새로운 방법이 제안되었다. 마이크로스트립선 로의 특성파라메타들은 최소자승법에 의해서 계산하였고, 이 방법에 의해 마이크로스트립선로의 구조와 차원에 따른 결과를 보였다. 이들 결과를 차분법에 의해서 얻어진 결과와 비교 검토하였다.

  • PDF