Abstract
There are numerous cadastral maps generated by past land surveying. For effective and efficient use of these maps, we have to assemble the set of maps to make them superimposable on other geographic information in a Geographic Information System. We present an automatic solution based on the generalized Hough transformation that detects the common longest boundary between every piece and its neighbors. And we present a high-speed technique for the cadastral map assembling by the segment reduction. The results of the experiment with the French cadastral maps show that the proposed method is suitable for assembling the cadastral map.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of IAPR Conference on Machine Vision Applications, MVA 2007 |
| Pages | 571-574 |
| Number of pages | 4 |
| Publication status | Published - Dec 1 2007 |
| Externally published | Yes |
| Event | 10th IAPR Conference on Machine Vision Applications, MVA 2007 - Tokyo, Japan Duration: May 16 2007 → May 18 2007 |
Other
| Other | 10th IAPR Conference on Machine Vision Applications, MVA 2007 |
|---|---|
| Country | Japan |
| City | Tokyo |
| Period | 5/16/07 → 5/18/07 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Vision and Pattern Recognition
Cite this
Improvement of cadastral map assembling based on GHT. / Liu, Fei; Oyama, Wataru; Wakabayashi, Tetsushi; Kimura, Fumitaka.
Proceedings of IAPR Conference on Machine Vision Applications, MVA 2007. 2007. p. 571-574.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Improvement of cadastral map assembling based on GHT
AU - Liu, Fei
AU - Oyama, Wataru
AU - Wakabayashi, Tetsushi
AU - Kimura, Fumitaka
PY - 2007/12/1
Y1 - 2007/12/1
N2 - There are numerous cadastral maps generated by past land surveying. For effective and efficient use of these maps, we have to assemble the set of maps to make them superimposable on other geographic information in a Geographic Information System. We present an automatic solution based on the generalized Hough transformation that detects the common longest boundary between every piece and its neighbors. And we present a high-speed technique for the cadastral map assembling by the segment reduction. The results of the experiment with the French cadastral maps show that the proposed method is suitable for assembling the cadastral map.
AB - There are numerous cadastral maps generated by past land surveying. For effective and efficient use of these maps, we have to assemble the set of maps to make them superimposable on other geographic information in a Geographic Information System. We present an automatic solution based on the generalized Hough transformation that detects the common longest boundary between every piece and its neighbors. And we present a high-speed technique for the cadastral map assembling by the segment reduction. The results of the experiment with the French cadastral maps show that the proposed method is suitable for assembling the cadastral map.
UR - http://www.scopus.com/inward/record.url?scp=84872538517&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84872538517&partnerID=8YFLogxK
M3 - Conference contribution
SN - 9784901122078
SP - 571
EP - 574
BT - Proceedings of IAPR Conference on Machine Vision Applications, MVA 2007
ER -