• Journal of Broadcast Engineering
• /
• v.8 no.1
• /
• pp.54-62
• /
• 2003

This paper presents a Soccer Game 3D Reencatment System which reenact the Important scene like getting a goal with image processing and computer graphics technologies. KBS Research Institute of Technology has developed the 3D Reenactment System of Soccer Game called ‘VPlay' to provide TV viewers with fresh images in soccer games. Vplay generates the reenactment of exciting and important soccer scenes by using computer graphics. Vplay extracts legion of players from video with color information, and then computes precise positions of players on the ground by using global motion estimation model and playground axis transformation model. The results are applied to locomotion generation module that generates the locomotion of virtual characters automatically. Using predefined motion and model library, Vplay reenacts the important scene in a quick and convenient manner Vplay was developed for live broadcasting of soccer games that demands rapid producing time and was used efficiently during past WorldCup and Asian Game.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.52-54
• /
• 2001

3차원 그래픽 가속기는 지오메트리 처리(geometry processing)와 레스터라이져(rasterizer)로 구성된다. 본 논문에서는 지오메트리 처리들 고속으로 수행할 수 있는 벡터 형태의 처리 구조(VGE)를 제안하였다. 특허 기존의 부동소수점을 계산할 수 있는 구조에 4개의 FADD, FMUL, 128개의 벡터 레지스터를 추가하여 지오메트리 연산을 가속했으며 VGE와 비슷한 H/W 비용을 갖는 Hitachi의 SH4와 비교했을 때 평균 4.7배의 성능향상을 보였다. 또한 성능 평가를 위해 범용프로세서 시뮬레이터인 Simplescalar를 수정하여 시뮬레이터를 제작했으며 Viewperf Benchmark를 입력으로 사용하였다.

• The KIPS Transactions:PartA
• /
• v.19A no.4
• /
• pp.169-174
• /
• 2012

We present an algorithm that computes a 3 dimensional Voronoi diagram for a protein molecule in this paper. The molecule is represented as a set of spheres with van der Waals radii. The Voronoi diagram is constructed in the 3D space by finding the voxels containing it. For the feasibility of the computation, we represent the molecule as a BVH (bounding volume hierarchy), and our system is accelerated by modern graphics hardware with CUDA programming support. Compared to single-core CPU implementations, experimental results show 323 times faster performance in the computation time, when the space is partitioned into $2^{24}$ voxels.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.30 no.8
• /
• pp.1242-1252
• /
• 2006

Many applications in computer graphics require complex, highly detailed models. However, to control processing time, it is often desirable to use approximations in place of excessively detailed models. Therefore, we have developed the notion of an optimal matrix to simplify the model surface which can then rapidly obtain high quality 2D patterns by flattening the 3D surface. Firstly, the woman's 3D body was modeled based on Size Korea data. Secondly, the 3D model was divided by shell and block for the pattern draft. Thirdly, each block was flattened by the grid and bridge method. Finally, we select the optimal matrix and demonstrate it's efficiency and quality. The proposed approach accommodates surfaces with darts, which are commonly utilized in the clothing industry to reduce the deformation of surface forming and flattening. The resulting optimal matrix could be an initiation of standardization for pattern flattening. This can facilitate much better approximations, in both efficiency and exactness.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 1999.12a
• /
• pp.47-51
• /
• 1999

Geo-features play a key role in object-oriented or feature-based geo-processing system. So the strategy for how-to-model and how-to-manage the geo-features builds the main architecture of the entire system and also supports the efficiency and functionality of the system. Unlike the conventional 2D geo-processing system, geo-features in 3D GIS have lots to be considered to model regarding the efficient manipulation and analysis and visualization. When the system is running on the Web, it should also be considered that how to leverage the level of detail and the level of automation of modeling in addition to the support for client side data interoperability. We built a set of 3D geo-features, and each geo-feature contains a set of aspatial data and 3D geo-primitives. The 3D geo-primitives contain the fundamental modeling data such as the height of building and the burial depth of gas pipeline. We separated the additional modeling data on the geometry and appearance of the model from the fundamental modeling data to make the table in database more concise and to allow the users more freedom to represent the geo-object. To get the users to build and exchange their own data, we devised a fie format called VGFF 2.0 which stands for Virtual GIS File Format. It is to describe the three dimensional geo-information in XML(extensible Markup Language). The DTD(Document Type Definition) of VGFF 2.0 is parsed using the DOM(Document Object Model). We also developed the authoring tools for users can make their own 3D geo-features and model and save the data to VGFF 2.0 format. We are now expecting the VGFF 2.0 evolve to the 3D version of SVG(Scalable Vector Graphics) especially for 3D GIS on the Web.

• The Journal of Information Technology
• /
• v.10 no.3
• /
• pp.33-45
• /
• 2007

Systolic Array Processor is used for designing the special purpose processor in Digital Signal Processing, Computer Graphics, Neural Network Applications etc., since it has the characteristic of parallelism, pipeline processing and architecture of regularity. But, in case of using general design method, it has intial waiting period as large as No. of PE-1. And if the connected system needs parallel and simultaneous outputs, processor has some problems of the performance, since it generates only one output at each clock in output state. So in this paper, one dimensional Systolic Array Processor that is designed according to the dependance of data and operations using the partitioned sub-matrix is proposed for the purpose of improving the performance. 1-D Systolic Array using 4 partitioned sub-matrix has efficient method in case of considering those two problems.

• Journal of the Korea Computer Graphics Society
• /
• v.13 no.3
• /
• pp.19-24
• /
• 2007

In this paper, we describe a method of defining an object's real length in order to compare objects' lengths precisely using all real length units in the real world. The browser in our study represents an object's length by referencing to the physical length property defined at modeling when it displays the object. Since objects' lengths are appropriately scaled according to these units, objects can be precisely and visually compared in sire using real world length units. The concept of defining the real length unit is extended to the X3D specification. The units are ranged from $10^{-24}(yotta)\;to\;10^{24}(yocto)$. In addition, we explain the method for processing LOD (Levels Of Detail) and for applying the property of LOLD (Levels of Length Detail) when objects with different LOLD are read into the browser.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.07a
• /
• pp.140-141
• /
• 2012

최근 영상분야의 키워드는 초고품질화, 초실감화, 스마트화로 대표될 수 있다. 그 중에서도 무안경식 3D는 초실감화를 이루기 위한 핵심응용분야 중 하나이다. 하지만 무안경식 3D 단말기가 성공적으로 보급되기 위해서는 연구되어야 할 분야가 여전히 존재한다. 그 중에서도 본 논문에서는 고화질의 무안경식 3D 스마트 콘텐츠 제작에 필요한 자동 스테레오 정합 기법을 제안하였다. 이전까지 연구된 변이지도 추출을 위한 알고리즘은 전역적 최적화 방법을 사용할 시 영상의 해상도와 깊이 정도에 따른 연산량의 증가로 많은 수행시간이 요구되었다. 또한 좌/우 영상의 intensity 정보만으로는 정확한 변이지도 추출이 어렵다는 한계점이 존재하였다. 이러한 이유로 본 논문에서는 스트림 영상에서 프레임 간의 정보를 이용하여 신뢰지도와 경계정보를 생성하였으며 belief propagation 스테레오 정합 방법을 이용하여 고화질의 정확한 변이지도를 추출하였다. 또한, 알고리즘의 연산량에 대한 문제를 해결하기 위한 고속화 방안으로, 최근 많은 연구가 이루어지고 있는 GPU(graphics processing units) 를 이용한 병렬처리를 연구하였다. 마지막으로 연구결과의 신뢰성을 향상하기 위하여 다양한 데이터를 이용한 실험을 통해 고화질의 영상정보를 고속으로 추출할 수 있음을 확인하였다.

• Journal of Ubiquitous Convergence Technology
• /
• v.2 no.2
• /
• pp.67-77
• /
• 2008

Representation of various types of information in an interactive virtual reality environment on mobile devices had been an attractive and valuable research in this new era. Our main focus is presenting spatial indoor location sensing information in 3D perception in mind to replace the traditional 2D floor map using handheld PDA. Designation of 3D virtual reality by Virtual Reality Modeling Language (VRML) demonstrates its powerful ability in providing lots of useful positioning information for PDA user in real-time situation. Furthermore, by interpolating portal culling algorithm would reduce the 3D graphics rendering time on low power processing PDA significantly. By fully utilizing the CC2420 chipbased sensor nodes, wireless sensor network was established to locate user position based on Received Signal Strength Indication (RSSI) signals. Implementation of RSSI-based indoor tracking method is low-cost solution. However, due to signal diffraction, shadowing and multipath fading, high accuracy of sensing information is unable to obtain even though with sophisticated indoor estimation methods. Therefore, low complexity and flexible accuracy refinement algorithm was proposed to obtain high precision indoor sensing information. User indoor position is updated synchronously in virtual reality to real physical world. Moreover, assignment of magnetic compass could provide dynamic orientation information of user current viewpoint in real-time.

• ETRI Journal
• /
• v.35 no.6
• /
• pp.949-959
• /
• 2013

Since the recent launch of Microsoft Xbox Kinect, research on 3D human pose estimation has attracted a lot of attention in the computer vision community. Kinect shows impressive estimation accuracy and real-time performance on massive graphics processing unit hardware. In this paper, we focus on further reducing the computation complexity of the existing state-of-the-art method to make the real-time 3D human pose estimation functionality applicable to devices with lower computing power. As a result, we propose two simple approaches to speed up the random-forest-based human pose estimation method. In the original algorithm, the random forest classifier is applied to all pixels of the segmented human depth image. We first use a multi-scale approach to reduce the number of such calculations. Second, the complexity of the random forest classification itself is decreased by the proposed cascade approach. Experiment results for real data show that our method is effective and works in real time (30 fps) without any parallelization efforts.