• 대한기계학회논문집A
• /
• 제20권6호
• /
• pp.1819-1826
• /
• 1996

This paper present the claculating method of optimum correction mass within permissible vibration linits for ratating machinery in two-plane field balancing. Basic technique of this method is based on influence coefficient method, and grphic vector composition that the resultant of two influence vectors obtained by trial mass have to be equilibrium with initial vibration vector in the each correction plane. Genetic algorithm which is a search algorithm based on the mechanism of natural selection and natural genetics is sued for vector composition, and SUMT method is used to objective function which seeks optimum correction mass for balancing a rotor.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 1998년도 추계종합학술대회
• /
• pp.146-150
• /
• 1998

본 논문에서는 유전자 알고리즘을 이용하는 새로운 시스템 식별 방식을 제안한다. 제안 한 방식은 ARMAX 모델을 이용하여 비선형 시스템을 파라미터 벡터와 측정 벡터로 나누고, 파라미터 벡터를 유전자 알고리즘을 이용하여 최적의 값을 구하여 ARMAX 모델의 파라미터를 조정한다. 기존의 Narendra의 4가지 식별 모델을 대상으로 시뮬레이션하여 제안한 식별 방식의 유용성을 확인하였다.

• Industrial Engineering and Management Systems
• /
• 제14권3호
• /
• pp.318-324
• /
• 2015

This paper proposes a dynamic short-term load forecasting method that utilizes a new sequential learning algorithm based on Relevance Vector Machine (RVM). The method performs general optimization of weights and hyperparameters using the current relevance vectors and newly arriving data. By doing so, the proposed algorithm is trained with the most recent data. Consequently, it extends the RVM algorithm to real-time and nonstationary learning processes. The results of application of the proposed algorithm to prediction of electrical loads indicate that its accuracy is comparable to that of existing nonparametric learning algorithms. Further, the proposed model reduces computational complexity.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1995년도 추계학술대회 학술발표 논문집
• /
• pp.195-202
• /
• 1995

This paper presents the calculating method of optimum correction mass within permissible vibration limits for rotating machinery in two-plane field balancing. Basic technique of this method based on influence coefficient method, is graphic vector composition that the resultant of two influence vectors obtained by trial mass have to be equilibrium with initial vibration vector in the each correction plane. Genetic algorithm which is a search algorithm based on the mechanics of natural selection and natural genetics is used for vector composition, and SUMT method is used to objective function which seeks optimum correction mass for balancing a rotor.

• 한국멀티미디어학회논문지
• /
• 제25권9호
• /
• pp.1328-1337
• /
• 2022

Recently, research on various font designs has been actively conducted to deliver effective emotional information in a digital environment. In this study, we propose a Hangul font outline vector modification algorithm that effectively conveys sensitivity according to weather information and can be transformed immediately. The algorithm performs a series of transformations: sets outlines according to design pattern templates, calculates the glyph's position to reflect physical rules, splits outline segments into smaller sizes and deforms the outlines. Through this, we could create several vector font designs such as humidity, cloud, wind, and snow. The usability evaluation was close to good, so it can be used in diverse ways if we improve readability and effective design expression.

• 전자공학회논문지B
• /
• 제33B권6호
• /
• pp.64-72
• /
• 1996

In this paper, we propose predictive motion estimatin algorithm which can predict motion without additional side information considering spatio-tempral correlatio of motion vector. This method performs motion prediction of current block using correlation of the motion vector for two spatially adjacent blocks and a temporally adjacent block. Form predicted motion, the position of searhc area is determined. Then in this searhc area, we estimate motion vector of current block using block matching algoirthm. Considering spatial an temporal correlation of motion vector, the proposed method can predict motion precisely much more. Especially when the motion of objects is rapid, this method can estimate motion more precisely without reducing block size or increasing search area. Futhrmore, the proposed method has computation time the same as conventional block matching algorithm. And as it predicts motion from adjacent blocks, it does not require additional side information for adjacent block. Computer simulation results show that motion estimation of proposed method is more precise than that of conventioanl method.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.161-163
• /
• 2005

In this paper, we propose an efficient motion vector recovery algorithm for the new coding standard H.264, which makes use of the Lagrange interpolation formula. In H.264/AVC, a 16$\times$16 macroblock can be divided into different block shapes for motion estimation, and each block has its own motion vector. In the natural video the motion vector is likely to move in the same direction, hence the neighboring motion vectors are correlative. Because the motion vector in H.264 covers smaller area than previous coding standards, the correlation between neighboring motion vectors increases. We can use the Lagrange interpolation formula to constitute a polynomial that describes the motion tendency of motion vectors, and use this polynomial to recover the lost motion vector. The simulation result shows that our algorithm can efficiently improve the visual quality of the corrupted video.

• Journal of the Korean Data and Information Science Society
• /
• 제25권2호
• /
• pp.455-464
• /
• 2014

Unlabeled examples are easier and less expensive to obtain than labeled examples. Semisupervised approaches are used to utilize such examples in an eort to boost the predictive performance. This paper proposes a novel semisupervised classication method named transductive least squares support vector machine (TLS-SVM), which is based on the least squares support vector machine. The proposed method utilizes the dierence convex algorithm to derive nonconvex minimization solutions for the TLS-SVM. A generalized cross validation method is also developed to choose the hyperparameters that aect the performance of the TLS-SVM. The experimental results conrm the successful performance of the proposed TLS-SVM.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2009년도 IWAIT
• /
• pp.460-465
• /
• 2009

This paper presents a new algorithm that includes a mechanism to avoid local solutions in a motion vector detection method that uses the steepest descent method. Two different implementations of the algorithm are demonstrated using two major search methods for tree structures, depth first search and breadth first search. Furthermore, it is shown that by avoiding local solutions, both of these implementations are able to obtain smaller prediction errors compared to conventional motion vector detection methods using the steepest descent method, and are able to perform motion vector detection within an arbitrary upper limit on the number of computations. The effects that differences in the search order have on the effectiveness of avoiding local solutions are also presented.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2001년도 추계종합학술대회
• /
• pp.579-582
• /
• 2001

벡터변형은 벡터 양자화(VQ)와 부호화를 통합한 새로운 방법이다. 최근까지 부호화에 적용된 코드북 생성은 LBG 알고리즘이었으나 신경회로망을 기반으로 한 자기생성 특성맵(SOFM: Self Organizing Feature Map)의 장점을 이용하면 시스템의 성능을 개선할 수 있다는 점에 착안하였다. 본 논문에서는 SOFM 알고리즘을 적용한 VTC(Vector Transformation coding)코드북 생성과 LBG 알고리즘의 부호화률에 대한 결과를 비교하여 분석하였다. 벡터 양자화의 문제점은 계산의 복잡성과 코드북 생성에 있으므로 본 연구에서는 이 문제의 해결을 위해 신경망 접근법을 제안한다.