A new method for extracting lines from discrete binary images is proposed. The algorithm is capable of extracting individual lines and producing a structure-descriptive representation for every line extracted. The algorithm could be considered as an extension of Wakayama's Maximal Square Moving (MSM) algorithm[37] since pseudo maximal squares are substituted for maximal squares, but essentially, it is distinct from the MSM algorithm because squares are derived only in the most desirable direction while tracking a line. The resulting representation of a line is a set of points that are the centers of the pseudo maximal squares along the tracked line. This information is highly conducive to creating a high-level mathematical representation of the line being tracked. Examples are given for regions of a complex map. / Master of Science
| Identifer | oai:union.ndltd.org:VTETD/oai:vtechworks.lib.vt.edu:10919/46037 |
| Date | 29 November 2012 |
| Creators | Hess, Elizabeth Beien |
| Contributors | Computer Science and Applications, Bixler, J. Patrick, Watson, Layne T., Shaffer, Clifford A. |
| Publisher | Virginia Tech |
| Source Sets | Virginia Tech Theses and Dissertation |
| Language | English |
| Detected Language | English |
| Type | Thesis, Text |
| Format | x, 116 leaves, BTD, application/pdf, application/pdf |
| Rights | In Copyright, http://rightsstatements.org/vocab/InC/1.0/ |
| Relation | OCLC# 21766987, LD5655.V855_1989.H478.pdf |
Page generated in 0.0021 seconds