• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.10
• /
• pp.1095-1102
• /
• 2014

In this paper, We proposed the approach of GPU and motion vector to analysis the Human activity in real-time surveillance system. The most important part, that is detect blob(human) in the foreground. We use to detect Adaptive Gaussian Mixture, Weighted subtraction image for salient motion and motion vector. And then, We use motion vector for human activity analysis. In this paper, the activities of human recognize and classified such as meta-classes like this {Active, Inactive}, {Position Moving, Fixed Moving}, {Walking, Running}. We created approximately 300 conditions for the simulation. As a result, We showed a high success rate about 86~98%. The results also showed that the high resolution experiment by the proposed GPU-based method was over 10 times faster than the cpu-based method.

• Journal of Korea Multimedia Society
• /
• v.15 no.6
• /
• pp.731-736
• /
• 2012

Latest digital cinema is getting more interest on recent days. The combination of visually immersive 3D movie with chair movements and other physical effects has added more enjoyment. The movement of the chair is controlled manually in these digital cinemas. By the analysis of the digital cinema's video sequences, movement of the chair can be controlled automatically. In the proposed method first of all the motion of focused object and the background is identified and then the motion vector information is extracted by using the 9-search range. The motion vector is determined only for the movement of background while the object is stationary. The extracted Motion information from the digital cinemas is used for the movement control of the chair. The experimental results show that the proposed method outperforms the existing methods in terms of accuracy.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.2
• /
• pp.59-68
• /
• 1993

The motion vector estimation and motion boundary detection have been briskly studied since they are an important clue for analysis of object structure and 3-d motion. The purpose of this researches is more exact estimation, but there are two main causes to make inaccurate. The one is the erroneous measurement of gradients in brightness values and the other is the blurring of motion boundries which is caused by the smoothness constraint. In this paper, we analyze the gradient measurement error of conventional methods and propose new technique based on it. When the proposed method is applied to the motion boundary detection in Schunck and motion vector estimation in Horn & Schunck, it is shown to have much better performance than conventional method is some artificial and real image sequences.

• Journal of the Korea Computer Graphics Society
• /
• v.29 no.3
• /
• pp.159-166
• /
• 2023

This paper investigates effective methods for implementing motion matching, which is actively used in real-time motion generation applications. The success of motion matching heavily hinges on its simple definition of a feature vector, yet this very definition can introduce significant variance in the outcomes. Our research focuses on identifying the optimal combination of feature vectors that effectively generates desired trajectories in locomotion generation. To this end, we experimented with a range of feature vector combinations and performed an in-depth error analysis to evaluate the results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.10
• /
• pp.2448-2463
• /
• 2013

The traditional block-based motion compensation methods in frame rate up-conversion (FRUC) only use a single uniquely motion vector field. However, there will always be some mistakes in the motion vector field whether the advanced motion estimation (ME) and motion vector analysis (MA) algorithms are performed or not. Once the motion vector field has many mistakes, the quality of the interpolated frame is severely affected. In order to solve the problem, this paper proposes a novel joint overlapped block motion compensation method (8J-OBMC) which adopts motion vectors of the interpolated block and its 8-neighbor blocks to jointly interpolate the target block. Since the smoothness of motion filed makes the motion vectors of 8-neighbor blocks around the interpolated block quite close to the true motion vector of the interpolated block, the proposed compensation algorithm has the better fault-tolerant capability than traditional ones. Besides, the annoying blocking artifacts can also be effectively suppressed by using overlapped blocks. Experimental results show that the proposed method is not only robust to motion vectors estimated wrongly, but also can to reduce blocking artifacts in comparison with existing popular compensation methods.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.6
• /
• pp.217-222
• /
• 2017

Any object located in the earth's gravitational field experiences a force in the direction of the center of the earth. In order to describe the motion of objects in the field, the solutions to a system of simultaneous vector kinematic equations need to be obtained. In the analysis of freely-falling objects, the reference direction +y is usually defined to be the downward direction. In the analysis of the motion of objects thrown upward, the reference direction +y is usually defined to be the upward direction. In the analysis of the motion of objects thrown downward, the reference direction +y is usually defined to be the downward direction. In this paper, we show that the choice of reference axis in either upward or direction gives the same results by adopting a scalar product of two vectors in solving the vector kinematic equations. It is rare to find other examples of using a scalar product of two vectors in solving vector kinematic equations describing the motion of objects. An application of this study is that we can arbitrarily choose the reference direction for objects moving in a horizontal direction, including projectile motions.

• ETRI Journal
• /
• v.28 no.5
• /
• pp.574-582
• /
• 2006

In this paper, a new error concealment algorithm is proposed for the H.264 standard. The algorithm consists of two processes. The first process uses a fuzzy logic method to select the size type of lost blocks. The motion vector of a lost block is calculated from the current frame, if the motion vectors of the neighboring blocks surrounding the lost block are discontinuous. Otherwise, the size type of the lost block can be determined from the preceding frame. The second process is an error concealment algorithm via a proposed adapted multiple-reference-frames selection for finding the lost motion vector. The adapted multiple-reference-frames selection is based on the motion estimation analysis of H.264 coding so that the number of searched frames can be reduced. Therefore the most accurate mode of the lost block can be determined with much less computation time in the selection of the lost motion vector. Experimental results show that the proposed algorithm achieves from 0.5 to 4.52 dB improvement when compared to the method in VM 9.0.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.34 no.1
• /
• pp.81-88
• /
• 2006

In this paper, we analyze a noncommutativity error that is not able to be compensated with integrating gyro outputs in RLG-based INS. The system can suffer from some motion known as RLG dithering motion, coning motion, ISA motion derived by an AV mount and vehicle real dynamic motion. So these motions are a cause of the noncommutativity error, the system error derived by each motion has to be analyzed. For the analysis, a relation between rotation vector and gyro outputs is introduced and applied to define the coordinate transformation matrix and the angular vector.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.2
• /
• pp.77-86
• /
• 1996

In this paper we deal with the problem of recovering 3-D motion and structure from a time-varying 2-D velocity vector field. A great deal has been done on this topic, most of which has concentrated on finding necessary and sufficient conditions for there to be a unique 3-D solution corresponding to a given 2-D motion. While previous work provides useful theoretical insight, in most situations the known algorithms have turned out to be too sensitive to be of much practical use. It appears that any robust algorithm must improve the 3-D solutions over time. As a step toward such algorithm, we present a method for recovering 3-D motion and structure from a given time-varying 2-D velocity vector field. The surface of the object in the scene is assumed to be locally planar. It is also assumed that 3-D velocity vectors are piecewise constant over three consecutive frames (or two snapshots of flow field). Our formulation relates 3-D motion and object geometry with the optical flow vector as well as its spatial and temporal derivatives. The linearization parameters, or equivalently, the first-order flow approximation (in space and time) is sufficient to recover rigid body motion and local surface structure from the local instantaneous flow field. We also demonstrate, through a sensitivity analysis carried out for synthetic and natural motions in space, that 3-D motion can be recovered reliably.

• Journal of Korea Multimedia Society
• /
• v.8 no.7
• /
• pp.889-897
• /
• 2005

This paper presents a new fast motion estimation algorithm for multi-reference frames. We first analyze the experimental results of the successive elimination algorithm, which is a fast version of full search algorithm, being applied to Multi-reference frames. Based on the analysis, a new scheme for alleviating its computational burden is introduced. In the proposed method, the motion vector for the immediately previous reference frame is found by applying the successive elimination algorithm, while the motion vector for other reference frames is estimated by extrapolation of the already obtained motion vector. Adaptively restricting the motion search area to the local area centered on the estimated motion vector, the proposed method provides dramatic computational complexity reduction but slight quality degradation. The proposed method is evaluated by experiments for some image sequences.