• The KIPS Transactions:PartA
• /
• v.11A no.2
• /
• pp.189-194
• /
• 2004

This paper describes method to distribute much high-dimensional facial expression motion data to 2 dimensional space, and method to create facial expression animation by select expressions that want by realtime as animator navigates this space. In this paper composed expression space using about 2400 facial expression frames. The creation of facial space is ended by decision of shortest distance between any two expressions. The expression space as manifold space expresses approximately distance between two points as following. After define expression state vector that express state of each expression using distance matrix which represent distance between any markers, if two expression adjoin, regard this as approximate about shortest distance between two expressions. So, if adjacency distance is decided between adjacency expressions, connect these adjacency distances and yield shortest distance between any two expression states, use Floyd algorithm for this. To materialize expression space that is high-dimensional space, project on 2 dimensions using Sammon's Mapping. Facial animation create by realtime with animators navigating 2 dimensional space using user interface.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.5
• /
• pp.1110-1115
• /
• 2014

The matrix-star and the transposition graphs are considered as star graph variants that have various merits in graph theory such as node symmetry, fault tolerance, recursive scalability, etc. This paper describes an one-to-one mapping algorithm from a matrix-star graph to a transposition graph using adjacent properties in graph theory. The result show that a matrix-star graph $MS_{2,n}$ can be embedded in a transposition graph $T_{2n}$ with dilation n or less and average dilation 2 or less.

• Journal for History of Mathematics
• /
• v.18 no.1
• /
• pp.103-110
• /
• 2005

This paper is aimed at studying a historical background of graph theory and we deal with the computer representation of graph through a simple example. Graph is represented by adjacency matrix, edge table, adjacency lists and we study the matrix representation by Euler circuit. The effect of the matrix representation by Euler circuit economize the storage capacity of computer. The economy of a storage capacity has meaning on a mobile system.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1641-1644
• /
• 2004

3차원 볼륨데이터에서 분할 대상영역의 밝기 값이 다양하면서 밝기 값이 유사한 영역과 인접한 경우 3차원 영역확장(region growing) 방법을 사용하여 영역을 분할하기 위해서는 영역확장의 중요한 요인인 동질성 기준 값의 적절한 선택이 요구된다. 본 논문에서는 영역 복셀(voxel)의 1차 미분 값의 크기인 기울기 크기(gradient magnitude)만으로 영역의 경계를 찾기가 쉽지않은 대상의 분할을 위해 볼륨데이터의 지역적인 밝기 값의 변화의 특징을 고려하면서 분할 대상영역의 복셀의 2차 미분(second partial derivation)을 행렬의 요소(element)로 갖는 Hessian 행렬의 고유치(eigenvalue)를 영역확장의 문턱치 결정에 이용하였다. 제안한 알고리즘은 3차원 영역확장의 결과에 가장 큰 영향을 미치는 적절한 문턱치의 선택으로 대상영역의 분할을 성공적으로 수행하여 3차원 영역확장의 단점을 보완하였다.

• Journal of Broadcast Engineering
• /
• v.15 no.5
• /
• pp.672-680
• /
• 2010

This paper presents an adaptive quantization matrix selection scheme for H.264 video encoding. Conventional H.264 coding standard applies the same quantization matrix to the entire video sequence without considering local characteristics in each frame. In this paper, we propose block adaptive selection of quantization matrix according to edge directivity of each block. Firstly, edge directivity of each block is determined using intra prediction modes of its spatially adjacent blocks. If the block is decided as a directional block, new weighted quantization matrix is applied to the block. Otherwise, conventional quantization matrix is used for quantization of the non-directional block. Since the proposed weighted quantization is designed based on statistical distribution of transform coefficients in accordance with intra prediction modes, we can achieve high coding efficiency. Experimental results show that the proposed scheme can improve coding efficiency by about 2% in terms of BD bit-rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10C
• /
• pp.1363-1369
• /
• 2004

LDPC(Low Density Parity Check) codes are described by bipartite graphs with bit nodes and parity-check nodes. Tanner derived minimum distance bounds of the regular LDPC code in terms of the eigenvalues of the associated adjacency matrix. In this paper we generalize the Tanner's results. We derive minimum distance bounds applicable to both regular and blockwise-irregular LDPC codes. The first bound considers the relation between bit nodes in a minimum-weight codeword, and the second one considers the connectivity between parity nodes adjacent to a minimum-weight codeword. The derived bounds make it possible to describe the distance property of the code in terms of the eigenvalues of the associated matrix.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.1
• /
• pp.31-36
• /
• 2014

Social network services(SNS) including Twitter and Facebook are good resources to extract various issues like public interest, trend and topic. This paper proposes a method to extract query-related issues by calculating relatedness between terms in Twitter. As a term that frequently appears near query terms should be semantically related to a query, we calculate term relatedness in retrieved documents by summing proximity that is proportional to term frequency and inversely proportional to distance between words. Then terms, relatedness of which is bigger than threshold, are extracted as query-related issues, and our system shows those issues with a connected network. By analyzing single transitions in a connected network, compound words are easily obtained.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.34 no.2
• /
• pp.573-582
• /
• 2014

Since there is no clear installation criteria on minimum spacing between signalized intersection and minor road, many problems have occurred in terms of traffic operation and safety. Even though many studies about entrance/exit intersection have been done in operational aspects, there is no specific and detailed research between the signalized intersection and minor road by now. Thus, this research suggests the optimal spacing between signalized intersection and minor road considering traffic operation and safety. Also, survey on vehicle behavior was conducted in this research. In conclusion, by suggesting the required minimum spacing between signalized intersection and minor road, it can be contribute in establishing and operating the installation criteria between signalized intersection and minor road.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.26 no.2
• /
• pp.213-217
• /
• 2015

Microwave Photonic(MWP) filters capable of use a bandpass filter or a notch filter with large bandwidth have been proposed. 4-lines${\times}$2-bit fiber-optic delay lines with a unit time-delay difference of 50 ps were experimentally realized. By changing the time-delay difference and the coefficients of microwave-modulated optical signals, the bandpass and notch filters were implemented and characterized.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.35 no.6
• /
• pp.629-633
• /
• 2011

Recently, systems such as aircraft, trains and ships have become larger more complex. Therefore, the reliability calculation of these systems is more difficult. This paper presents a reliability calculation algorithm for a complex system with a solution that is difficult to analyze. When the system has a very complex structure, it is very difficult to find an analytical solution. In this case, we can assess system reliability using the failure enumeration method of the reliability path. In this research, we represent the reliability block diagram by an adjacent matrix and define the reliability path. We can find any system status by the failure enumeration of the reliability path, and thus we can calculate any kind of system reliability through this process. This result can be applied to RCM (Reliability-Centered Maintenance) and reliability information-management systems, in which the system reliability is composed of the reliabilities of individual parts.