In this article, we introduce a parallel algorithm for connected-component analysis (CCA) on GPUs which drastically reduces the volume of data to transfer from GPU host. CCA algorithms targeting typically store extracted features in arrays large enough potentially hold maximum possible number objects given image size. Transferring these host requires portions overall execution time. Therefore, ...

This paper presents head and hand gestures recognition system for Human Computer Interaction (HCI). Head and Hand gestures are an important modality for human computer interaction. Vision based recognition system can give computers the capability of understanding and responding to the hand and head gestures. The aim of this paper is the proposal of real time vision system for its application wi...

A subset S of the vertices of a graph G is an outer-connected dominating set, if S is a dominating set of G and G − S is connected. The outer-connected domination number of G, denoted by γ̃c(G), is the minimum cardinality of an OCDS of G. In this paper we generalize the outer-connected domination in graphs. Many of the known results and bounds of outer-connected domination number are immediate c...

In this paper we present an overview of the historical evolution of connected component labeling algorithms, and in particular the ones applied on images stored in raster scan order. This brief survey aims at providing a comprehensive comparison of their performance on modern architectures, since the high availability of memory and the presence of caches make some solutions more suitable and fa...

Text detection and recognition is a hot topic for researchers in the field of image processing. It gives attention to Content based Image Retrieval (CBIR) community in order to fill the semantic gap between low level and high level features. Several methods have been developed for text detection and extraction that achieve reasonable accuracy for natural scene text (camera images) as well as mu...

The SKIPSM (Separated-Kernel Image Processing using finite-State Machines) paradigm offers fast execution of a very wide range of binary, grey-scale, 3-D, and color image-processing applications. In this paper the finite-state-machine approach is applied to one of the “classical” problems of binary image processing: connected-component analysis (“blob” analysis”). Execution-time results are pre...

This article introduces two fast algorithms for Connected Component Labeling of binary images, a peculiar case of coloring. The first one, SelkowDT is pixel-based and a Selkow’s algorithm combined with the Decision Tree optimization technique. The second one called Light Speed Labeling is segment-based line-relative labeling and was especially thought for commodity RISC architectures. An extens...