幾何学的位置関係に基づく地図検索

Translated title of the contribution: Map Retrieval Based on Geometric Spatial Relations

志水 亨, 池崎 正和, 牛尼 剛聡, 渡邉 豊英

Research output: Contribution to journalArticle

Abstract

Until now, many researchers have proposed spatial relations between geographical objects in the field of geographical information systems and spatial databases. However, these proposals have focused on binary relations to represent the features of geographical objects, but have not concentrated on the complexity among geographical objects. In this paper, we aim to model the complex structure among geographical objects. To represent the structure among geographical objects, we define the geometric spatial relation which is composed of an overlapping relation, an adjoining relation, and a neighboring relation. Additionally, we discuss a retrieval function which finds out similar locations by using a sketch as a query. In order to find out locations, we generate a graph structure for representing the relationships among geographical objects using the three relations. We find a similar structure by comparing two graph structures. To decide a similar structure, we define the similarity which is calculated by correspondence among relations. The correspondence among relations is the value which shows the difference between a query and data. By using this similarity, we can find not only sub-graphs but also similarity graphs.
Original languageJapanese
Pages (from-to)522-531
Number of pages10
JournalIEEJ Transactions on Electronics, Information and Systems
Volume129
Issue number3
DOIs
Publication statusPublished - Mar 1 2009

Fingerprint

Information systems

Cite this

幾何学的位置関係に基づく地図検索. / 志水亨; 池崎正和; 牛尼剛聡; 渡邉豊英.

In: IEEJ Transactions on Electronics, Information and Systems, Vol. 129, No. 3, 01.03.2009, p. 522-531.

Research output: Contribution to journalArticle

志水亨 ; 池崎正和 ; 牛尼剛聡 ; 渡邉豊英. / 幾何学的位置関係に基づく地図検索. In: IEEJ Transactions on Electronics, Information and Systems. 2009 ; Vol. 129, No. 3. pp. 522-531.
@article{52bc94f44b824091901688a4d1876133,
title = "幾何学的位置関係に基づく地図検索",
abstract = "Until now, many researchers have proposed spatial relations between geographical objects in the field of geographical information systems and spatial databases. However, these proposals have focused on binary relations to represent the features of geographical objects, but have not concentrated on the complexity among geographical objects. In this paper, we aim to model the complex structure among geographical objects. To represent the structure among geographical objects, we define the geometric spatial relation which is composed of an overlapping relation, an adjoining relation, and a neighboring relation. Additionally, we discuss a retrieval function which finds out similar locations by using a sketch as a query. In order to find out locations, we generate a graph structure for representing the relationships among geographical objects using the three relations. We find a similar structure by comparing two graph structures. To decide a similar structure, we define the similarity which is calculated by correspondence among relations. The correspondence among relations is the value which shows the difference between a query and data. By using this similarity, we can find not only sub-graphs but also similarity graphs.",
author = "亨 志水 and 正和 池崎 and 剛聡 牛尼 and 豊英 渡邉",
year = "2009",
month = "3",
day = "1",
doi = "10.1541/ieejeiss.129.522",
language = "Japanese",
volume = "129",
pages = "522--531",
journal = "IEEJ Transactions on Electronics, Information and Systems",
issn = "0385-4221",
publisher = "The Institute of Electrical Engineers of Japan",
number = "3",

}

TY - JOUR

T1 - 幾何学的位置関係に基づく地図検索

AU - 志水, 亨

AU - 池崎, 正和

AU - 牛尼, 剛聡

AU - 渡邉, 豊英

PY - 2009/3/1

Y1 - 2009/3/1

N2 - Until now, many researchers have proposed spatial relations between geographical objects in the field of geographical information systems and spatial databases. However, these proposals have focused on binary relations to represent the features of geographical objects, but have not concentrated on the complexity among geographical objects. In this paper, we aim to model the complex structure among geographical objects. To represent the structure among geographical objects, we define the geometric spatial relation which is composed of an overlapping relation, an adjoining relation, and a neighboring relation. Additionally, we discuss a retrieval function which finds out similar locations by using a sketch as a query. In order to find out locations, we generate a graph structure for representing the relationships among geographical objects using the three relations. We find a similar structure by comparing two graph structures. To decide a similar structure, we define the similarity which is calculated by correspondence among relations. The correspondence among relations is the value which shows the difference between a query and data. By using this similarity, we can find not only sub-graphs but also similarity graphs.

AB - Until now, many researchers have proposed spatial relations between geographical objects in the field of geographical information systems and spatial databases. However, these proposals have focused on binary relations to represent the features of geographical objects, but have not concentrated on the complexity among geographical objects. In this paper, we aim to model the complex structure among geographical objects. To represent the structure among geographical objects, we define the geometric spatial relation which is composed of an overlapping relation, an adjoining relation, and a neighboring relation. Additionally, we discuss a retrieval function which finds out similar locations by using a sketch as a query. In order to find out locations, we generate a graph structure for representing the relationships among geographical objects using the three relations. We find a similar structure by comparing two graph structures. To decide a similar structure, we define the similarity which is calculated by correspondence among relations. The correspondence among relations is the value which shows the difference between a query and data. By using this similarity, we can find not only sub-graphs but also similarity graphs.

U2 - 10.1541/ieejeiss.129.522

DO - 10.1541/ieejeiss.129.522

M3 - 記事

VL - 129

SP - 522

EP - 531

JO - IEEJ Transactions on Electronics, Information and Systems

JF - IEEJ Transactions on Electronics, Information and Systems

SN - 0385-4221

IS - 3

ER -