• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.775-779
• /
• 2002

Currently, high-resolution satellite imagery such as KOMPSAT and IKONOS has been tentatively utilized to various types of urban engineering problems such as transportation planning, site planning, and utility management. This approach aims at software development and followed applications of remotely sensed imagery to transportation geographic analysis. At first, GDPA (Gradient Direction Profile Algorithm) and main modules in it are overviewed, and newly implemented results under MS visual programming environment are presented with main user interface, input imagery processing, and internal processing steps. Using this software, road network are automatically generated. Furthermore, this road network is used to transportation geographic analysis such as gamma index and road pattern estimation. While, this result, being produced to do-facto format of ESRI-shapefile, is used to several types of road layers to urban/transportation planning problems. In this study, road network using KOMPSAT EOC imagery and IKONOS imagery are directly compared to multiple road layers with NGI digital map with geo-coordinates, as ground truth; furthermore, accuracy evaluation is also carried out through method of computation of commission and omission error at some target area. Conclusively, the results processed in this study is thought to be one of useful cases for further researches and local government application regarding transportation geographic analysis using remotely sensed data sets.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.20 no.1
• /
• pp.132-145
• /
• 2021

This study analyzes the main road network for road users to manage roads efficiently and derives problematic road sections to be improved. Traditional road management has been operated by manager-oriented view and a diversified road management system based on congestion. Therefore, in this research, the mail road Network was selected from the viewpoint of passenger-oriented, logistics-oriented and tourism-oriented, and the problematic road sections were derived through Level Of Service (LOS) analysis, safety analysis using EPDO accident rate, and network service analysis. This study emphasizes the efficient user-oriented road construction and management system and the need of constructing a mail road network, and it suggests the improvement strategies.

• Korean Journal of Remote Sensing
• /
• v.18 no.5
• /
• pp.263-271
• /
• 2002

Recently, spatial information technologies using remotely sensed imagery and functionality of GIS (Geographic Information Systems) have been widely utilized to various types of transportation-related applications. In this study, extraction programs of some practical indices, to be effectively used in transportation reference planning problem, were designed and implemented as prototyped extensions in GIS development environment: traffic flow estimation (TFL/TFB), urban rural index (URI), and accessibility index (AI). In TFL/TFB, user can obtain quantitative results on traffic flow estimation at link/block using high-resolution satellite imagery. Whereas, URI extension provides urban-rural characteristics related to road system, being considered one of important factors in transportation planning. Lastly, AI extension helps to obtain accessibility index between nodes of road segments and surrounding district areas touched or intersected with the road network system, and it also provides useful information for transportation planning problems. This approach is regarded as one of RS-T (Remote Sensing in Transportation), and it is expected to expand as new application of remotely sensed imagery.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.4
• /
• pp.889-898
• /
• 2013

The shortest-path searching algorithm must not only find a global solution to the destination, but also solve a turn penalty problem (TPP) in an urban road transportation network (URTN). Although the Dijkstra algorithm (DA) as a representative node-based algorithm secures a global solution to the shortest path search (SPS) in the URTN by visiting all the possible paths to the destination, the DA does not solve the TPP and the slow execution speed problem (SEP) because it must search for the temporary minimum cost node. Potts and Oliver solved the TPP by modifying the visiting unit from a node to the link type of a tree-building algorithm like the DA. The Multi Tree Building Algorithm (MTBA), classified as a representative Link Based Algorithm (LBA), does not extricate the SEP because the MTBA must search many of the origin and destination links as well as the candidate links in order to find the SPS. In this paper, we propose a new Link-Based Single Tree Building Algorithm in order to reduce the SEP of the MTBA by applying the breaking rule to the LBA and also prove its usefulness by comparing the proposed with other algorithms such as the node-based DA and the link-based MTBA for the error rates and execution speeds.

• Journal of Forest and Environmental Science
• /
• v.32 no.1
• /
• pp.1-9
• /
• 2016

Accessibility of urban green space, as an important index of evaluating the service level of urban green space, not only shows the resident's access to green space, but also reflects the environment quality of urban living. Since the quantity, area and space distribution of the patches in urban green space directly affect the function of urban green space and the quality of urban environment, the research on the accessibility of urban green space holds great significance to improve the service of urban green space and the living environment quality. Based on GIS software, this research uses the road network and the population distribution data of Nanjing's city proper to conduct quantitative analysis of the accessibility of park green space and the convenience for residents to travel under different forms of transportation. After the case analysis, the author tests the application of road network in studying the accessibility of urban park green space and proposes a GIS-based method to study the accessibility and the rational layout of urban green space.

• Korean Journal of Remote Sensing
• /
• v.20 no.1
• /
• pp.57-64
• /
• 2004

In GIS-based network analysis, topological measure of network structure can be considered as one of important factors in the urban transportation analysis. Related to this measure, it is known that the connectivity indices such as alpha index and gamma index, which mean degree of network connectivity and complexity on a graph or a circuit, provide fundamental information. On the other hand, shimbel index is one of GIS-based spatial metrics to characterize degree of network concentration. However, the approach using these quantitative indices has not been widely used in practical level yet. In this study, an application program, in complied as extension, running on ArcView- GIS is implemented and demonstrated case examples using basic layers such as road centerline and administrative boundary. In this approach, geo-spatial imagery can be effectively used to actual applications to determine the analysis zone, which is composed of networks to extract these indices. As the results of the implementation and the case examples, it is notified that alpha and gamma indices as well as shimbel index can be used as referential data or auxiliary information for urban planning and transportation planning.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.11
• /
• pp.4483-4501
• /
• 2020

Recent findings identified the scatter and shape of MFD (macroscopic fundamental diagram) is heavily influenced by the spatial distribution of link density in a road network. This implies that the concept of MFD can be utilized to divide a heterogeneous road network with different degrees of congestion into multiple homogeneous subnetworks. Considering the actual traffic data is usually incomplete and inaccurate while most traffic partition algorithms rely on the completeness of the data, we proposed a three-step partitioned algorithm called Iso-MB (Isoperimetric algorithm - Merging - Boundary adjustment) permitting of incompletely input data in this paper. The proposed algorithm was implemented and verified in a simulated urban transportation network. The existence of well-defined MFD in each subnetwork was revealed and discussed and the selection of stop parameter in the isoperimetric algorithm was explained and dissected. The effectiveness of the approach to the missing input data was also demonstrated and elaborated.

• The Journal of Bigdata
• /
• v.2 no.2
• /
• pp.1-7
• /
• 2017

Intelligent transportation system (ITS) has been introduced to maximize the efficiency of operation and utilization of the urban traffic facilities and promote the safety and convenience of the users. With the expansion of ITS, various traffic big data such as road traffic situation, traffic volume, public transportation operation status, management situation, and public traffic use status have been increased exponentially. In this paper, we derive structural characteristics of urban traffic according to the vehicle flow by using big data network analysis. DSRC (Dedicated Short Range Communications) data is used to construct the traffic network. The results can help to understand the complex urban traffic characteristics more easily and provide basic research data for urban transportation plan such as road congestion resolution plan, road expansion plan, and bus line/interval plan in a city.

• Proceedings of the Korean Society of Disaster Information Conference
• /
• 2023.11a
• /
• pp.259-260
• /
• 2023

The rapid urbanization and modernization observed in countries like Myanmar have led to significant concerns regarding traffic congestion, especially in urban areas. This study focuses on the analysis and revitalization of urban transport in selected areas of Myanmar. The core of urban transportation planning lies in travel forecasting, which employs models to predict future traffic patterns and guide decisions related to road capacity, transit services, and land use policies. Travel demand modeling involves a series of mathematical models that simulate traveler behavior and decision-making within a transportation system, including highways, transit options, and policies. The paper offers an overview of the traditional four-step transportation modeling system, utilizing a simplified transport network in the context of Mandalay City, Myanmar.

• Journal of Korean Society of Transportation
• /
• v.19 no.4
• /
• pp.85-96
• /
• 2001

This paper discusses the problem of finding the Origin-Destination(O-D) shortest path in urban road networks that have variable special qualifies such as time windows for passing as well as geometrical special qualities such as U-turn and left-turn prohibition. The focus of this paper is motivated by the problem of finding minimum travel time paths for an advanced traveler information system (ATIS) in the context of intelligent transportation system(ITS) application. The transportation network with variable and geometrical special qualities is a more realistic representation of the urban road network in the real word. But, the traditional and existing shortest path algorithms can not search practical shortest path that variable special quality is reflected. This paper presents a shortest path algorithm which can search reasonable shortest path information for the urban ATIS application within a real time. The algorithm is based on genetic algorithm(GA). The high performance of the proposed algorithm is demonstrated by computer simulations.