• Journal of Internet Computing and Services
• /
• v.6 no.5
• /
• pp.85-95
• /
• 2005

This study proposes a method of feature point extraction using scale-space filtering and a feature point tracking algorithm based on a texturedness similarity comparison, With well-defined operators one can select a scale parameter for feature point extraction; this affects the selection and localization of the feature points and also the performance of the tracking algorithm. This study suggests a feature extraction method using scale-space filtering, With a change in the camera's point of view or movement of an object in sequential images, the window of a feature point will have an affine transform. Traditionally, it is difficult to measure the similarity between correspondence points, and tracking errors often occur. This study also suggests a tracking algorithm that expands Shi-Tomasi-Kanade's tracking algorithm with texturedness similarity.

• Journal of Ocean Engineering and Technology
• /
• v.15 no.3
• /
• pp.131-131
• /
• 2001

• The Journal of Korea Robotics Society
• /
• v.19 no.2
• /
• pp.203-212
• /
• 2024

Simultaneous motion is essential in the activities of daily living (ADL). For motion intention recognition, surface electromyogram (sEMG) and corresponding motion label is necessary. However, this process is time-consuming and it may increase the burden of the user. Therefore, we propose a simultaneous motion recognition framework using data augmentation based on muscle activation model. The model consists of multiple point sources to be optimized while the number of point sources and their initial parameters are automatically determined. From the experimental results, it is shown that the framework has generated the data which are similar to the real one. This aspect is quantified with the following two metrics: structural similarity index measure (SSIM) and mean squared error (MSE). Furthermore, with k-nearest neighbor (k-NN) or support vector machine (SVM), the classification accuracy is also enhanced with the proposed framework. From these results, it can be concluded that the generalization property of the training data is enhanced and the classification accuracy is increased accordingly. We expect that this framework reduces the burden of the user from the excessive and time-consuming data acquisition.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.6
• /
• pp.111-117
• /
• 2008

In this paper, we describes the boxing motion recognition which is used in the part of games, animation. To recognize the boxing motion, we have used two algorithms, one is principle component analysis, the other is dynamic time warping algorithm. PCA is the simplest of the true eigenvector-based multivariate analyses and often used to reduce multidimensional data sets to lower dimensions for analysis. DTW is an algorithm for measuring similarity between two sequences which may vary in time or speed. We introduce and compare PCA and DTW algorithms respectively. We implemented the recognition of boxing motion on the motion capture system which is developed in out research, and depict the system also. The motion graph will be created by boxing motion data which is acquired from motion capture system, and will be normalized in a process. The result has implemented in the motion recognition system with five actors, and showed the performance of the recognition.

• Journal of Broadcast Engineering
• /
• v.23 no.1
• /
• pp.138-145
• /
• 2018

In this paper, we propose a new motion estimation algorithm for frame rate up-conversion. The proposed algorithm uses the variance of errors in addition to SAD in motion estimation to find more accurate motion vectors. Then, it decides which motion vectors are wrong using the variance of neighbor motion vectors and the variance between current motion vector and neighbor's average motion vector. Next, incorrect motion vectors are corrected by weighted sum of eight neighbor motion vectors. Additionally, we propose adaptive search range algorithm, so we can find more accurate motion vectors and reduce computational complexity at the same time. As a result, proposed algorithm improves the average peak signal-to-noise ratio and structural similarity up to 1.44 dB and 0.129, respectively, compared with previous algorithms.

• Journal of the Korean Mathematical Society
• /
• v.38 no.5
• /
• pp.1047-1059
• /
• 2001

The classical Geometric Brownian motion (GBM) model for the price of a risky asset, from which the huge financial derivatives industry has developed, stipulates that the log returns are iid Gaussian. however, typical log returns data show a distribution with much higher peaks and heavier tails than the Gaussian as well as evidence of strong and persistent dependence. In this paper we describe a simple replacement for GBM, a fractal activity time Geometric Brownian motion (FATGBM) model based on fractal activity time which readily explains these observed features in the data. Consequences of the model are explained, and examples are given to illustrate how the self-similar scaling properties of the activity time check out in practice.

• International Journal of Contents
• /
• v.11 no.1
• /
• pp.15-20
• /
• 2015

The purpose of this research is to study methods for performing transition that have visual representation of corresponding animations with no bounce in subsequently recognized user information when attempting to interact with a virtual 3D character in real-time using user motion. If the transitions of the animation are needed owing to a variety of external environments, continuous recognition of user information is required to correspond to the motion. The proposed method includes linear interpolation of the transition using cross-fades and blending techniques. The normalized playing time of the source animation was utilized for automatically calculating the transition interpolation length of the target animation and also as the criteria in selecting the crossfades and blending techniques. In particular, in the case of blending, the weighting value based on the degree of similarity between two animations is used as a blending parameter. Accordingly, transitions for visually excellent animation are performed on interactive holographic projection systems.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2393-2396
• /
• 2005

We present a method to detect on-road vehicle using geometric invariant of feature points on side planes of the vehicle. The vehicles are assumed into a set of planes and the invariant from motion information of features on the plane segments the plane from the theory that a geometric invariant value defined by five points on a plane is preserved under a projective transform. Harris corners as a salient image point are used to give motion information with the normalized correlation centered at these points. We define a probabilistic criterion to test the similarity of invariant values between sequential frames. Experimental results using images of real road scenes are presented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4C
• /
• pp.397-405
• /
• 2003

In this paper, we propose an efficient motion estimation algorithm which can reduce computational complexity by using characteristics of wavelet coefficient in each subband while keeping about the same image quality as in using MRME(multiresolution motion estimation). In general, because of the high similarity between consecutive frames, we first decide whether the motion exists or not by just comparing MAD(mean absolute difference) between blocks with threshold in the lowest subbands of consecutive two frames. If it turns out that there is no motion in the lowest subband, we can also decide no motion exists in the higher subband. This is due to the characteristics of wavelet transform. Conversely, if we find any motion in the lowest subband, we can reduce computational complexity by estimating high subband motion vectors selectively according to the amount of computational complexity by estimating high subband motion vectors selectively according to the amount of energy in that subband. Experimental results are shown that algorithm suggested in this paper maintains about the same PSNR as MRME. However, the processing time was reduced about 30-50% compared with the MRME.

• ETRI Journal
• /
• v.40 no.4
• /
• pp.511-521
• /
• 2018

The ability to realize human-motion imitation using robots is closely related to developments in the field of artificial intelligence. However, it is not easy to imitate human motions entirely owing to the physical differences between the human body and robots. In this paper, we propose a work chain-based inverse kinematics to enable a robot to imitate the human motion of upper limbs in real time. Two work chains are built on each arm to ensure that there is motion similarity, such as the end effector trajectory and the joint-angle configuration. In addition, a two-phase filter is used to remove the interference and noise, together with a self-collision avoidance scheme to maintain the stability of the robot during the imitation. Experimental results verify the effectiveness of our solution on the humanoid robot Nao-H25 in terms of accuracy and real-time performance.