• 제어로봇시스템학회논문지
• /
• 제21권1호
• /
• pp.40-45
• /
• 2015

In this paper, we present an algorithm for the analysis of poses while playing table-tennis using action recognition. We use Kinect as the 3D sensor and 3D skeleton data provided by Kinect for further processing. We adopt a spherical coordinate system and feature selected using k-means clustering. We automatically detect the starting and ending frame and discriminate the action of table-tennis into two groups of forehand and backhand swing. Each swing is modeled using HMM(Hidden Markov Model) and we used a dataset composed of 200 sequences from two players. We can discriminate two types of table tennis swing in real-time. Also, it can provide analysis according to similarities found in good poses.

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

This paper presents a new global intensity compensation method for extracting moving object in a visual surveillance system by compensating time variant intensity changes of background region. The method that compensates a little changes of intensity due to time variant illumination change and automatic gain control of camera is called global intensity compensation. The proposed method expresses global intensity change with a mapping table to describe complex form of intensity change while the previous method models this global intensity change with a simple function as a straight line. The proposed method builds the mapping table by calculating the cross histogram between two images and then by selecting an initial point for generating the mapping table by using Hough transform applied to the cross histogram image. Then starting from the initial point, the mapping table is generated according to the proposed algorithm based on the assumption that reflects the characteristic of global intensity change. Experimental results show that the proposed method makes the compensation error much smaller than the previous GIC method

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

DEAS is an direct searching and optimization method that based on the binary code space. It can be classified as an direct hill climbing searching. However, because of binary code space based searching, the searching in low resolution has random property. As the resolution of code increases during the search, its property of searching changes like that of hill climbing search. This paper propose a method for improving the performance of minimum seeking ability of DEAS with history information. The cost evaluation is increased. However the minimum searching ability of DEAS is improved along the same starting resolution.

• 대한산업공학회지
• /
• 제3권1호
• /
• pp.49-53
• /
• 1977

The coordinated control of the traffic signals of adjacent intersections can reduce delays, relative number of stops and congestions in the coordinated traffic area. The road capacity can be increased to a certain extend because the stopping and starting of vehicles facing red traffic lights can be avoided in many instances due to the progression established along an artery. However, if traffic centers or leaves the main flow in irregular volumes on the intermediate road section, a coordination of traffic signals is unnecessary and may even be harmful. Therefore, a computer simulation model to simulate and predict the effectiveness of a synchronized traffic signal system in the CBD of Seoul was developed and alternative policy variables, such as cycle time, offsets, phase splits, to be fed into the simulation model had to be generated. This is a report of (1) the development of a heuristic algorithm for the determination of phase splits when there are amber periods specifically reserved for left turns and (2) the computerization of time-space diagramming.

• Architectural research
• /
• 제8권2호
• /
• pp.37-42
• /
• 2006

Starting from the quadratic optimal control algorithm, this study obtains the relation of the performance index for constrained systems and Gauss's principle. And minimizing a function of the variation in kinetic energy at constrained and unconstrained states with respect to the velocity variation, the dynamic equation is derived and it is shown that the result compares with the generalized inverse method proposed by Udwadia and Kalaba. It is investigated that the responses of a 10-story building are constrained by the installation of a two-bar structure as an application to utilize the derived equations. The structural responses are affected by various factors like the length of each bar, damping, stiffness of the bar structure, and the junction positions of two structures. Under an assumption that the bars have the same mass density, this study determines the junction positions to minimize the total dynamic responses of the structure.

• Kyungpook Mathematical Journal
• /
• 제49권4호
• /
• pp.701-712
• /
• 2009

In this paper, we first introduce a family S = {$S_n$ : C ${\rightarrow}$ C} of non-Lipschitzian mappings, called total asymptotically nonexpansive (briefly, TAN) on a nonempty closed convex subset C of a real Banach space X, and next give necessary and sufficient conditions for strong convergence of the sequence {$x_n$} defined recursively by the algorithm $x_{n+1}$ = $S_nx_n$, $n{\geq}1$, starting from an initial guess $x_1{\in}C$, to a common fixed point for such a continuous TAN family S in Banach spaces. Finally, some applications to a finite family of TAN self mappings are also added.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1997년도 Proceedings International Workshop on New Video Media Technology
• /
• pp.125-130
• /
• 1997

In this paper we present an algorithm to generate new views of a scene, starting with images from weakly calibrated cameras. Errors in 3D scene reconstruction usually gets reflected in the quality of the new scene generated, so we seek a direct method for reprojection. In this paper, we use the knowledge of dense point matches and their affine coordinate values to estimate the corresponding affine coordinate values in the new scene. We borrow ideas from the object recognition literature, and extend them significantly to solve the problem of reprojection. Unlike the epipolar line intersection algorithms for reprojection which requires at least eight matched points across three images, we need only five matched points. The theory of reprojection is used with hardware based rendering to achieve fast rendering. We demonstrate our results of novel view generation from stereopairs for arbitrary locations of the virtual camera.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1997년도 Proceedings International Workshop on New Video Media Technology
• /
• pp.19-24
• /
• 1997

This paper describes an image segmentation technique for the object-oriented coding at very low bit rates. By noting that, in the object-oriented coding technique, each objects are represented by 3 parameters, namely, shape, motion, and color informations, we propose a segmentation technique, in which the 3 parameters are fully exploited. To achieve this goal, starting with the color space conversion and the noise reduction, the input image is divided into many small regions by the K-menas algorithm on the O-K-S color space. Then, each regions are merged, according to the shape and motion information. In simultations, it is shown that the proposed technique segments the input image into relevant objects, according to the shape and motion as well as the colors. In addition, in order to evaluate the performance of the proposed technique, we introduce the notion of the interesting regions, and provide the results of encoding the image with emphasizing the interesting regions.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 1995년도 가을 학술발표회 논문집
• /
• pp.17-24
• /
• 1995

This work proposes an optimality criteria applicable to the optimum design of plane frames. Stress constraints as well as displacement constraints are treated as behavioural constraints and thus the first order approximation of stress constraints is adopted. The design space of practical reinforced concrete frames with discrete design variables has been found to have many local minima, and thus it is desirable to find in advance the mathematical minimum, hopefully global, prior to starting to search a practical optimum design. By using the mathematical minimum as a trial design of any search algorithm, we may not full into a local minimum but apparently costly design. Therefore this work aims at establishing a mathematically rigorous method ⑴ by adopting first-order approximation of constraints, ⑵ by reducing the design space whenever minimum size restrictions become "active" and ⑶ by the of Newton-Raphson Method.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2007년도 정기 학술대회 논문집
• /
• pp.433-438
• /
• 2007

Mechanical behavior of copper Nanowire is investigated, An FCC Nanowire model composed of 1,408 atoms is used for NID simulation, Simulations are performed within NVT ensemble setting without periodic boundary conditions, Nose-Poincare MD algorithm is employed to guarantee preservation of Hamiltonian. Numerical tensile tests are carried out with constant strain rate, Stress-strain curve is constructed from the calculated Cauchy stresses and specified strain values, Non-linear behavior appears around $\varepsilon$=0.064, At this instance, starting of structural reorientations are observed.