### 抄録

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.

元の言語 | 英語 |
---|---|

ページ（範囲） | 522-531+16 |

ジャーナル | IEEJ Transactions on Electronics, Information and Systems |

巻 | 129 |

発行部数 | 3 |

DOI | |

出版物ステータス | 出版済み - 1 1 2009 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Electrical and Electronic Engineering

### これを引用

*IEEJ Transactions on Electronics, Information and Systems*,

*129*(3), 522-531+16. https://doi.org/10.1541/ieejeiss.129.522

**Map retrieval based on geometric spatial relations.** / Shimizu, Toru; Ikezaki, Masakazu; Ushiama, Taketoshi; Watanabe, Toyohide.

研究成果: ジャーナルへの寄稿 › 記事

*IEEJ Transactions on Electronics, Information and Systems*, 巻. 129, 番号 3, pp. 522-531+16. https://doi.org/10.1541/ieejeiss.129.522

}

TY - JOUR

T1 - Map retrieval based on geometric spatial relations

AU - Shimizu, Toru

AU - Ikezaki, Masakazu

AU - Ushiama, Taketoshi

AU - Watanabe, Toyohide

PY - 2009/1/1

Y1 - 2009/1/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.

UR - http://www.scopus.com/inward/record.url?scp=65349171414&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=65349171414&partnerID=8YFLogxK

U2 - 10.1541/ieejeiss.129.522

DO - 10.1541/ieejeiss.129.522

M3 - Article

AN - SCOPUS:65349171414

VL - 129

SP - 522-531+16

JO - IEEJ Transactions on Electronics, Information and Systems

JF - IEEJ Transactions on Electronics, Information and Systems

SN - 0385-4221

IS - 3

ER -