Connected Component Labeling Using Modified Linear Quadtrees
نویسنده
چکیده
Using the modified linear quadtree proposed in [1,9], this paper presents an O(n·N) algorithm for labeling connected components of a region consisting of N BLACK nodes in a 2n by 2n binary image. As a direct application of the algorithm, a method for computing the perimeter of a region is also described.
منابع مشابه
A strategy for repetitive neighbor finding in images represented by quadtrees
The paper presents an effective strategy for repetitive neighbor finding in binary images which is proper for mobile robot path planning, connected component labeling, etc. It is based on a new neighbor finding method which is universal and generates all the possible and arbitrary sized neighbors (larger, smaller, equal) for any quadtree node using simple algebraic operations. © 1997 Elsevier S...
متن کاملThreaded Linear Hierarchical Quadtree for Computation of Geometric Properties of Binary Images
A modification of the linear quadtree [3], the threaded linear hierarchical quadtree (TLHQT), is proposed for the computation of geometric properties of binary images. Since most of the algorithms used in connection with computation of geometric properties require frequent exploration of adjacencies, a structure which keeps permanently in memory some adjacency links is introduced. In this paper...
متن کاملText Extraction from Pdf Image Using Enhanced Connected Component Labeling
This paper presents a new technique that greatly increases the speed of the connected component labeling algorithm. We propose a system to extract the text from the PDF images. This paper describes the system design based on text extraction method concentrating on text extraction from PDF images by enhancing the traditional connected component labeling as modified connected component labeling t...
متن کاملEfficient Component Labeling of Images of Arbitrary Dimension Represented by Linear Bintrees
An algorithm is presented to perform connected component labeling of images of arbitrary dimension that are represented by a linear bintree. The bintree is a generalization of the quadtree data structure that enables dealing with images of arbitrary dimension. The linear bintree is a pointerless representation. The algorithm uses an active border which is represented by linked lists instead of ...
متن کاملTraversing the Triangle Elements of an Icosahedral Spherical Representation in Constant-Time
Techniques are presented for moving between adjacent triangles of equal size in a hierarchical representation for spherical data that is projected onto the faces of an icosahedron. The faces of the icosahedron are represented by a triangular quadtree. The operations are analogous to those used for a quadtree representation of data on the two-dimensional plane where the underlying space is tesse...
متن کامل