|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| 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. | |||
| BibTex | x | ||
| @article{ 10.1109/TPAMI.1981.4767106, author = {Angela Y. Wu and Tsvi Dubitzki and Azriel Rosenfeld}, title = {Parallel Computation of Contour Properties}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {3}, number = {3}, issn = {0162-8828}, year = {1981}, pages = {331-337}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.1981.4767106}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Pattern Analysis and Machine Intelligence TI - Parallel Computation of Contour Properties IS - 3 SN - 0162-8828 SP331 EP337 EPD - 331-337 A1 - Angela Y. Wu, A1 - Tsvi Dubitzki, A1 - Azriel Rosenfeld, PY - 1981 VL - 3 JA - IEEE Transactions on Pattern Analysis and Machine Intelligence ER - | |||
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.

