Learn More
In this paper we present a new implementation of a rain-falling watershed segmentation algorithm. Our previous algorithm was a one-run algorithm. All the steps needed to compute a complete watershed segmentation were done in one run over the input data. In our new algorithm we tried another approach. We separated the watershed algorithm in several(More)
In this paper we present a novel approach to the jigsaw puzzle solving problem. The main components are a shape based local contour matching followed by a global solving procedure that constructs the topological solution of the jigsaw puzzle. The shape based local contour matching is discussed briefly, but the main focus of the paper is the construction of(More)
Extraction of structural and geometric information from 3-D images of blood vessels is a well known and widely addressed segmentation problem. The segmentation of cerebral blood vessels is of great importance in diagnostic and clinical applications, with a special application in diagnostics and surgery on arteriovenous malformations (AVM). However, the(More)
In this paper we present a more efficient approach to the problem of finding the connected components in binary images. In conventional connected components algorithms, the main data structure to compute and store the connected components is the region label image. We replace the region label image with a singly-linked list of line segments (or runs) for(More)
  • 1