Abstract We develop and analyze a new algorithm to find the connected components of a compact set I from a Lie group G endowed with a left-invariant Riemannian distance. For a given >0 δ > 0, the algorithm finds the largest cover of I such that all sets in the cover are separated by at least distance δ. We call the sets in the cover the δ -connected components of I (closely related to C C ˇ ech complexes of radius /2 δ / 2). The grouping relies on an iterative procedure involving morphological dilations with Hamilton-Jacobi-Bellman kernels on G and notions of δ -thickened sets. We prove that the algorithm converges in finitely many iteration steps. We find the optimal value for δ using persistence diagrams. We also propose to use specific affinity matrices. This allows for grouping of δ -connected components based on their local proximity and alignment. Among the many different applications of the algorithm, in this article, we focus on illustrating that the method can efficiently identify (possibly overlapping) branches in complex vascular trees on retinal images. This is done by applying an orientation score transform to the images that allows us to view them as functions from L₂ (G) L 2 (G) where G=SE (2) G = S E (2), the Lie group of roto-translations. By applying our algorithm in this Lie group, we illustrate that we obtain δ -connected components that differentiate between crossing structures and that group well-aligned, nearby structures. This contrasts standard connected component algorithms in R² R 2.
Berg et al. (Thu,) studied this question.