• Title/Summary/Keyword: Dijkstra Algorithm

Search Result 163, Processing Time 0.023 seconds

A Seamline Extraction Technique Considering the Characteristic of NDVI for High Resolution Satellite Image Mosaics (고해상도 위성영상 모자이크를 위한 NDVI 특성을 이용한 접합선 추출 기법)

  • Kim, Jiyoung;Chae, Taebyeong;Byun, Younggi
    • Korean Journal of Remote Sensing
    • /
    • v.31 no.5
    • /
    • pp.395-408
    • /
    • 2015
  • High-resolution satellite image mosaics are becoming increasingly important in the field of remote sensing image analysis as an essential image processing to create a large image constructed from several smaller images. In this paper, we present an automatic seamline extraction technique and the procedure to generate a mosaic image by this technique. For more effective seamline extraction in the overlap region of adjacent images, an NDVI-based seamline extraction technique is developed, which takes advantage of the computational time and memory. The Normalized Difference Vegetation Index(NDVI) is an index of plant "greeness" or photosynthetic activity that is employed to extract the initial seamline. The NDVI can divide into manmade region and natural region. The cost image is obtained by the canny edge detector and the buffering technique is used to extract the ranging cost image. The seamline is extracted by applying the Dijkstra algorithm to a cost image generated through the labeling process of the extracted edge information. Histogram matching is also conducted to alleviate radiometric distortion between adjacent images acquired at different time. In the experimental results using the KOMPSAT-2/3 satellite imagery, it is confirmed that the proposed method greatly reduces the visual discontinuity caused by geometric difference of adjacent images and the computation time.

Optimal Moving Pattern Mining using Frequency of Sequence and Weights (시퀀스 빈발도와 가중치를 이용한 최적 이동 패턴 탐사)

  • Lee, Yon-Sik;Park, Sung-Sook
    • Journal of Internet Computing and Services
    • /
    • v.10 no.5
    • /
    • pp.79-93
    • /
    • 2009
  • For developing the location based service which is individualized and specialized according to the characteristic of the users, the spatio-temporal pattern mining for extracting the meaningful and useful patterns among the various patterns of the mobile object on the spatio-temporal area is needed. Thus, in this paper, as the practical application toward the development of the location based service in which it is able to apply to the real life through the pattern mining from the huge historical data of mobile object, we are proposed STOMP(using Frequency of sequence and Weight) that is the new mining method for extracting the patterns with spatial and temporal constraint based on the problems of mining the optimal moving pattern which are defined in STOMP(F)[25]. Proposed method is the pattern mining method compositively using weighted value(weights) (a distance, the time, a cost, and etc) for our previous research(STOMP(F)[25]) that it uses only the pattern frequent occurrence. As to, it is the method determining the moving pattern in which the pattern frequent occurrence is above special threshold and the weight is most a little bit required among moving patterns of the object as the optimal path. And also, it can search the optimal path more accurate and faster than existing methods($A^*$, Dijkstra algorithm) or with only using pattern frequent occurrence due to less accesses to nodes by using the heuristic moving history.

  • PDF

The network reliability based OLSR protocol (네트워크의 신뢰도를 고려한 OLSR 프로토콜)

  • Woo, Hyun-Jae;Lee, Dong-Yul;Lee, Chae-Woo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.6
    • /
    • pp.68-76
    • /
    • 2008
  • It is difficult to maintain mutes in the mobile ad hoc network (MANET) due to the high probability of disconnected routes break by frequent change of topology. The links can have the different reliability about data transmission due to these characteristics. Hence a measure which can evaluate this reliability and a algorithm which reflects this are required. In this paper, we propose routing algorithm based on reliability about transmission. First the bayesian inference which infers the hypothesis by past information is considered to obtain the link's transmission reliability. The other is that the link-based reliability estimation model which considers each link's reliability additionally is proposed while the standard uses only Dijkstra's shortest path algorithm. the simulation results using NS-2 show that the performance of proposed algorithm is superior to the standard OLSR in terms of throughput and stability.

A Point-to-Multipoint Routing Path Selection Algorithm for Dynamic Routing Based ATM Network (동적 라우팅기반의 점대다중점 라우팅 경로 선택)

  • 신현순;이상호;이경호;박권철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.8A
    • /
    • pp.581-590
    • /
    • 2003
  • This paper proposes the routing path selection mechanism for source routing-based PtMP (Point-to-Multipoint) call in ATM switching system. Especially, it suggests PtMP routing path selection method that can share the maximum resource prior to the optimal path selection, guarantee the reduction of path calculation time and cycle prevention. The searching for the nearest branch point from destination node to make the maximum share of resource is the purpose of this algorithm. Therefore among neighbor nodes from destination node by back-tracking, this algorithm fixes the node crossing first the node on existing path having the same Call ID as branch node, constructs the optimal PtMP routing path. The optimal node to be selected by back-tracking is selected by the use of Dijkstra algorithm. That is to say, PtMP routing path selection performs the step of cross node selection among neighboring nodes by back-tracking and the step of optimal node selection(optimal path calculation) among neighboring nodes by back-tracking. This technique reduces the process of search of routing information table for path selection and path calculation, also solves the cycle prevention easily during path establishment.

A Border Line-Based Pruning Scheme for Shortest Path Computations

  • Park, Jin-Kyu;Moon, Dae-Jin;Hwang, Een-Jun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.5
    • /
    • pp.939-955
    • /
    • 2010
  • With the progress of IT and mobile positioning technologies, various types of location-based services (LBS) have been proposed and implemented. Finding a shortest path between two nodes is one of the most fundamental tasks in many LBS related applications. So far, there have been many research efforts on the shortest path finding problem. For instance, $A^*$ algorithm estimates neighboring nodes using a heuristic function and selects minimum cost node as the closest one to the destination. Pruning method, which is known to outperform the A* algorithm, improves its routing performance by avoiding unnecessary exploration in the search space. For pruning, shortest paths for all node pairs in a map need to be pre-computed, from which a shortest path container is generated for each edge. The container for an edge consists of all the destination nodes whose shortest path passes through the edge and possibly some unnecessary nodes. These containers are used during routing to prune unnecessary node visits. However, this method shows poor performance as the number of unnecessary nodes included in the container increases. In this paper, we focus on this problem and propose a new border line-based pruning scheme for path routing which can reduce the number of unnecessary node visits significantly. Through extensive experiments on randomly-generated, various complexity of maps, we empirically find out optimal number of border lines for clipping containers and compare its performance with other methods.

Case Study for Telecommunication Network Design based on Optimal Path Algorithm (최적경로 알고리듬을 활용한 경제적인 통신망 설계 적용 사례)

  • Jung, Ju-Young;Choi, Yun-Soo;Jun, Chul-Min;Cho, Seong-Kil
    • Journal of Korea Spatial Information System Society
    • /
    • v.8 no.1 s.16
    • /
    • pp.107-118
    • /
    • 2006
  • In this paper, several network algorithms were tested to find an optimal one for telecommunication network design. Algorithms such as Dijkstra's shortest path algorithm, Ford-Bellman's shortest path algorithm, Prim's minimum spanning tree algorithm, and Kruscal's minimum spanning tree algorithm were reviewed and compared in terms of feasibility and resulted network construction cost. Then an optimal algorithm that is most suitable for telecommunication network design was selected. For more specific and quantitative analysis of the selected algorithm, it was implemented to a real telecommunication network construction site. The analyzed results showed that the suggested design method when compared with the conventional one, reduced the network construction cost considerably. The total network length estimated by the conventional method were 5267 meters while the suggested method resulted in 4807 meters. Thus the new method reduced the total network length by 8.7 percent which is equivalent to 97,469,000 Won of construction cost. Considering the frequent telecommunication network constructions, due to new urban developments in the nation, the economic benefit of the suggested telecommunication network design method will be significant. In addition to the construction cost savings, the suggested telecommunication network design procedure possesses several other economic benefits. Since the design procedure can be standardized and automatized, it can reduce the design cost itself and the skill acquirement periods required for new or inapt design crews. Further, due to the standardized and automatized design procedure, any telecommunication network design results can accessed more objectively.

  • PDF

An Operation Scheduling of Transporters Considering Turns and Passing Delay at the Intersection Roads on the Shipyard (교차로 구간 회전 및 감속을 고려한 트랜스포터 최소 공주행 운영계획)

  • Moon, Jong-Heon;Ruy, Won-Sun;Cho, Doo-Yeoun
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.54 no.3
    • /
    • pp.187-195
    • /
    • 2017
  • The operation planning of transports used to move blocks is the one of key factors. Furthermore, reducing the running time through the effective plan contributes to pulling forward the whole logistic process of the shipyard and substantially saving the fuel consumption of itself as well. The past researches of the transporter focused on finding only the shortest distances, so called, Manhattan distance. However, these searching approaches cannot help having the significant difference in the real operational time and distance with the minimum cost approach which considers the speed retardation for turns or safety at the intersection. This study suggests the noble transporter's operational model which could take account of the consuming operational time around the crossroads on the shipyard. Concretely, the proposed method guarantees the minimization of transporters' turns and passage number which are huge burdensome to the operation time and the whole planning of transports with the given period. Resultantly, this paper is willing to explain the appropriateness of our approach, compared with the previous ones.

The Design of a Mobile Robot Path Planning using a Clustering method (클러스터링 기법을 이용한 모바일 로봇 경로계획 알고리즘 설계)

  • Kang, Won-Seok;Kim, Jin-Wook;Kim, Young-Duk;An, Jin-Ung;Lee, Dong-Ha
    • Proceedings of the KIEE Conference
    • /
    • 2008.10b
    • /
    • pp.341-342
    • /
    • 2008
  • GA(Genetic Algorithm)는 NP-Complete 도메인이나 NP-Hard 도메인 내의 문제들에 대해서 최적의 해를 찾기 위해서 많이 사용되어 지는 진화 컴퓨팅 방법 중 하나이다. 모바일 로봇 기술 중 경로계획은 NP-Complete 도메인 영역의 문제 중 하나로 이를 해결하기 위해서 Dijkstra 등의 그래프 이론을 이용한 연구가 많이 연구되었고 최근에는 GA등 진화 컴퓨팅 기법을 이용하여 최적의 경로를 찾는 연구가 많이 수행되고 있다. 그러나 모바일 로봇이 처리해야 될 공간 정보 크기가 증가함에 따라 기존 GA의 개체의 크기가 증가되어 게산 복잡도가 높아져 시간 지연등의 문제가 발생할 수 있다. 이는 모바일 로봇의 잠재적 오류로 발생될 수 있다. 공간 정보에는 동적이 장애물들이 예측 불허하게 나타 날 수 있는데 이것은 전역 경로 계획을 수립할 때 또한 반영되어야 된다. 본 논문에서는 k-means 클러스터링 기법을 이용하여 장애물 밀집도 및 거리 정보를 기반으로 공간정보를 k개의 군집 공간으로 재분류하여 이를 기반으로 N*M개의 그리드 개체 집단을 생성하여 최적 경로계획을 수립하는 GA를 제시한다.

  • PDF

A Service Network Design Model for Less-than-Truckload Freight Transportation (소화물 운송 서비스 네트웍 설계 모형 연구)

  • 김병종;이영혁
    • Journal of Korean Society of Transportation
    • /
    • v.17 no.5
    • /
    • pp.111-122
    • /
    • 1999
  • A service network design model for LTL freight transportation is formulated as a mixed integer Programming Problem with two heuristic solution a1gorithms. The Proposed model derives the transportation Path for each origination-destination pair, taking into account transportation cost over the links and handling costs over the nodes. The first algorithm searches for a local minimum solution from a given initial solution by improving the quality of solution repeatedly while the second a1gorithm searches for a better solution using Simulated Annealing Method. For both solution algorithms, the initial solution is derived by a modified reverse Diikstras shortest Path a1gorithm. An illustrative example, Presented in the last part of the Paper, shows that the proposed algorithms find solutions which reduce the cost by 12% and 15% respectively, compared to the initial solution.

  • PDF

Implementing Autonomous Navigation of a Mobile Robot Integrating Localization, Obstacle Avoidance and Path Planning (위치 추정, 충돌 회피, 동작 계획이 융합된 이동 로봇의 자율주행 기술 구현)

  • Noh, Sung-Woo;Ko, Nak-Yong;Kim, Tae-Gyun
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.6 no.1
    • /
    • pp.148-156
    • /
    • 2011
  • This paper presents an implementation of autonomous navigation of a mobile robot indoors. It explains methods for map building, localization, obstacle avoidance and path planning. Geometric map is used for localization and path planning. The localization method calculates sensor data based on the map for comparison with the real sensor data. Monte Carlo Localization(MCL) method is adopted for estimation of the robot position. For obstacle avoidance, an artificial potential field generates repulsive and attractive force to the robot. Dijkstra algorithm plans the shortest distance path from a start position to a goal point. The methods integrate into autonomous navigation method and implemented for indoor navigation. The experiments show that the proposed method works well for safe autonomous navigation.