This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallel Computation of Contour Properties
March 1981 (vol. 3 no. 3)
pp. 331-337
Angela Y. Wu, Computer Vision Laboratory, Computer Science Center, University of Maryland, College Park, MD 20742.
Tsvi Dubitzki, Computer Vision Laboratory, Computer Science Center, University of Maryland, College Park, MD 20742.
Azriel Rosenfeld, Computer Vision Laboratory, Computer Science Center, University of Maryland, College Park, MD 20742.
Some contour properties can be derived in parallel by a string or cycle of automata in linear time, faster than can be done with a single processor. In particular, the intersection points of two contours, the straightness of a line, the union or intersection of two contours, and polygonal approximations of a contour are computed in linear time.
Citation:
Angela Y. Wu, Tsvi Dubitzki, Azriel Rosenfeld, "Parallel Computation of Contour Properties," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 3, no. 3, pp. 331-337, March 1981, doi:10.1109/TPAMI.1981.4767106
Usage of this product signifies your acceptance of the Terms of Use.