Generalized Shortest Path-based Superpixels for Accurate Segmentation of Spherical Images

The shortest path problem is one of the optimization problems where the optimization value is a distance. In general, solving the problem of the shortest route search can be done using two methods, namely conventional methods and heuristic methods. The Ant Colony Optimization (ACO) is the one of the optimization algorithm based on heuristic method. ACO is adopted from the behavior of ant colonies which naturally able to find the shortest route on the way from the nest to the food sources. In this study, ACO is used to determine the shortest route from Bumi Senyiur Hotel (origin point) to East Kalimantan Governor's Office (destination point). The selection of the origin and destination points is based on a large number of possible major roads connecting the two points. The data source used is the base map of Samarinda City which is cropped on certain coordinates by using Google Earth app which covers the origin and destination points selected. The data pre-processing is performed on the base map image of the acquisition results to obtain its numerical data. ACO is implemented on the data to obtain the shortest path from the origin and destination point that has been determined. From the study results obtained that the number of ants that have been used has an effect on the increase of possible solutions to optimal. The number of tours effect on the number of pheromones that are left on each edge passed ant. With the global pheromone update on each tour then there is a possibility that the path that has passed the ant will run out of pheromone at the end of the tour. This causes the possibility of inconsistent results when using the number of ants smaller than the number of tours.

Download Full-text

One dynamic shortest path algorithm in a traffic network based on a genetic algorithm

Advances in Civil, Transportation and Environmental Engineering ◽

10.2495/ctee120281 ◽

2013 ◽

Author(s):

Shuijian Zhang

Keyword(s):

Genetic Algorithm ◽

Shortest Path ◽

Traffic Network ◽

Shortest Path Algorithm

Download Full-text

Finding Shortest Path Basing on Dijkstra's Algorithm For Baghdad Universities by using Geographic Information System Applications

10.25212/icoit17.030 ◽

2017 ◽

Author(s):

Roaa Ebada Saeed ◽

Amer Saleem Elameer ◽

Rafah Shahab Alhamdani

Keyword(s):

Information System ◽

Geographic Information System ◽

Shortest Path ◽

Geographic Information ◽

Dijkstra’S Algorithm ◽

Dijkstra's Algorithm

Download Full-text

Methods for constructing virtual panoramic tours

CPT2020 The 8th International Scientific Conference on Computing in Physics and Technology Proceedings ◽

10.30987/conferencearticle_5fd755bfc5fd33.19622200 ◽

2020 ◽

Author(s):

Elizaveta Koptenok ◽

Natalia Lagereva ◽

Arsenii Savenko ◽

Ilia Fomin

Keyword(s):

Real Estate ◽

Web Service ◽

Virtual Museums ◽

Implementation Method ◽

Spherical Images

The article discusses the existing methods for building virtual panoramic tours. A proprietary implementation method based on the Yandex JS API technology is proposed. The designed web service allows to automatically create virtual panoramic tours from a collection of panoramic spherical images "in one click", in contrast to the considered analogues. The developed technology should be used for educational purposes, for example, for the implementation of virtual museums, as well as on real estate trading platforms to increase ad views and improve sales.

Download Full-text