• Journal of the Korea Society of Computer and Information
• /
• v.13 no.7
• /
• pp.117-126
• /
• 2008

Recent advances in medical imaging technologies have enabled the high-resolution data acquisition. Therefore visualization of such large data set on standard graphics hardware became a popular research theme. Among many visualization techniques, we focused on bricking method which divided the entire volume into smaller bricks and rendered them in order. Since it switches bet\W8n bricks on main memory and bricks on GPU memory on the fly, to achieve better performance, the number of these memory swapping conditions has to be minimized. And, because the original bricking algorithm was designed for regular volume data such as CT and MR, when applying the algorithm to ultrasound volume data which is based on the toroidal coordinate space, it revealed some performance degradation. In some areas near bricks' boundaries, an orthogonal viewing ray intersects the single brick twice, and it consequently makes a single brick memory to be uploaded onto GPU twice in a single frame. To avoid this redundancy, we divided the volume into bricks allowing overlapping between the bricks. In this paper, we suggest the formula to determine an appropriate size of these shared area between the bricks. Using our formula, we could minimize the memory bandwidth. and, at the same time, we could achieve better rendering performance.

• Journal of Korea Multimedia Society
• /
• v.19 no.12
• /
• pp.1970-1980
• /
• 2016

The problem of food deficiency is a major discouragement to many low-income developing countries. Most of these countries experience constant danger of hunger, malnutrition and diseases as they are unable to maintain their food supplies mainly due to lack of arable lands and modern crop, livestock and fishery production technologies. In addition, the pollutants resulting from the secondary industries are becoming another serious issue in their food problems. The pollutants mixed in the sands blowing from the mainland China and the toxic waters flowing in the farm land form the industrialized zones are some of the examples. The Vertical Farm, or Plant Factory, proposed in this study could be the best alternative food production system for them. Vertical farm is an efficient food production system that yields relatively a large volume of food materials without environmental risks. The system does not require a large open space and manpower and can minimize the possibility of infiltration of pollutants. This research describes a basic model of the system focusing on determining the optimal sites for it based on the meteorological data concentrating on the atmospheric pollutants. The types and volume of pollutants are analyzed and identified through the big data obtained, followed by visualization of analysis results and their comparisons for better understanding.

• Journal of Korea Multimedia Society
• /
• v.14 no.6
• /
• pp.835-848
• /
• 2011

In this paper, we propose a client server based distributed/parallel system to effectively visualize huge geographic data. The system consists of a web-based client GUI program and a distributed/parallel server program which runs on multiple PC clusters. To make the client program run on mobile devices as well as PCs, the graphical user interface has been designed by using JOGL, the java-based OpenGL graphics library, and sending the information about current available memory space and maximum display resolution the server can minimize the amount of tasks. PC clusters used to play the role of the server access requested geographic data from distributed disks, and properly re-sample them, then send the results back to the client. To minimize the latency happened in repeatedly access the distributed stored geography data, cache data structures have been maintained in both every nodes of the server and the client.

• Journal of Korean Society for Geospatial Information Science
• /
• v.16 no.2
• /
• pp.57-65
• /
• 2008

The improvement of the performance in laser radar simulation requires fast retrievals of the spatial locations and attributes of objects in response to the laser signals of the simulators. Since the data used in simulation are complex 3D objects such as terrain, buildings and vehicles, and are of large sizes, commonly used 3D modeling tools are not suitable for this use. We proposed a method to store such 3D objects in a database, perform required queries and integrate with visualization tools. We showed the processes for the data modeling based on 3D topological concepts and then building a spatial DBMS. Also, we illustrated the process for accessing and visualizing the stored data using VRML and performed test computations using some laser signal data. With further enhancement on data modeling and LOD problems in visualization, the proposed method will be practically applied in different situations including laser simulation.

• Spatial Information Research
• /
• v.23 no.5
• /
• pp.41-52
• /
• 2015

MOLIT (Minister of Land, Infrastructure and Transport) authorized Indoor Spatial Information as Basic spatial information in 2013. It became a legal evidence for constructing and managing Indoor Spatial Information. Although it has a little advantage to utilize as service level that Indoor Spatial Information by laser scan or measurement, it has a lot of problems such as consuming many resources, requiring additional progresses for inputting Object Information. In conclusion, it is inefficient to utilize for the maintenance and domestic AEC/FM field. The purposes of this study is to output Indoor Spatial Information by operating IFC model which based on open BIM and to improve availability of Indoor Spatial Information with data visualization. The open-sources of IFC Exporter, a inner program of Revit (Autodesk Inc), is used to output Indoor Spatial Information. Directs 3D Library is also operated to visualize Indoor Spatial Information. It is possible to inter-operate between XML format and the objects of Indoor Spatial Information. It can be utilized in various field as well. For example COBie linkage in facility management, construction of geo-database using air-photogrammetry of UAV (Unmaned Areal Vehicle), the simulation of large-scale military operations and the simulation of large-scale evacuation. The method that is purposed in this study has outstanding advantages such as conformance with national spatial information policy, high level of interoperability as indoor spatial information objects based on IFC, convenience of editing information, light level of data and simplifying progress of producing information.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.773-774
• /
• 2010

본 연구에서는 초대형 부유식 해상 구조물(Very Large Floating Structure) 및 상부 구조물의 동적거동을 실시간 그래픽환경에서 가상 목업을 이용해 가시화하였다. 구조물 자체의 탄성 변형이 고려된 유탄성 응답해석 결과 데이터를 분석하고, 이를 실시간 가시화 시스템에 적용하기 위한 데이터 처리 방법을 소개하였으며, 3 차원 환경에서의 VLFS 및 해양파 가시화 결과와, VLFS 및 상부구조물 거동의 연동 결과를 소개하였다.

• Proceedings of the KSME Conference
• /
• 2000.04b
• /
• pp.655-660
• /
• 2000

Animation technique from the PIV database is particularly emphasized to give macroscopic and quantitative description of complex flow fields. This paper shows animation construction and application example for the post-processing of PIV data. As examples, first case is a pitching airfoil immersed in tree surface water circulating tunnel. Second case is a wake of a model-ship. Third case of PIV data is a large scale surface flow field. Obtained images are processed in time sequence by PIV exclusive routines where an efficient and reliable cross correlation algorithm is included for vector identification. All. animation Jobs are implemented completely on single personal computer environment. Compressed digital images are obtained initially by Motion-JPEG board and various An files are finally obtained through graphic processes.

• Journal of the Korean Statistical Society
• /
• v.31 no.4
• /
• pp.519-532
• /
• 2002

K-means clustering is a well-known partitioning method of multivariate observations. Recently, the method is implemented broadly in data mining softwares due to its computational efficiency in handling large data sets. However, it does not yield a suitable visual display of multivariate observations that is important especially in exploratory stage of data analysis. The aim of this study is to develop a K-means clustering method that enables visual display of multivariate observations in a low-dimensional space, for which the projection pursuit method is adopted. We propose a computationally inexpensive and reliable algorithm and provide two numerical examples.

• 한국HCI학회:학술대회논문집
• /
• 2007.02a
• /
• pp.982-987
• /
• 2007

The necessity of data compression scheme for volume data has been increased because of the increase of data capacity and the amount of network uses. Now we have various kinds of compression schemes, and we can choose one of them depending on the data types, application fields, the preferences, etc. However, the capacity of data which is produced by application scientists has been excessively increased, and the format of most scientific data is 3D volume. For 2D image or 3D moving pictures, many kinds of standards are established and widely used, but for 3D volume data, specially time-varying volume data, it is very difficult to find any applicable compression schemes. In this paper, we present a compression scheme for encoding time-varying volume data. This scheme is aimed to encoding time-varying volume data for visualization. This scheme uses MPEG's I- and P-frame concept for raising compression ratio. Also, it transforms volume data using Daubechies D4 filter before encoding, so that the image quality is better than other wavelet-based compression schemes. This encoding scheme encodes time-varying volume data composed of single precision floating-point data. In addition, this scheme provides the random reconstruction accessibility for an unit, and can be used for compressing large time-varying volume data using correlation between frames while preserving image qualities.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.6
• /
• pp.646-661
• /
• 2003

It is not easy that we visualize the large volume data stored in the every client computers of the web environment. One solution is as follows. First we compress volume data, second store that in the database server, third transfer that to client computer, fourth visualize that with direct-volume-rendering in the client computer. In this case, we usually use wavelet transform for compressing large data. This paper reports the experiments for acquiring the wavelet bases and the compression ratios fit for the above processing paradigm. In this experiments, we compress the volume data Engine, CThead, Bentum into 50%, 10%, 5%, 1%, 0.1%, 0.03% of the total data respectively using Harr, Daubechies4, Daubechies12 and Daubechies20 wavelets, then visualize that with direct-volume-rendering, afterwards evaluate the images with eyes and image comparison metrics. When compression ratio being low the performance of Harr wavelet is better than the performance of the other wavelets, when compression ratio being high the performance of Daubechies4 and Daubechies12 is better than the performance of the other wavelets. When measuring with eyes the good compression ratio is about 1% of all the data, when measuring with image comparison metrics, the good compression ratio is about 5-10% of all the data.