A pseudo maximal square moving line tracking algorithm

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.

Name thesis:degree_name

Master of Science

Level thesis:degree_level

masters

Discipline thesis:degree_discipline

Computer Science and Applications

Department dc:contributor.department

Computer Science and Applications

Grantor dc:publisher

Virginia Tech

Year dc:date.issued

1989

Author dc:creator

• Hess, Elizabeth Beien

Chair dc:contributor.committeechair

• Bixler, J. Patrick

Committee members dc:contributor.committeemember

• Watson, Layne T.
• Shaffer, Clifford A.

Statement dc:rights

• In Copyright

Licence dc:rights.uri

• http://rightsstatements.org/vocab/InC/1.0/

Language dc:language.iso

en

Dc Identifier Other

etd-11292012-040027

OAI identifier oai:identifier

oai:vtechworks.lib.vt.edu:10919/46037