• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.386-391
• /
• 2001

This paper presents a new two-point approximation method based on the exponential intervening variable. To avoid the lack of definition of the conventional exponential intervening variables due to zero- or negative-valued design variables the shifting level into each exponential intervening variable is introduced. Then a new quadratic approximation, whose Hessian matrix has only diagonal elements of different values, is proposed in terms of these intervening variables. These diagonal elements are computed in a closed form, which correct the typical error in the approximate gradient of the TANA series due to the lack of definition of exponential type intervening variables and their incomplete second-order terms. Also, a correction coefficient is multiplied to the pre-determined quadratic term to match the value of approximate function with that of the original function at the previous point. Finally, the authors developed a sequential approximate optimizer, solved several typical design problems used in the literature and compared these optimization results with those of TANA-3. These comparisons show that the proposed method gives more efficient and reliable results than TANA-3.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.2
• /
• pp.157-163
• /
• 2011

This paper proposes a hybrid image stabilizing system which uses both optical image stabilizing system based on EKF (Extended Kalman Filter) and digital image stabilization based on SURF (Speeded Up Robust Feature). Though image information is one of the most efficient data for object recognition, it is susceptible to noise which results from internal vibration as well as external factors. The blurred image obtained by the camera mounted on a robot makes it difficult for the robot to recognize its environment. The proposed system estimates shaking angle through EKF based on the information from inclinometer and gyro sensor to stabilize the image. In addition, extracting the feature points around rotation axis using SURF which is robust to change in scale or rotation enhances processing speed by removing unnecessary operations using Hessian matrix. The experimental results using the proposed hybrid system shows its effectiveness in extended frequency range.

• Journal of Mechanical Science and Technology
• /
• v.15 no.9
• /
• pp.1257-1267
• /
• 2001

For efficient mechanical system optimization, a new two-point approximation method is presented. Unlike the conventional two-point approximation methods such as TPEA, TANA, TANA-1, TANA-2 and TANA-3, this introduces the shifting level into each exponential intervening variable to avoid the lack of definition of the conventional exponential intervening variables due to zero-or negative-valued design variables. Then a new quadratic approximation whose Hessian matrix has only diagonal elements of different values is proposed in terms of these shifted exponential intervening variables. These diagonal elements are determined in a closed form that corrects the typical error in the approximate gradient of the TANA series due to the lack of definition of exponential type intervening variables and their incomplete second-order terms. Also, a correction coefficient is multiplied to the pre-determined quadratic term to match the value of approximate function with that of the previous point. Finally, in order to show the numerical performance of the proposed method, a sequential approximate optimizer is developed and applied to solve six typical design problems. These optimization results are compared with those of TANA-3. These comparisons show that the proposed method gives more efficient and reliable results than TANA-3.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.77-80
• /
• 2013

SURF algorithm is an algorithm to extract feature points and to generate descriptors from input images. It is robust to change of environment such as scale, rotation, illumination and view points. Because of these features, it is used for many image processing applications such as object recognition, constructing panorama pictures and 3D image restoration. But there is disadvantage for real time operation because many recognition algorithms such as SURF algorithm requires a lot of calculations. In this paper, we propose a design of feature extractor and descriptor generator based on SURF for high memory efficiency. The proposed design reduced a memory access and memory usage to operate in real time.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.9
• /
• pp.1423-1431
• /
• 2001

Based on the exponential intervening variable, a new two-point approximation method is presented. This introduces the shifting level into each exponential intervening variable to avoid the lack of def inition of the conventional exponential intervening variables due to zero-or negative-valued design variables. Then a new quadratic approximation whose Hessian matrix has only diagonal elements of different values is proposed in terms of these intervening variables. These diagonal elements are determined in a closed form that corrects the typical error in the approximate gradient of the TANA series due to the lack of definition of exponential type intervening variables and their incomplete second-order terms. Also, a correction coefficient is multiplied to the pre-determined quadratic term to match the value of approximate function with that of the previous point. Finally, in order to show the numerical performance of the proposed method, a sequential approximate optimizer is developed and applied to solve six typical design problems. These optimization results are compared with those of TANA-3. These comparisons show that the proposed method gives more efficient and reliable results than TANA-3.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2012.05a
• /
• pp.710-710
• /
• 2012

구형펄스모형(Rectangular Pulse Model)에서 반영하지 못하는 강우의 군집특성을 잘 반영하는 NSRPM(Neyman-Scott Rectangular Pulse Model) 강우생성 모형은 수자원 분야에 널리 쓰이고 있다. 일반적으로 NSRPM의 5개의 매개변수를 추정하는 최적화기법으로 DFP(Davidon-Fletcher-Powell)과 유전자알고리즘(Genetic Algorithm)을 사용하고 있다. 그러나 DFP는 주어진 초기 값에 따라 민감하며 각 반복 단계마다 헤시안행렬(Hessian Matrix)을 계산하여야 하며 추정된 전체의 해가 국지해에 수렴 할 수 있는 단점이 있다. 유전자 알고리즘을 DFP와 다르게 헤시안 행렬을 사용하지 않고 최적화를 할 수 있다는 장점이 있으나 시간이 오래 걸리는 단점이 있다. 이에 본 연구에서는 이러한 단점을 보완, 강화 하기위해서 최적화 기법으로 반복 단계마다 미분계산이 필요하지 않고 빠른 속도로 계산이 가능한 Nelder-Mead 알고리즘 이용하여 NSRPM매개변수를 추정하고 정확도를 비교하였다. 표 1은 각 기법을 이용하여 추정된 매개변수를 이용하여 생성한 강우의 통계특성과 관측된 통계특성의 상대오차를 나타낸 것이다. 괄호 안 숫자는 중첩되지 않는 누적시간을 나타낸다. 상대오차는 다음과 같다(식 1). 분석결과 Nelder-Mead 기법이 1시간의 평균, 공분산과 6시간 분산 등 전체적으로 GA, DFP보다 높은 정확도를 보였다.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.12
• /
• pp.3804-3821
• /
• 1996

The configuration optimization is a structural optimization method which includes the coordinates of a structure as well as the sectional properties in the design variable set. Effective reduction of the weight of discrete structures can be obrained by changing the geometry while satisfying stress, Ei;er bickling, displacement, and frequency constraints, etc. However, the nonlinearity due to the configuration variables may cause the difficulties of the convergence and expensive computational cost. An efficient approximation method for the configuration optimization has been developed to overcome the difficulties. The method approximates the constraint functions based onthe second-order Taylor series expansion with reciprocal design variables. The Hessian matrix is approzimated from the information on previous design points. The developed algotithms are coded and the examples are solved.

• Journal of Drive and Control
• /
• v.14 no.4
• /
• pp.45-50
• /
• 2017

The gas spring is a hydropneumatic adjusting element, consisting of a pressure tube, a piston rod, a piston and a connection fitting. The gas spring is filled with compressed nitrogen within the cylinder. The filling pressure acts on both sides of the piston and because of area difference it produces an extension force. Therefore, a gas spring is similar in function compare to mechanical coil spring. Conversely, optimization is a process of finding the best set of parameters to reach a goal while not violating certain constraints. The AMESim software provides NLPQL (Nonlinear Programming by Quadratic Lagrangian) and GA (genetic algorithm) for optimization. The NLPQL method builds a quadratic approximation to the Lagrange function and linear approximations to all output constraints at each iteration, starting with the identity matrix for the Hessian of the Lagrangian, and gradually updating it using the BFGS method. On each iteration, a quadratic programming problem is solved to find an improved design until the final convergence to the optimum design. In this study, we conducted optimization design of the gas spring reaction force with NLPQL.

• The Korean Journal of Applied Statistics
• /
• v.21 no.2
• /
• pp.327-340
• /
• 2008

This paper derives joint and conditional Lagrange multiplier tests based on information matrix for testing functional form and/or the presence of autocorrelation in a regression model. Small sample properties of these tests are assessed by Monte Carlo study and comparisons are made with LM tests based on Hessian matrix. The results show that the proposed $LM_E$ tests have the most appropriate finite sample performance.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.6
• /
• pp.48-60
• /
• 2011

Nowadays, the 3D community is actively researching on 3D imaging and free-viewpoint video (FVV). The free-viewpoint rendering in multi-view video, virtually move through the scenes in order to create different viewpoints, has become a popular topic in 3D research that can lead to various applications. However, there are restrictions of cost-effectiveness and occupying large bandwidth in video transmission. An alternative to solve this problem is to generate virtual views using a single texture image and a corresponding depth image. A critical issue on generating virtual views is that the regions occluded by the foreground (FG) objects in the original views may become visible in the synthesized views. Filling this disocclusions (holes) in a visually plausible manner determines the quality of synthesis results. In this paper, a new approach for handling disocclusions using depth based inpainting algorithm in synthesized views is presented. Patch based non-parametric texture synthesis which shows excellent performance has two critical elements: determining where to fill first and determining what patch to be copied. In this work, a noise-robust filling priority using the structure tensor of Hessian matrix is proposed. Moreover, a patch matching algorithm excluding foreground region using depth map and considering epipolar line is proposed. Superiority of the proposed method over the existing methods is proved by comparing the experimental results.