Higgs bundles and non-abelian Hodge theory provide holomorphic methods with which to study the moduli spaces of surface group representations in a reductive Lie group G. In this paper we survey the case in which G is the isometry group of a classical Hermitian symmetric space of non-compact type. Using Morse theory on the moduli spaces of Higgs bundles, we compute the number of connected compon...

This paper proposes a new parallel approach to solve connected components on a 2D binary image implemented with CUDA. We employ the following strategies to accelerate neighborhood exploration after dividing an input image into independent blocks. In the local labeling stage, a coarse-labeling algorithm, including row-column connection and label-equivalence list unification, is applied first to ...

In this article we will present a graph partitioning algorithm which partitions a graph into two different types of components: the well-known ‘strongly connected components’ as well as another type of components we call ‘connected acyclic component’. We will give an algorithm based on Tarjan’s algorithm for finding strongly connected components used to find such a partitioning. We will also sh...

In this paper an intelligent and efficient combination of several methods are employed for face and facial feature tracking with the motivation for real time applications. Face tracking algorithm is based on color and connected component analysis. It is scale, pose and orientation invariant, and can be implemented in real time in controlled environments. The more challenging problem of facial f...

The performance of parallelized connected component labeling can be improved in two ways: faster local labeling and faster interprocessor communication. Suzuki et al. describe one method of improving the speed of the local labeling procedure through the use of another table that remembered component labels. In speeding up global information dissemination, one may either allow each component to ...

This report presents the work carried out for the flow chart recognition task in the course of the CLEF-IP 2012 competition. The goal is to obtain structural information of flow charts based on the visual content of the images. To this end, for each flow chart a list of its nodes and their interconnections, i.e. its edges, is extracted and the type of the nodes and edges and attached text is re...

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...

Image warping is a common problem when one scans or photocopies a document page from a thick bound volume, resulting in shading and curved text lines in the spine area of the bound volume. This will not only impair readability, but will also reduce the OCR accuracy. Further to our earlier attempt to correct such images, this paper proposes a simpler connected component analysis and regression t...

In this paper we investigate the organizational structure of the transcriptional regulatory network of S. cerevisiae with respect to the connectivity structure of periodic genes. We demonstrate that the giant strongly connected component plays a prominent role serving as central connector for genes experimentally found to be periodically expressed during the cell cycle of yeast. Numerically, we...