"Transit data"-based MST computation
<p>In this work, we present an innovative image recognition technique which is based on the exploitation of transit-data in images or simple photographs of sites of interest. Our objective is to automatically transform real-world images to graphs and, then, compute Minimum Spanning Trees (MST)...
Main Authors: | Thodoris Karatasos, Evi Papaioannou |
---|---|
Format: | Article |
Language: | English |
Published: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2017-10-01
|
Series: | Electronic Journal of Graph Theory and Applications |
Subjects: | |
Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/377 |
Similar Items
-
MST Based <i>Ab Initio</i> Assembler of Expressed Sequence Tags
by: Zhang, Yuan
Published: (2010) -
Average Case Analysis of the MST-heuristic for the Power Assignment Problem: Special Cases
by: Maurits de Graaf, et al.
Published: (2016-12-01) -
Binocular stereo matching algorithm based on MST cost aggregation
by: Jian Zhang, et al.
Published: (2021-04-01) -
Converting MST to TSP Path by Branch Elimination
by: Pasi Fränti, et al.
Published: (2021-12-01) -
An Improved Prim Algorithm for Connection Scheme of Last Train in Urban Mass Transit Network
by: Xiaoxu Zeng, et al.
Published: (2019-05-01)