• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.547-549
• /
• 2002

본 논문은 등고선을 이용한 입력된 지표면에 대하여, 소음 영향을 계산하는 프로그램 개발에 관한 것이다. 기존의 등고선 입력 방법을 구현하여 삼차원 지표면 입력을 받으며, 이것이 주위 환경의 일부이다. 삼차원 지표면 입력에 대하여, 국부에 대한 소음 영향을 예측하기 위하여, 지표면을 표현하는 다각형을 작은 삼각형으로 분리되며, 각 작은 삼각형에는 수음자들이 존재한다. 소음 원은 도로, 철도 등 다양하며, 소리가 퍼져나가는 근원이며, 모두 점 음원으로 간주된다. 지표면을 분리된 삼각형에 대하여 기하학 적인 방법을 사용하여 소음 전파 시뮬레이션이 이루어진다. 등고선 입력 방범은 저렴한 삼차원 지표면 입력 방범이며, 사용된 기하학 적인 소음 전파 영향 계산법은 제산 시간을 줄이면서 효율적으로 소음 영향을 예측할수 있게 해 준다.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.4
• /
• pp.7-16
• /
• 2002

En this paper, we propose the algorithm that has analyzed the map Information automatically to extract the contour lines and numbers, symbols from the map image. After converting the input image to binary one, thinned image is obtained by thinning algorithm. The contour elements in the thinned image are classified and the classified elements are analyzed to automatically classify the numbers from symbols. Finally, the broken parts are restored by reconstruction algorithm. The performance of proposed algorithm is verified through the simulation. The proposed one has good performance.

• The KIPS Transactions:PartB
• /
• v.14B no.6
• /
• pp.413-422
• /
• 2007

This paper addresses a new technique for constructing surface model from a set of wire-frame contours. The most difficult problem of this technique, called contour triangulation, arises when there are many branches on the surface, and causes lots of ambiguities in surface definition process. In this paper, the branching problem is reduced as the surface reconstruction from a set of virtual belts and virtual canyons. To tile the virtual belts, a divide-and-conquer strategy based tiling technique, called the BPA algorithm, is adopted. The virtual canyons are covered naturally by an iterative convex removal algorithm with addition of a center vertex for each branching surface. Compared with most of the previous works reducing the multiple branching problem into a set of tiling problems between contours, our method can handle the problem more easily by transforming it into more simple topology, the virtual belt and the virtual canyon. Furthermore, the proposed method does not involve any set of complicated criteria, and provides a simple and robust algorithm for surface triangulation. The result shows that our method works well even though there are many complicated branches in the object.

• Journal of the Korea Computer Graphics Society
• /
• v.2 no.1
• /
• pp.68-76
• /
• 1996

One of the major problems in GIS(Geographical Information Systems) involves acquiring 3-D terrain data. Because conventional methods such as land surveying or analysis of aerial photographs are costly, the method of using existing paper maps has been gaining considerable attention. This method demands three processing steps: 1) extraction of contours, 2) assignment of height values to the extracted contours, 3) reconstruction of 3-D terrain data. In this paper we systematically develop a procedure for acquiring 3-D terrain data from contour solutions. For the first two steps, we describe the necessary operations and roughly sketch solutions. For the last step, we propose an efficient raster-based algorithm and present the results of experiments with existing paper map images.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.558-568
• /
• 2000

In the paper, we propose the automatic generation method of digital elevation map based on contour map. The proposed method classifies contour data and non-contour data by thinning and labelling process of the contour line and then connects smoothly broken contour line by Bezier curve. Finally, the digital devation map is generated by the interpolation using the height data of the contour line. The proposed method can reduce vest effort, time and expense which is spend to make digital elevation map.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.609-611
• /
• 1998

본 논문에서는 수치고도모델로부터 정확한 등고선을 추출하는 방법을 연구하였다. 이것은 하나의 높이 평면과 DEM 데이터의 교점 테스트를 통하여 등고선을 찾는 방법이다. 정해진 높이 평면과 교차하는 지형의 모든 점을 찾아내므로 등고선을 정확히 찾아낸다는 장점이 있다. 본 논문의 결과를 비교 분석함으로서 연구의 정확성을 도모하였다.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.2 no.1
• /
• pp.45-53
• /
• 1999

Geographic Information System(GIS) which facilitates efficient storage and retrieval of geographic information is very useful tools. It is of extreme importance to develop automated vectorizing system as input method for GIS, because it takes a large amount of time and effort in constructing a GIS. In all kinds of map processed by GIS, contour line map specially takes a large amount of effort. In this paper we have considered an optimal thinning algorithm for the contour line vectorizing in the GIS. Based on the experimental results, it has been proved that thinning algorithm using the connection value is most excellent algorithm in the similarity and connectivity.

• Journal of Korea Multimedia Society
• /
• v.11 no.4
• /
• pp.423-433
• /
• 2008

The surface curvatures extracted from the face contain the most important personal facial information. In particular, the face shape using the depth information represents personal features in detail. In this paper, we develop a method for recognizing the range face images by combining the multiple face regions using fuzzy integral. For the proposed approach, the first step tries to find the nose tip that has a protrusion shape on the face from the extracted face area and has to take into consideration of the orientated frontal posture to normalize. Multiple areas are extracted by the depth threshold values from reference point, nose tip. And then, we calculate the curvature features: principal curvature, gaussian curvature, and mean curvature for each region. The second step of approach concerns the application of eigenface and Linear Discriminant Analysis(LDA) method to reduce the dimension and classify. In the last step, the aggregation of the individual classifiers using the fuzzy integral is explained for each region. In the experimental results, using the depth threshold value 40 (DT40) show the highest recognition rate among the regions, and the maximum curvature achieves 98% recognition rate, incase of fuzzy integral.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.23 no.3
• /
• pp.313-322
• /
• 2005

Rapid advances in technology and changes in human and cultural activities bring about changes to the earth surface in terms of spatial extension as well as time frame of the changes. Such advances introduce shorter updating frequency of maps and geospatial database. To satisfy these requirements, recent research efforts in the geoinformatics field have been focused on the automation and speeding up of the mapping processes which resulted in products such as the digital photogrammetric workstation, GPSIINS, applications of satellite imagery, automatic feature extraction and the LiDAR system. The possibility of automatically extracting buildings and generating contours from airborne LiDAR data has received much attention because LiDAR data produce promising results. However, compared with the manually derived building footprints using traditional photogrammetric process, more investigation and analysis need to be carried out in terms of accuracy and efficiency. On the other hand, generation of the contours with LiDAR data is more efficient and economical in terms of the quality and accuracy. In this study, the effects of various conditions of the pre-processing phase and the subsequent building extraction and contour generation phases for digital mapping have on the accuracy were investigated.

• Journal of Advanced Navigation Technology
• /
• v.5 no.2
• /
• pp.123-133
• /
• 2001

The existing visualization methods using the satellite images or map images require complicated preprocessing stages and a large amount of visual data to represent the 3-D terrain. This paper presents a 3-D visualization method for geographical information, which enables automatic generation of 3-D terrain. It is generated based, on contour information obtained from a numerical map. This paper also introduces a method that resolves the three main problems needed to visualize 3-D terrain from contour lines such as correspondence, tiling, and branching. The virtual contour line is defined to extend a distorted contour line to have a similar shape to the corresponding contour line that is used, to generate 3-D surfaces. It helps that 3-D terrain is represented exactly and in detail.