Unnikrishnan, A. ; Venkatesh, Y. V. ; Shankar, P. (1987) Connected component labelling using quadtrees - a bottom-up approach The Computer Journal, 30 (2). pp. 176-182. ISSN 0010-4620
Full text not available from this repository.
Official URL: http://comjnl.oxfordjournals.org/content/30/2/176....
Related URL: http://dx.doi.org/10.1093/comjnl/30.2.176
Abstract
An algorithm to label the connected components of a binary picture is presented using a hierarchical version of the linear quadtree. This algorithm, which starts from the lowest level of the hierarchy, is shown to be computationally faster than the one using the topmost level as the starting point. The computational complexity of the algorithm appears comparable to that of existing methods due to Gargantini and Samet.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Oxford University Press. |
| ID Code: | 57149 |
| Deposited On: | 26 Aug 2011 02:34 |
| Last Modified: | 26 Aug 2011 02:34 |
Repository Staff Only: item control page
