scholarly journals Implementation of weighted Dijkstra’s shortest-path algorithm for n-D images

2009 ◽  
Author(s):  
Lior Weizman ◽  
Moti Freiman ◽  
Leo Joskowicz
Keyword(s):  
Shortest Path ◽  
Weighting Function ◽  
Graph Representation ◽  
Distance Metric ◽  
Shortest Path Algorithm ◽  
Weighting Functions ◽  
Path Information ◽  
Extraction Algorithm ◽  
Neighboring Mode ◽  
Path Extraction

This paper describes the ITK implementation of a shortest path extraction algorithm based on graph representation of the image and the Dijkstra shortest path algorithm. The method requires the user to provide two inputs: 1. path information in the form of start, end, and neighboring mode, the form of which path is allowed to propagate between neighboring pixels, and 2. a weighting function which sets the distance metric between neighboring pixels. A number of perspectives for choosing weighting functions are given, as well as examples using real images. This paper can also serve as an example for utilizing the Boost C++ graph library into the ITK framework.

Utilizing Restricted Direction Strategy and Binary Heap Technology to Optimize Dijkstra Algorithm in WebGIS

2009 ◽  
Vol 419-420 ◽  
pp. 557-560 ◽  
Author(s):  
Rui Li
Keyword(s):  
Shortest Path ◽  
Operating Efficiency ◽  
Dijkstra Algorithm ◽  
Shortest Path Algorithm ◽  
Research Focus ◽  
Network Information ◽  
The Core ◽  
Highway Network ◽  
Core Issue ◽  
Storage Structures

Shortest path is the core issue in application of WebGIS. Improving the efficiency of the algorithm is an urgent requirement to be resolved at present. By the lossy algorithm analyzing, which is the current research focus of the shortest path algorithm to optimize, utilizing adjacency table of storage structures, restricted direction strategy and binary heap technology to optimize the algorithm, thereby reduce the scale of algorithm to improve the operating efficiency of algorithm. This scheme has been applied in the simulation of the data downloaded from the Guangdong Provincial Highway Network Information System and satisfactory results have been obtained.

scholarly journals Shortest path algorithm for optimal sectioning of hydrocarbon transport pipeline

2016 ◽  
Vol 49 (12) ◽  
pp. 532-537
Author(s):  
A. Cano-Acosta ◽  
John Fontecha ◽  
Nubia Velasco ◽  
Felipe Muñoz-Giraldo
Keyword(s):  
Shortest Path ◽  
Shortest Path Algorithm ◽  
Hydrocarbon Transport

A Novel QoS Aware Shortest Path Algorithm for VSDN

2017 ◽  
Vol 6 (1) ◽  
pp. 1-14
Author(s):  
Amandeep Kaur Sandhu ◽  
Jyoteesh Malhotra
Keyword(s):  
Energy Consumption ◽  
Shortest Path ◽  
Service Providers ◽  
Service Level Agreement ◽  
Service Level ◽  
Software Defined Networks ◽  
Shortest Path Algorithm ◽  
Internet Service ◽  
Decrease Energy Consumption

This article describes how a rapid increase in usage of internet has emerged from last few years. This high usage of internet has occurred due to increase in popularity of multimedia applications. However, there is no guarantee of Quality of Service to the users. To fulfill the desired requirements, Internet Service Providers (ISPs) establish a service level agreement (SLA) with clients including specific parameters like bandwidth, reliability, cost, power consumption, etc. ISPs make maximum SLAs and decrease energy consumption to raise their profit. As a result, users do not get the desired services for which they pay. Virtual Software Defined Networks are flexible and manageable networks which can be used to achieve these goals. This article presents shortest path algorithm which improves the matrices like energy consumption, bandwidth usage, successful allocation of nodes in the network using VSDN approach. The results show a 40% increase in the performance of proposed algorithms with a respect to existing algorithms.

Sign in / Sign up

Export Citation Format

Share Document