• The KIPS Transactions:PartA
• /
• v.9A no.4
• /
• pp.581-588
• /
• 2002

In implementing interactive multimedia systems, real-time visualization plays an important role. This paper presents efficient data structures and algorithms for real-time terrain navigation. Terrain data set is usually too huge to display as is. Therefore LOD (levels of detail) methods and view frustum culling are essential tools. This paper describes in detail compact hierarchical data structures, fast view frustum culling, and efficient LOD construction/rendering algorithms. Unlike previous works, we use a precise screen-space error metric for vertex removal and a strict error threshold allowing sub-pixel -sized errors only. Nevertheless, we can achieve 22 fps on average in a PC platform. The methods presented in this paper also satisfy almost all of the requirements for interactive real-time terrain Visualization.

• KIISE Transactions on Computing Practices
• /
• v.21 no.6
• /
• pp.436-441
• /
• 2015

There are many types of clustering algorithms such as centroid, hierarchical, or density-based methods. Each algorithm has unique data grouping principles, which creates different varieties of clusters. Ordering Points To Identify the Clustering Structure (OPTICS) is a well-known density-based algorithm to analyze arbitrary shaped and varying density clusters, but the obtained clusters only correlate loosely. Hierarchical agglomerative clustering (HAC) reveals a hierarchical structure of clusters, but is unable to clearly find non-convex shaped clusters. In this paper, we provide a novel hierarchy generation framework and application which can aid users by combining the advantages of the two clustering methods.

• Journal of the Korean Society for information Management
• /
• v.24 no.2
• /
• pp.71-87
• /
• 2007

With the rapid change of the Web and E-transaction application, the search interface is providing more powerful search and visualization methods, while offering smoother integration of technology with task. Especially, visualization techniques for long menu-lists are applied in retrieval system with the goal of improving performance in user's ability to select one item from a long list. In order to review visualization techniques appropriate to the types of users and data set, this study compared the five visualization browsers such as the Tree-structured menu, the Table-of-contents menu, the Roll-over menu, the Click menu, and Fisheye menu. The result of general analyses shows that among the hierarchical methods, the experienced group prefers the Table-of-contents method menu, whereas the novice's group prefers the Tree-structure method menu. Among the linear methods, the two groups prefer the Roll-over menu. The Roll-over menu is most preferred among the five browsers by the two groups.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.2D
• /
• pp.311-318
• /
• 2009

Interactive terrain visualization is an important research area with applications in GIS, games, virtual reality, scientific visualization and flight simulators, besides having military use. This is a complex and challenging problem considering that some applications require precise visualizations of huge data sets at real-time rates. In general, the size of data sets makes rendering at real-time difficult since the terrain data cannot fit entirely in memory. In this paper, we suggest the effective Real-time LOD(level-of-detail) algorithm for displaying the huge terrain data and processing mass geometry. We used a hierarchy structure with $4{\times}4$ and $2{\times}2$ tiles for real-time rendering of mass volume DEM which acquired from Digital map, LiDAR, DTM and DSM. Moreover, texture mapping is performed to visualize realistically while displaying height data of normalized Giga Byte level with user oriented terrain information and creating hill shade map using height data to hierarchy tile structure of file type. Large volume of terrain data was transformed to LOD data for real time visualization. This paper show the new LOD algorithm for seamless visualization, high quality, minimize the data loss and maximize the frame speed.

• 한국가시화정보학회:학술대회논문집
• /
• 2001.12a
• /
• pp.75-85
• /
• 2001

The hierarchic recursive local-correlation PIV algorithm with CBC(correlation based correction) method was developed to increase the spatial resolution of PIV results and to reduce error vectors. This new algorithm was applied to the single-frame and double-frame cross-correlation PIV techniques. In order to evaluate its performance, the recursive algorithm was tested using synthetic images, PIV standard images from Visualization Society of Japan, real flows including ventilation flow inside a vehicle passenger compartment and wake behind a circular cylinder with rib let surface. As a result, most spurious vectors were suppressed by employing CBC method. In addition, the hierarchical recursive correlation algorithm improved largely the sub-pixel accuracy of PIV results by decreasing the interrogation window size, increasing spatial resolution significantly.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2014.01a
• /
• pp.281-282
• /
• 2014

병의원에서 다양한 정보시스템을 도입하면서 환자들과 관련된 방대한 의료 데이터들이 전자적인 형태로 축적되어 왔고, 최근에는 의료진이나 환자에게 적절한 정보를 제공하는데 이러한 데이터를 활용하고자 하는 노력이 이어지고 있다. 그러나 의료 데이터는 분량이 방대하고 전문적인 내용을 다루기 때문에 이에 기반한 정보를 개인 환자에게 제공하는데 있어서는 데이터에 포함된 내용을 사용자의 이해가 편리한 형태로 가공하는 것이 중요하다. 이에 본 논문에서는 연관분석과 관련된 행렬 기반 표현 방법을 기반으로 한 하이브리드 시각화 방법을 개발하고, 이를 건강검진 결과에 적용하는 것을 제안하고자 한다.

• Journal of the Korean Society of Visualization
• /
• v.21 no.3
• /
• pp.15-22
• /
• 2023

This research introduces an innovative approach for fabricating microstructure surfaces using spray-coating deposition. The resulting surface, referred to as Magnetically Responsive Microstructures (MRM), exhibits hierarchically structured micro-pillar arrays with remarkably high aspect ratios. The fabrication process involves precisely mixing PDMS and hexane with Carbonyl iron powders, followed by ultrasonication and spray-coating on the top of a PDMS substrate placed on the neodymium magnet. The MRM surface shows hydrophobic properties, characterized by a contact angle surpassing 150° and an aspect ratio exceeding 10. Through a comprehensive exploration of critical parameters, including spray amount, magnet-substrate distance, and solution ratio enhanced dynamic tunability and exceptional hydrophobic characteristics are attained. This novel approach holds significant potential for diverse applications in the realm of dynamically tunable microstructures and magnetically responsive surfaces.

• Journal of Mechanical Science and Technology
• /
• v.17 no.3
• /
• pp.409-421
• /
• 2003

The hierarchical recursive local-correlation PIV algorithm with CBC (correlation based correction) method was employed to increase the spatial resolution of PIV results and to reduce error vectors. The performance of this new PIV algorithm was tested using synthetic images, PIV standard images of Visualization Society of Japan, real flows including ventilation flow inside a vehicle passenger compartment and wake behind a circular cylinder with riblet surface. As a result, most spurious vectors were suppressed by employing the CBC method, the hierarchical recursive correlation algorithm improved the sub-pixel accuracy of PIV results by decreasing the interrogation window size and Increased spatial resolution significantly. However, with recursively decreasing of interrogation window size, the SNR (signal-to-noise ratio) in the correlation plane was decreased and number of spurious vectors was increased. Therefore, compromised determination of optimal interrogation window size is required for given flow images, the performance of recursive algorithm is also discussed from a viewpoint of recovery ratio and error ratio in the paper.

• Journal of the Korean Society of Safety
• /
• v.15 no.2
• /
• pp.36-45
• /
• 2000

Automated production system is composed of many complicated techniques and it become a very difficult task to control, monitor and diagnose this compound system. Moreover, it is required to develop an effective diagnosing technique and reduce the diagnosing time while operating the system in parallel under many faults occurring concurrently. This study develops a Modular Artificial Neural Network(MANN) which can perform a diagnosing function of multiple faults with the following steps: 1) Modularizing a complicated system into subsystems. 2) Formulating a hierarchical structure by dividing the subsystem into many detailed elements. 3) Planting an artificial neural network into hierarchical module. The system developed is implemented on workstation platform with $X-Windows^{(r)}$ which provides multi-process, multi-tasking and IPC facilities for visualization of transaction, by applying the software written in $ANSI-C^{(r)}$ together with $MOTIF^{(r)}$ on the fault diagnosis of PI feedback controller reactor. It can be used as a simple stepping stone towards a perfect multiple diagnosing system covering with various industrial applications, and further provides an economical approach to prevent a disastrous failure of huge complicated systems.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2003.10a
• /
• pp.170-177
• /
• 2003

Gene expression data are the quantitative measurements of expression levels and ratios of numberous genes in different situations based on microarray image analysis results. The process to draw meaningful information related to genomic diseases and various biological activities from gene expression data is known as gene expression data analysis. In this paper, we present a hierarchical clustering method of gene expression data based on self organizing map which can analyze the clustering result of gene expression data more efficiently. Using our proposed method, we could eliminate the uncertainty of cluster boundary which is the inherited disadvantage of self organizing map and use the visualization function of hierarchical clustering. And, we could process massive data using fast processing speed of self organizing map and interpret the clustering result of self organizing map more efficiently and user-friendly. To verify the efficiency of our proposed algorithm, we performed tests with following 3 data sets, animal feature data set, yeast gene expression data and leukemia gene expression data set. The result demonstrated the feasibility and utility of the proposed clustering algorithm.