• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2007.04a
• /
• pp.121-125
• /
• 2007

Recently, constructing and complementing the road network database are a main key in all social operation in our life. However it needs high expenses for constructing and complementing the data, and relies on many people for finishing the tasks. This study propose a novel method to extract urban road networks from 3-D LiDAR data automatically. This method integrates height, reflectance, and clustered road point information. Geometric information of general roads is also applied to cluster road points group correctly. The proposed method has been tested on various urban areas which contain complicated road networks. The results conclude that the integration of height, reflectance, and geometric information worked reliably to cluster road points.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2007.04a
• /
• pp.169-173
• /
• 2007

Nowadays the aerial photos is using to get the information around our spatial environment and it increases by geometric progression in many fields. The aerial photos need in a simple object such as cartography and ground covey classification and also in a social objects such as the city plan, environment, disaster, transportation etc. However, the shadow, which includes when taking the aerial photos, makes a trouble to interpret the ground information, and also users, who need the photos in their field tasks, have restriction. This study, for removing the shadow, uses the single image and the image without the source of image and taking situation. Also, this study present clustering algorism based on HIS color model that use Hue, Saturation and Intensity, especially this study used I(intensity) to extract shadow area from image. And finally by filtering in Fourier frequency domain creates the intrinsic image which recovers the 3-D color information and removes the shadow.

• International Journal of Contents
• /
• v.5 no.4
• /
• pp.55-61
• /
• 2009

In this paper, we propose a hierarchical method for segmenting a given 3D mesh, which hierarchically clusters sharp vertices of the mesh using the metric of geodesic distance among them. Sharp vertices are extracted from the mesh by analyzing convexity that reflects global geometry. As well as speeding up the computing time, the sharp vertices of this kind avoid the problem of local optima that may occur when feature points are extracted by analyzing the convexity that reflects local geometry. For obtaining more effective results, the sharp vertices are categorized according to the priority from the viewpoint of cognitive science, and the reasonable number of clusters is automatically determined by analyzing the geometric features of the mesh.

• The Korean Journal of Applied Statistics
• /
• v.25 no.4
• /
• pp.661-668
• /
• 2012

For displaying multivariate numerical data on a 2D plane by the projection, principal components biplot and the GGobi are two main tools of data visualization. The biplot is very useful for capturing the global shape of the dataset, by representing $n$ observations and $p$ variables simultaneously on a single graph. The GGobi shows a dynamic movie of the images of $n$ observations projected onto a sequence of unit vectors floating on the $p$-dimensional sphere. Even though these two methods are certainly very valuable, there are drawbacks. The biplot is too condensed to describe the detailed parts of the data, and the GGobi is too burdensome for ordinary data analyses. In this paper, "the local projective display(LPD)" is proposed for visualizing multivariate numerical data. Main steps of the LDP are 1) $k$-means clustering of the data into $k$ subsets, 2) drawing $k$ principal components biplots of individual subsets, and 3) sequencing $k$ plots by Hurley's (2004) endlink algorithm for cognitive continuity.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.2 no.3
• /
• pp.29-39
• /
• 1992

We investigate a systematic design procedure of automatic rule generation of fuzzy logic based controllers for highly nonlinear dynamic systems such as an engine dynamic modle. By "automatic rule generation" we mean autonomous clustering or collection of such meaningful transitional relations from one conditional subspace to another. During the design procedure, we also consider optimaly control strategies such as minimum squared error, near minimum time, minimum energy or combined performance critiera. Fuzzy feedback control systems designed by our method have the properties of closed-loop stability, robustness under parameter variabitions, and a certain degree of optimality. Most of all, the main advantage of the proposed approach is that reliability can be potentially increased even if a large grain of uncertainty is involved within the control system under consideration. A numerical example is shown in which we apply our strategic fuzzy controller dwsign to a highly nonlinear model of engine idling speed control.d control.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.523-525
• /
• 2004

플래시 메모리는 저전력 소비, 빠른 읽기 속도, 비휘발성 등 좋은 특징을 많이 가지고 있다. 하지만 반대로 플래시메모리는 치명적인 약점도 가지고 있는데, 그것은 덮어쓰기가 불가능 하다는 것과 삭제속도가 극단적으로 느리다는 것이다. 따라서 이와 같은 치명적인 약점을 극복하기 위한 효율적인 파일시스템과 Carbage Collector(GC)의 설계는 플래시 메모리 연구의 핵심적인 부분이 되어 왔고 JFFS2(Journaling Flash File System version 2)는 그러한 연구의 결과 중 하나이다 본 논문은 기존에 JFFS2에서 사용된 GC와 비교해 좀 더 효율적 인 GC를 제안한다. 성능향상을 위해서 사용된 두 가지 핵심적인 알고리즘은 Cost Age Times (CAT 방법과 Dynamic dAta Clustering (DAC) 방법이며, 결과적으로 지역성(Locality)이 높은 데이터의 쓰기에서 최고 3배 정도의 성능향상을 보였다.

• The KIPS Transactions:PartA
• /
• v.14A no.7
• /
• pp.435-442
• /
• 2007

This paper is concerned with the mesh segmentation problem that can be applied to diverse applications such as texture mapping, simplification, morphing, compression, and shape matching for 3D mesh models. The mesh segmentation is the process of dividing a given mesh into the disjoint set of sub-meshes. We propose a method for segmenting meshes by simultaneously reflecting global and local geometric characteristics of the meshes. First, we extract sharp vertices over mesh vertices by interpreting the curvatures and convexity of a given mesh, which are respectively contained in the local and global geometric characteristics of the mesh. Next, we partition the sharp vertices into the $\kappa$ number of clusters by adopting the $\kappa$-means clustering method [29] based on the Euclidean distances between all pairs of the sharp vertices. Other vertices excluding the sharp vertices are merged into the nearest clusters by Euclidean distances. Also we implement the proposed method and visualize its experimental results on several 3D mesh models.

• Bulletin of the Korean Chemical Society
• /
• v.30 no.7
• /
• pp.1573-1578
• /
• 2009

A computational study of the reactions between Zn-containing species, the products of the thermal decomposition of diethylzinc (DEZn) and water was investigated. The Zn-containing species – $C_2H_5)_2,\;HZnC_2H_5,\;and\;(ZnC_2H_5)_2$ – were assumed to react with water during ZnO metal organic chemical vapor deposition (MOCVD). Density functional theory (DFT) calculations at the level of B3LYP/6-311G(d) were employed for the geometry optimization and thermodynamic property evaluation. As a result dihydroxozinc, $Zn(OH)_2$, was the most probable reaction product common for all three Zn-containing species. A further clustering of $Zn(OH)_2$ was investigated to understand the initial stage of ZnO film deposition. In experiments, the reactions of DEZn and water were examined by in-situ Raman scattering in a specially designed MOCVD reactor. Although direct evidence of $Zn(OH)_2$ was not observed, some relevant reaction intermediates were successfully detected to support the validity of the gas phase reaction pathways proposed in the computational study.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.5
• /
• pp.1155-1163
• /
• 2011

In this paper, we propose a new pre-processing algorithm applied to depth map to improve the coding efficiency. Now, 3DV/FTV group in the MPEG is working for standard of 3DVC(3D video coding), but compression method for depth map images are not confirmed yet. In the proposed algorithm, after dividing the histogram distribution of a given depth map by EM clustering method based on GMM, we classify the depth map into several layered images. Then, we apply different mean shift filter to each classified image according to the existence of background or foreground in it. In other words, we try to maximize the coding efficiency while keeping the boundary of each object and taking average operation toward inner field of the boundary. The experiments are performed with many test images and the results show that the proposed algorithm achieves bits reduction of 19% ~ 20% and computation time is also reduced.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.12
• /
• pp.665-682
• /
• 2007

Line drawing is a widely used style in non-photorealistic rendering because it generates expressive descriptions of object shapes with a set of strokes. Although various techniques for line drawing of 3D objects have been developed, line drawing of 2D images has attracted little attention despite interesting applications, such as image stylization. This paper presents a robust and effective technique for generating line drawings from 2D images. The algorithm consists of three parts; filtering, linking, and stylization. In the filtering process, it constructs a likelihood function that estimates possible positions of lines in an image. In the linking process, line strokes are extracted from the likelihood function using clustering and graph search algorithms. In the stylization process, it generates various kinds of line drawings by applying curve fitting and texture mapping to the extracted line strokes. Experimental results demonstrate that the proposed technique can be applied to the various kinds of line drawings from 2D images with detail control.