Parallel connected-Component-Labeling based on homotopy trees
نویسندگان
چکیده
منابع مشابه
Block-Based Connected-Component Labeling Algorithm Using Binary Decision Trees
In this paper, we propose a fast labeling algorithm based on block-based concepts. Because the number of memory access points directly affects the time consumption of the labeling algorithms, the aim of the proposed algorithm is to minimize neighborhood operations. Our algorithm utilizes a block-based view and correlates a raster scan to select the necessary pixels generated by a block-based sc...
متن کاملFast connected-component labeling
Article history: Received 27 March 2008 Received in revised form 2 September 2008 Accepted 20 October 2008
متن کاملA Hybrid Approach to Parallel Connected Component Labeling Using CUDA
Connected component labeling (CCL) is a mandatory step in image segmentation where each object in an image is identified and uniquely labeled. Sequential CCL is a time-consuming operation and thus is often implemented within parallel processing framework to reduce execution time. Several parallel CCL methods have been proposed in the literature. Among them are NSZ label equivalence (NSZLE) meth...
متن کاملFast Parallel Connected Component Labeling Algorithms Using Cuda Based on 8-directional Label Selection
Connected component labeling (CCL) is a key step in image segmentation where foreground pixels are extracted and labeled. Sequential CCL is a computationally expensive operation and thus is often done within parallel processing framework to reduce execution time. Various parallel CCL methods have been proposed in the literature. Among them NSZ label equivalence (NSZ-LE) method seemed to perform...
متن کاملLinear-time connected-component labeling based on sequential local operations
This paper presents a fast algorithm for labeling connected components in binary images based on sequential local operations. A one-dimensional table, which memorizes label equivalences, is used for uniting equivalent labels successively during the operations in forward and backward raster directions. The proposed algorithm has a desirable characteristic: the execution time is directly proporti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition Letters
سال: 2020
ISSN: 0167-8655
DOI: 10.1016/j.patrec.2019.11.039