This paper proposes a new method to efficiently label connected components in binary images. There exist many methods for this but they all are complex enough to prohibit implementation for simple realtime applications such as robotics. The proposed method is very simple in terms of implementation complexity and extremely fast, at the cost of a small fraction of accuracy. This approach is best ...

In this paper we consider the steiner multicut problem. This is a generalization of the minimum multicut problem where instead of separating node pairs, the goal is to find a minimum weight set of edges that separates all given sets of nodes. A set is considered separated if it is not contained in a single connected component. We show an O(log3(kt)) approximation algorithm for the steiner multi...

We present faster algorithms for computing the 2-edge and 2-vertex strongly connected components of a directed graph, which are straightforward generalizations of strongly connected components. While in undirected graphs the 2-edge and 2-vertex connected components can be found in linear time, in directed graphs only rather simple O(mn)-time algorithms were known. We use a hierarchical sparsifi...

The memory based processor array (MPA) was previously designed as an eeective memory{processor integrated architecture. The MPA can be easily attached into any host system via memory interface. In this paper, the impact of the memory interface structure is analytically analyzed for computer vision tasks. An analytical model is constructed to describe the characteristics of the memory interface ...

We consider strongly connected networks of input-to-state stable (ISS) systems. Provided a small gain condition holds it is shown how to construct an ISS Lyapunov function using ISS Lyapunov functions of the subsystems. The construction relies on two steps: The construction of a strictly increasing path in a region defined on the positive orthant in R by the gain matrix and the combination of t...

We discuss the homotopy type and the cohomology of spaces of locally convex parametrized curves γ : [0, 1] → S2, i.e., curves with positive geodesic curvature. The space of all such curves with γ(0) = γ(1) = e1 and γ′(0) = γ′(1) = e2 is known to have three connected components X−1,c, X1, X−1. We show several results concerning the homotopy type and cohomology of these spaces. In particular, X−1...

The localic definitions of cosheaves and connectedness are transferred from impredicative topos theory to predicative formal topology. A formal topology is locally connected (has base of connected opens) iff it has a cosheaf π0 together with certain additional structure and properties that constrain π0 to be the connected components cosheaf. In the inductively generated case, complete spreads (...

Polar decompositions X = U A of real and complex matrices X with respect to the scalar product generated by a given indefinite nonsingular matrix Hare studied in the following special cases: (1) X is an H-contraction, (2) X is an H-plus matrix, (3) H has only one positive eigenvalue, and (4) U belongs to the connected component of the identity in the group of H-unitary matrices. Applications to...

Highest degree nodes in Online Social Networks (OSNs) such as Twitter can be viewed as “social elites” or “connectivity hubs” as they are followed by many users and therefore can influence them. All these elites along with their pairwise connections form a structure that is known as the elite network. The elite network serves as the backbone of the OSN structure and thus its characteristics off...

In this paper, we propose a novel methodology for text detection in natural scene images. The proposed methodology is based on an efficient binarization and enhancement technique followed by a suitable connected component analysis procedure. Image binarization successfully processes natural scene images having shadows, non-uniform illumination, low contrast and large signaldependent noise. Conn...