Title page for ETD etd-11292012-040027
|Type of Document
||Hess, Elizabeth Beien
||A pseudo maximal square moving line tracking algorithm
||Master of Science
||Computer Science and Applications
|Bixler, J. Patrick
|Shaffer, Clifford A.
|Watson, Layne T.
|Date of Defense
A new method for extracting lines from discrete binary images is
proposed. The algorithm is capable of extracing 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 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.
|| Approximate Download Time
| 28.8 Modem
|| 56K Modem
|| ISDN (64 Kb)
|| ISDN (128 Kb)
|| Higher-speed Access
next to an author's name indicates that all
files or directories associated with their ETD
are accessible from the Virginia Tech campus network only.
If you have questions or technical
problems, please Contact DLA.