### 抄録

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 similar locations by using a sketch as a query. In order to find 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 judge the occurrence of a similar structure, we define the similarity which is calculated by correspondence among relations. The correspondence among relations is a value which shows the difference between a query and data. By using this similarity, we can find not only subgraphs but also similarity graphs.

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

ページ（範囲） | 27-36 |

ページ数 | 10 |

ジャーナル | Electronics and Communications in Japan |

巻 | 94 |

発行部数 | 8 |

DOI | |

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

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Signal Processing
- Physics and Astronomy(all)
- Computer Networks and Communications
- Electrical and Electronic Engineering
- Applied Mathematics

### これを引用

*Electronics and Communications in Japan*,

*94*(8), 27-36. https://doi.org/10.1002/ecj.10345

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

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

*Electronics and Communications in Japan*, 巻. 94, 番号 8, pp. 27-36. https://doi.org/10.1002/ecj.10345

}

TY - JOUR

T1 - Map retrieval based on geometric spatial relations

AU - Shimizu, Toru

AU - Ikezaki, Masakazu

AU - Ushiama, Taketoshi

AU - Watanabe, Toyohide

PY - 2011/8/1

Y1 - 2011/8/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 similar locations by using a sketch as a query. In order to find 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 judge the occurrence of a similar structure, we define the similarity which is calculated by correspondence among relations. The correspondence among relations is a value which shows the difference between a query and data. By using this similarity, we can find not only subgraphs 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 similar locations by using a sketch as a query. In order to find 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 judge the occurrence of a similar structure, we define the similarity which is calculated by correspondence among relations. The correspondence among relations is a value which shows the difference between a query and data. By using this similarity, we can find not only subgraphs but also similarity graphs.

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

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

U2 - 10.1002/ecj.10345

DO - 10.1002/ecj.10345

M3 - Article

AN - SCOPUS:79960778934

VL - 94

SP - 27

EP - 36

JO - Electronics and Communications in Japan

JF - Electronics and Communications in Japan

SN - 1942-9533

IS - 8

ER -