
Proceedings Paper
An algorithm for matching multiscale linear objects based on Hausdorff distanceFormat | Member Price | Non-Member Price |
---|---|---|
$17.00 | $21.00 |
Paper Abstract
In order to reveal and implement the corresponding association about the same geographical feature at different
resolutions and to build the multi-scale spatial database and maintain the consistency between different scale map
databases, an algorithm for matching multi-scale linear objects based on Hausdorff Distance as a matching measure is
proposed combined with the semantic information. Further more, the concept of matching uncertainty is defined as to
evaluate the matching result. The experiment and the estimate result show that according to the characteristics of road
networks changing with scales, this approach can recognize the entity or a set of entities which represent the same object
at different scales so as to build the relationships of corresponding objects.
Paper Details
Date Published: 1 August 2007
PDF: 13 pages
Proc. SPIE 6751, Geoinformatics 2007: Cartographic Theory and Models, 67510D (1 August 2007); doi: 10.1117/12.759492
Published in SPIE Proceedings Vol. 6751:
Geoinformatics 2007: Cartographic Theory and Models
Manchun Li; Jiechen Wang, Editor(s)
PDF: 13 pages
Proc. SPIE 6751, Geoinformatics 2007: Cartographic Theory and Models, 67510D (1 August 2007); doi: 10.1117/12.759492
Show Author Affiliations
Liping Zhang, Wuhan Univ. (China)
Qingsheng Guo, Wuhan Univ. (China)
Qingsheng Guo, Wuhan Univ. (China)
Yan Sun, The Chinese People's Liberation Army (China)
Published in SPIE Proceedings Vol. 6751:
Geoinformatics 2007: Cartographic Theory and Models
Manchun Li; Jiechen Wang, Editor(s)
© SPIE. Terms of Use
