東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Algorithms for map construction and ...

Ahmed, Mahmuda.

FindBook

Google Book

Amazon

博客來

Algorithms for map construction and comparison.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Algorithms for map construction and comparison./
作者:	Ahmed, Mahmuda.
面頁冊數:	175 p.
附註:	Source: Dissertation Abstracts International, Volume: 77-01(E), Section: B.
Contained By:	Dissertation Abstracts International77-01B(E).
標題:	Computer science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3721697
ISBN:	9781339033914

Algorithms for map construction and comparison.
Ahmed, Mahmuda.

Algorithms for map construction and comparison. - 175 p.

Source: Dissertation Abstracts International, Volume: 77-01(E), Section: B.

Thesis (Ph.D.)--The University of Texas at San Antonio, 2015.

Analyzing and mining various kinds of geo-referenced data is important in many application areas. We use two types of data: geo-referenced trajectories, such as vehicular tracking data, as well as geo-referenced graph data, such as street maps.

ISBN: 9781339033914Subjects--Topical Terms:

523869
Computer science.

Algorithms for map construction and comparison.
LDR:03481nmm a2200325 4500 001 2079451
005 20170313112148.5
008 170521s2015 ||||||||||||||||| ||eng d
020 $a 9781339033914
035 $a (MiAaPQ)AAI3721697
035 $a AAI3721697
040 $a MiAaPQ $c MiAaPQ
100 1 $a Ahmed, Mahmuda. $3 2165483
245 1 0 $a Algorithms for map construction and comparison.
300 $a 175 p.
500 $a Source: Dissertation Abstracts International, Volume: 77-01(E), Section: B.
500 $a Advisers: Carola Wenk; Matt Gibson.
502 $a Thesis (Ph.D.)--The University of Texas at San Antonio, 2015.
520 $a Analyzing and mining various kinds of geo-referenced data is important in many application areas. We use two types of data: geo-referenced trajectories, such as vehicular tracking data, as well as geo-referenced graph data, such as street maps.
520 $a This dissertation consists of two main parts. In the first part, we consider the problem of constructing street maps from geo-referenced trajectories: Given a set of trajectories in the plane, compute a street-map that represents all trajectories in the set. In this part, we have two main contributions. First, we present a scalable incremental algorithm that is based on partial matching of the trajectories to the graph. For the partial matching we introduce a new variant of partial Frechet distance. We use minimum-link paths to reduce the complexity of the generated map. We provide quality guarantees and experimental results based on both real and synthetic data.
520 $a We further present two multi-thresholding techniques for density-based map construction algorithms. Multi-thresholding is necessary because some streets are travelled more heavily than other streets (highways vs. neighborhood streets), which results in different sampling densities, and thus, one threshold fails to capture all the streets. We present a new thresholding technique that uses persistent homology combined with statistical analysis to determine a small set of thresholds that captures all or most of the significant topological features. We also formalize the selection of thresholds in a density-based map construction algorithm for different variants of uniform sampling.
520 $a In part two of the dissertation, we consider the map comparison problem: Given two street-maps embedded in space, quantify their differences. Given maps of the same city collected from different sources, researchers often need to know how they differ. Map comparison is very important in the field of transportation network analysis as well as to assess the quality of map construction algorithms. We present a new path-based distance measure to compare two planar geometric graphs that are embedded in the same plane. Our distance measure takes structural as well as spatial properties into account. We show that it can be approximated in polynomial time and it preserves structural and spatial properties of the graphs. We provide experimental results comparing vendor quality street maps (TeleAtlas) with open source maps (OpenStreetMap), as well as maps generated by map construction algorithms with ground-truth maps (OpenStreetMap).
590 $a School code: 1283.
650 4 $a Computer science. $3 523869
650 4 $a Geographic information science and geodesy. $3 2122917
650 4 $a Transportation. $3 555912
690 $a 0984
690 $a 0370
690 $a 0709
710 2 $a The University of Texas at San Antonio. $b Computer Science. $3 1065531
773 0 $t Dissertation Abstracts International $g 77-01B(E).
790 $a 1283
791 $a Ph.D.
792 $a 2015
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3721697