Figures play an important role within biomedical publications. A typical and essential first step toward using images is the detection of compound figures and their separation into panels. In ImageCLEF’16 our team has participated in the compound figure detection and separation tasks, where we utilized a method based on connected component analysis (CCA) to detect and to separate compound figur...

Let (X,R) be a commutative association scheme and let Γ = (X,R ∪R>) be a connected undirected graph where R ∈ R. Godsil (resp., Brouwer) conjectured that the edge connectivity (resp., vertex connectivity) of Γ is equal to its valency. In this paper, we prove that the deletion of the neighborhood of any vertex leaves behind at most one non-singleton component. Two distinct vertices a, b ∈ X are ...

This paper presents a new technique that greatly increases the speed of the connected component labeling algorithm. We propose a system to extract the text from the PDF images. This paper describes the system design based on text extraction method concentrating on text extraction from PDF images by enhancing the traditional connected component labeling as modified connected component labeling t...

A connected graph is said to be super edge-connected if every minimum edge-cut isolates a vertex. The restricted edge-connectivity λ′ of a connected graph is the minimum number of edges whose deletion results in a disconnected graph such that each connected component has at least two vertices. A graph G is called λ′-optimal if λ′(G) = min{dG(u)+dG(v)−2 : uv is an edge in G}. This paper proves t...

We consider the following problem: given a k-(node) connected graph G find a smallest set F of new edges so that the graph G + F is (k + 1)-connected. The complexity status of this problem is an open question. The problem admits a 2approximation algorithm. Another algorithm due to Jordán computes an augmenting edge set with at most d(k− 1)/2e edges over the optimum. C ⊂ V (G) is a k-separator (...

This paper presents a runand label-equivalence-based one-and-a-half-scan algorithm for labeling connected components in a binary image. Major di®erences between our algorithm and conventional label-equivalence-based algorithms are: (1) all conventional label-equivalencebased algorithms scan all pixels in the given image at least twice, whereas our algorithm scans background pixels once and obje...

The generalized k-connectivity κk(G) of a graphG, which was introduced by Chartrand et al.(1984) is a generalization of the concept of vertex connectivity. Let G and H be nontrivial connected graphs. Recently, Li et al. gave a lower bound for the generalized 3-connectivity of the Cartesian product graph G H and proposed a conjecture for the case that H is 3-connected. In this paper, we give two...

Connected component labeling is an important but computationally expensive operation required in many fields of research. The goal in the present work is to label connected components on a 2D binary map. Two different iterative algorithms for doing this task are presented. The first algorithm (Row–Col Unify) is based upon the directional propagation labeling, whereas the second algorithm uses t...

Article history: Received 17 January 2008 Available online 21 March 2012

In this paper, we propose a model of the web of data as a graph of interlinked graphs which goes beyond the standard single-graph RDF semantics, describe two different ways in which a query on this structure can be answered, and characterize semantically each of these ways in terms of restrictions on the relation between the domain of interpretation of each single component graph.