A linear-time component-labeling algorithm using contour tracing technique
نویسندگان
چکیده
منابع مشابه
A linear-time component-labeling algorithm using contour tracing technique
A new linear-time algorithm is presented in this paper that simultaneously labels connected components (to be referred to merely as components in this paper) and their contours in binary images. The main step of this algorithm is to use a contour tracing technique to detect the external contour and possible internal contours of each component, and also to identify and label the interior area of...
متن کاملA Component-Labeling Algorithm Using Contour Tracing Technique
A new method for finding connected components from binary images is presented in this article. The main step of this method is to use a contour tracing technique to detect component contours and also to fill in interior areas. All the component points are traced by this algorithm in a single pass and are assigned either a new label or the same label as their neighboring pixels. Experimenting on...
متن کامل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.
متن کاملSurface Pressure Contour Prediction Using a GRNN Algorithm
A new approach based on a Generalized Regression Neural Network (GRNN) has been proposed to predict the planform surface pressure field on a wing-tail combination in low subsonic flow. Extensive wind tunnel results were used for training the network and verification of the values predicted by this approach. GRNN has been trained by the aforementioned experimental data and subsequently was used ...
متن کاملFast connected component labeling algorithm using a divide and conquer technique
We investigate a method to speed up the O(n) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm searches line-by-line, top to bottom, to assign a blob label to each current pixel that is connected to a blob. A large number K of labels arises of which many are equivalent, so the equivalence must be resolved. This requ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Vision and Image Understanding
سال: 2004
ISSN: 1077-3142
DOI: 10.1016/j.cviu.2003.09.002