Results 251 to 260 of about 2,522,495 (283)
Some of the next articles are maybe not open access.
Analysis of Connected Components
2000After binarisation of the grey level image and before the construction of a vector description, object (black) regions of the binary image must somehow be reduced to unit-width pixel strings. As illustrated in Chapter 2, vector representations may describe either the centre lines of object regions or their boundaries.
Sergey Ablameyko, Tony Pridmore
openaire +1 more source
2016
This chapter presents different ways of handling the first challenge of summarizing spatial network data, i.e., the large number of k-subsets of connected components in the network. This challenge is conceptualized as the spatial network activity summarization problem (SNAS) where given a spatial network, a collection of activities and their locations (
openaire +1 more source
This chapter presents different ways of handling the first challenge of summarizing spatial network data, i.e., the large number of k-subsets of connected components in the network. This challenge is conceptualized as the spatial network activity summarization problem (SNAS) where given a spatial network, a collection of activities and their locations (
openaire +1 more source
Fast block based connected components labeling
2009 16th IEEE International Conference on Image Processing (ICIP), 2009In this paper we present a new optimization technique for the neighborhood computation in connected component labeling focused on images stored in raster scan order. This new technique is based on a 2×2 square block analysis of the image, and it exploits the fact that, when using 8-connection, the pixels of a 2×2 square are all connected to each other.
GRANA, Costantino +2 more
openaire +2 more sources
Twinless Strongly Connected Components
2006Tarjan [9] describes how depth first search can be used to identify Strongly Connected Components (SCC) of a directed graph in linear time. It is standard to study Tarjan’s SCC algorithm in most senior undergraduate or introductory graduate computer science algorithms courses.
openaire +1 more source
On Connected Components of Shimura Varieties
Canadian Journal of Mathematics, 2002AbstractWe study the cohomology of connected components of Shimura varieties coming from the group GSp2g, by an approach modeled on the stabilization of the twisted trace formula, due to Kottwitz and Shelstad. More precisely, for each character ϖ on the group of connected components of we define an operator L(ω) on the cohomology groups with compact ...
openaire +1 more source
Connected Components and Dimension
2019We shall shortly show that a non-empty compact Hausdorff space X is zero-dimensional iff X is totally disconnected. Recall that \( \mathop {\mathrm {comp}} \nolimits (x)\), the (connected) component of a point x ∈ X, is the union of all connected subspaces of X that contain x. The intersection of all clopen sets of X that contain x, denoted here by \( \
openaire +1 more source
Building and Connecting Components
2001While equations are an essential part of model development, it quickly becomes tedious to write out all the equations for the components in a system. In this chapter, we show how to reuse constitutive equations like Ohm’s law and automatically generate conservation equations for quantities like energy and mass.
openaire +1 more source
Irreducible and Connected Components
1979Decomposing a space into its connected components is a familiar topological idea which is immediately applicable to closed sets in k n and which we will proceed to generalize to group schemes. But the algebraic nature of our closed sets makes it easier to approach connectedness via a stronger concept, irreducibility.
openaire +1 more source
Distributed Connected Component Filtering and Analysis in 2D and 3D Tera-Scale Data Sets
IEEE Transactions on Image Processing, 2021Simon Gazagnes, Michael H F Wilkinson
exaly