This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallel Region Property Computation by Active Quadtree Networks
June 1981 (vol. 3 no. 6)
pp. 626-633
ASCII Text
x 
 
Tsvi Dubitzki, Angela Y. Wu, Azriel Rosenfeld, "Parallel Region Property Computation by Active Quadtree Networks," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 3, no. 6, pp. 626-633, June, 1981.
 
 
BibTex
x
 
@article{ 10.1109/TPAMI.1981.4767163,
author = {Tsvi Dubitzki and Angela Y. Wu and Azriel Rosenfeld},
title = {Parallel Region Property Computation by Active Quadtree Networks},
journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence},
volume = {3},
number = {6},
issn = {0162-8828},
year = {1981},
pages = {626-633},
doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.1981.4767163},
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 Region Property Computation by Active Quadtree Networks
IS - 6
SN - 0162-8828
SP626
EP633
EPD - 626-633
A1 - Tsvi Dubitzki,
A1 - Angela Y. Wu,
A1 - Azriel Rosenfeld,
PY - 1981
VL - 3
JA - IEEE Transactions on Pattern Analysis and Machine Intelligence
ER -
 
Tsvi Dubitzki, Computer Vision Laboratory, Computer Science Center, University of Maryland, College Park, MD 20742; ELEX Control Systems, Israel.
Angela Y. Wu, Computer Vision Laboratory, Computer Science Center, University of Maryland, College Park, MD 20742; Department of Mathematics, Statistics, and Computer Science, American Universit
Azriel Rosenfeld, FELLOW, IEEE, Computer Vision Laboratory, Computer Science Center, University of Maryland, College Park, MD 20742.
Given a binary image stored in a cellular array, a local reconfiguration process can be used to reconnect some of the cells into a quadtree network representing the image. This quadtree can also be ``roped,'' i.e., nodes representing adjacent image blocks of the same size can be joined. Using the roped quadtree network as a parallel (cellular) computer, image properties such as perimeter and genus, as well as the quadtree distance transform, can be computed in O(tree height) = O(log image diameter) time. The area and centroid of the image can be computed in O(height) time without the need for roping.
Citation:
Tsvi Dubitzki, Angela Y. Wu, Azriel Rosenfeld, "Parallel Region Property Computation by Active Quadtree Networks," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 3, no. 6, pp. 626-633, June 1981, doi:10.1109/TPAMI.1981.4767163
Usage of this product signifies your acceptance of the Terms of Use.