• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.183-185
• /
• 1999

주행 경로 안내는 최근 국내에서도 활발히 연구되고 있는 지능형 교통 시스템(ITS)의 주요 기능 중 하나이다. 주행 경로 안내를 위해서는 대규모 도로망에서 신속하게 경로를 찾는 방법과 찾은 경로를 음성 또는 기호로 운전자에게 효율적으로 안내하는 방법등이 필요하다. 본 논문에서는 도로망의 계층성을 휴리스틱 정보로 활용하여 최단시간 경로를 효율적으로 찾는 방법을 제안한다. 제안된 방법은 고속국도, 국도 등의 고속 주행용 도로만으로 소규모 상위 계층 도로망을 만들고 이를 기존 도로망에 덧붙이는 방식으로 통합한다. 이 통합망에 상위 계층 도로망을 우선적으로 찾도록 구성한 A* 알고리즘을 수행하여 최단시간 경로를 찾는다. 또 경로 탐색용 그래프가 디스크에 저장된 경우에, 디스크 접근을 최적화하기 위한 데이터베이스 설계 및 디스크 접근 방법을 기술한다. 제안된 방법의 효율성을 검증하기 위해 서울시 도로망 데이터를 이용하여 실험한 결과, 제안된 방법을 통해 경로 탐색 소요 시간, 디스크 입출력 회수, 메모리 사용량 등을 75%이상 줄일 수 있었다.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.10 no.3 s.49
• /
• pp.135-147
• /
• 2006

The essential information elements for the Earthquake Damage Evaluation System (EDES) of highway bridges are defined in this study, and a database construction method, which fits the circumstances of Korea, is proposed. The information elements for the EDES of highway bridges are categorized in two groups: structure related information, location related information. The structure related information is composed of the fragility curve information which is necessary for earthquake damage evaluation of highway bridges. The data structure of road network, which represents the location related information, is defined in more detail than the existing GIS-based data structure of road network for modeling of junctions. A pilot GIS-based EDES subjected to 110 bridges on expressway in Korea is developed, and it is verified that the proposed database construction method for the EDES can be used to develop a decision making system for quick retrofitting of the seismic damages of highway bridges and road network.

• Journal of Korean Society of Transportation
• /
• v.17 no.3
• /
• pp.73-85
• /
• 1999

In metropolitan area, intersections having turn Prohibitions are often found and it is important to consider them in path planning. This Paper presents a new path planning method road networks having turn prohibitions. A new road network model is proposed in which an alter-native route for each turn-Prohibition is constructed in off-line using U-turn or P-turn and then Put into road network database. The proposed network model is efficient since it requires no virtual nodes that are usually used in the conventional road networks to represent turns at intersections. In order to find a shortest path with the proposed network, a new shortest path algorithm is proposed. A knot for the turn-Prohibited node is newly defined and is used in comparing the cost of the alternative route with that of the other path.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.348-357
• /
• 2007

Due to the improved performance and cost of personal mobile devices and rapid progress of wireless communication technology, the number of users who utilize these devices is increasing. This trend requires various types of services be available to users. So far, there have been many solutions provided for the shortest path problem. But, technologies which can offer various recommendation services to user depending on user’s current location are focused on Euclidean spaces rather than road network. Thus, in this paper, we extend the previous work to satisfy this requirement on road network database. Our proposed scheme requires pre-computation for the efficient query processing. In the preprocessing step, we first partition the input road network into a fixed number of Voronoi polygons and then pre-compute routing information for each polygon. In the meantime, we select the number of Voronoi polygons in proposition to the scale of road network. Through this selection, the required size of pre-computation is linearly increasing to the size of road network. Using this pre-computated information, we can process queries more quickly. Through experiments, we have shown that our proposed scheme can achieve excellent performance in terms of scheduling time and the number of visited nodes.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.879-880
• /
• 2008

본 논문은 제주 택시 텔레매틱스 시스템에 축적되고 있는 차량들의 이동이력 데이터에 대한 처리구조를 설계하고 구현한다. 각 차량은 1분마다 자신의 위치와 GPS 정보 및 택시의 상태에 관련된 보고를 발생시키며 중앙의 관제시스템은 이를 수합하여 이력데이터를 구성한다. 본 논문에서 구현하는 시스템은 위치 보고를 처리하여 인코딩 변환, 좌표 변환, 맵 매칭, 도로상에서의 위치 계산 등을 수행한 후 오라클 데이터베이스의 이력 테이블에 저장하도록 한다. 이를 위하여 도로 네트워크가 데이터베이스로 변환되었으며 도로망에의 가시화를 위하여 지도 인터페이스 프로그램이 구현되었다. 이러한 정보들은 이력 테이블과 아울러 공간 데이터베이스 엔진과 결합하여 C 언어나 SQL 문장에 의하여 다양한 위치기반 질의를 가능하게 할 뿐 아니라 배차 정보 분석, 현재 통행 속도 분석 등 부가가치가 높은 정보를 산출하는데 필수적인 역할을 수행한다.

• Tunnel and Underground Space
• /
• v.9 no.3
• /
• pp.214-220
• /
• 1999

In this study, the validity of items of RMR system is evaluated and the applicability of this system to the data measured in Korean sites if discussed. Database was constructed from 139 sites, which are composed of subways, railway tunnels and road tunnels. These sites are located nationwide. Analysis shows that original classification of Bieniawski is valid although it was derived empirically. But it has considerable rating difference (error) in the result of Korean application. Thus new classification systems of KRMRI and KRMR2 are suggested, which are deduced from the Korean database. The former includes adjusted ratings and the latter adopts two more items. These are deduced by artificial neural network because it is difficult to select \`characteristic value'to estimate rock quality.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.4 no.3
• /
• pp.61-70
• /
• 2001

This paper presents a new method to extract semi-automatically roads from high spatial resolution satellite imagery. This method is based both on wavelet transform and on multiresolution analysis combined in the "$\grave{a}$ trous" algorithm. As an urban road network consists on different classes of streets, multiresolution processing allows to extract the streets class by class. The method was applied to a KVR-1000 image on a part of Busan Metropolitan City. The method was carried out for the road extraction of three different widths and it succeeded in extracting good fitted strips. The accuracy analysis for three types of streets was also performed. The overall accuracy in 4 pixels of width is 80.5%. The result suggests that this method can be used to update road networks in the studied urban network. In summary, the multiresolution approach based on the wavelet transform, used in this study, is regarded as one of effective methods to extract urban road network from high spatial resolution satellite images.

• Digital Contents
• /
• no.4 s.131
• /
• pp.37-46
• /
• 2004

속도가 느린 모뎀으로 데이터통신을 할 수 있다는 사실에 고마움을 느낀 게 바로 얼마전이지만 이제는 거리에서 게임을 즐기고, 차안에서도 주식시세를 확인하는 세상을 살고 있다. 더구나 유선과 무선으로 분리됐던 통신망을 단일망으로 통합하는‘NGN’에 이어 더 포괄적인 개념의‘BcN’구축사업이 본격화되고 있고, 곳곳에 컴퓨터 칩과 센서가 박히는‘유비쿼터스 시대’도 눈앞에 두고 있다. 언제(anytime), 어디서나(anywhere), 어느 기기(any device)든지, 미디어에 구애받지 않고(any media) 소통할 수 있는 4any시대가 열리고 있는 것이다. 이에 발맞춰 세계 유수의 기업들은 저마다 새로운 승부수를 던지고 있다. <디지털콘텐츠>는 2회에 걸쳐 인프라 변화추이를 살펴보고, 이에 따른 차세대 디지털콘텐츠 산업을 조망한다

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2010.04a
• /
• pp.687-691
• /
• 2010

구조물의 건전도를 평가하기 위해 상시 구조물 계측을 이용한 Structural Health Monitoring (SHM) 시스템을 적용하게 된다. SHM 시스템의 궁극적 목적은 계측된 데이터를 이용하여 구조물의 손상위치 및 손상정도를 분석하여 거주자에게 유지관리정보와 대처요령 신속하게 제공하는 것이다. 따라서 본 연구에서는 구조물의 손상탐지를 위해 인공신경망(Artificial Neural Network)을 도입한 알고리즘을 수립하고, 이를 3층 실대 RC Mock-up 구조물에 적용하여 성능을 평가하였다. 먼저 인공신경망의 학습을 위해 구조해석 프로그램을 이용하여 구조물의 손상에 따른 동적특성 변화 데이터베이스를 구축하였다. 그리고 학습된 인공망에 실제 구조물에서 추출한 동특성의 변화를 입력하여 손상탐지를 실시하였다. 이를 통해 인공신경망의 학습방법, 학습데이터의 정규화 방법 등을 규명하고 인공신경망을 이용한 손상탐지의 효과를 분석하였다.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.7 no.1
• /
• pp.84-93
• /
• 2004

Recently, domain-specific demands with respect to practical applications and analysis scheme using spatial thematic information are increasing. Accordingly, in this study, GIS-based application program is implemented to perform spatial analysis in transportation geography with base road layer data. Using this program, quantitative estimation of circuity and accessibility, which can be extracted from nodes composed of the graph-typed network structure, in a arbitrary analysis zone or administrative boundary zone is possible. Circuity is a concept to represent the difference extent between actual nodes and fully connected nodes in the analysis zone. While, accessibility can be used to find out extent of accessibility or connectivity between all nodes contained in the analysis zone, judging from inter-connecting status of the whole nodes. In put data of this program, which was implemented in AVX executable extension using AvenueTM of ArcView, is not transportation database information based on transportation data model, but layer data, directly obtaining from digital map sets. It is thought that computation of circuity and accessibility can be used as kinds of spatial analysis functions for GIS applications in the transportation field.