Recognition of Roads and Districts from Maps


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 9, pp. 2289-2298, Sep. 1997
10.3745/KIPSTE.1997.4.9.2289,   PDF Download:

Abstract

This paper proposes a new method to recognize map. In order to minimize the ripple effect of one recognition result affecting another, the structural information is represented with a hierarchical model, and the model is used in both the recognition and verification process. Furthermore, lines related to an entity are searched in a reduced search space by defining some relations between lines. When there is a mis-recognition after verification, recognition process will be retried. In the process, the accurate result can obtained through the change of the parameter values used in the algorithm. As a result, the search space is reduced effectively, and even objects that embodies the broken lines and the crossed lines are recognized.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. K. Shik and K. J. Hie, "Recognition of Roads and Districts from Maps," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 9, pp. 2289-2298, 1997. DOI: 10.3745/KIPSTE.1997.4.9.2289.

[ACM Style]
Jang Kyung Shik and Kim Jai Hie. 1997. Recognition of Roads and Districts from Maps. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 9, (1997), 2289-2298. DOI: 10.3745/KIPSTE.1997.4.9.2289.