After applying preprocessing techniques (median filtering and binarization), the initial blocks are identified using the connected component analysis (CCA) method.
Through using the connected component labeling algorithm [18] the first order ring from the binary image can be extracted, which is shown in Fig. 2(c).
In reality, we do not know the multi-sets C= G u); however, we can use the connected components of the Hamming graph to approximate the multi-sets C. We now present the steps of the algorithm.
Hence, we used the connected-component-labeling approach with the minimum bounding rectangle to orientate the real foreground objects.
To find the disjoint sets of intersecting trapezoids, we use a method similar to that used for finding the connected components of an undirected graph [ 31].
Image stacks were imported to Amira software (Visage Imaging, San Diego, CA), which produced three-dimensional (3D) renderings of each confocal z-stack using the 'connected components' feature.
The two-scan algorithm is a method used for labeling the connected components in a binary image.
Trivial opening is defined by Jean et al. [33], and it is used to extract the connected components based on some criteria.
Simulated annealing is used to find the connected components of the network with the highest scores (calculated as the sum of the scores of all members of the connected component v.
