By Topic

An Optimal Line Following Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Mero, Laszlo ; Computer and Automation Institute, Hungarian Academy of Sciences, Budapest, Hungary.

An algorithm is described for optimal following of the lines in digitized TV pictures. Initially, the picture is subjected to an edge detection operation resulting in short edge-line pieces (strokes). The bifurcation points of the lines in the picture are detected on the basis of variances in stroke angles. A mathematical model using graph theoretical concepts is set up on the arrays of strokes (streaks) to be found among the bifurcation points. The model assumes that the streaks will follow the lines of the picture in an optimal way. An algorithm is given which finds the streaks. The correctness of the algorithm is proved in a pure mathematical way. Experiments with on-line TV pictures show the performance of the algorithm.

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:PAMI-3 ,  Issue: 5 )