This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Optimal Line Following Algorithm
May 1981 (vol. 3 no. 5)
pp. 593-598
Laszlo Mero, 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.
Citation:
Laszlo Mero, "An Optimal Line Following Algorithm," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 3, no. 5, pp. 593-598, May 1981, doi:10.1109/TPAMI.1981.4767151
Usage of this product signifies your acceptance of the Terms of Use.