In this work, we propose a new segmentation algorithm for images containing convex objects present in multiple shapes with a high degree of overlap. The proposed algorithm is carried out in two steps, first we identify the visible contours, segment them using concave points and finally group the segments belonging to the same object. The next step is to assign a shape identity to these grouped contour segments. For images containing objects in multiple shapes we begin first by identifying shape classes of the contours followed by assigning a shape entity to these classes. We provide a comprehensive experimentation of our algorithm on two crystal image datasets. One dataset comprises of images containing objects in multiple shapes overlapping each other and the other dataset contains standard images with objects present in a single shape. We test our algorithm against two baselines, with our proposed algorithm outperforming both the baselines.
Certain approaches use dynamic programming for the task @cite_17 , they determine the most optimal boundaries for the hidden objects by defining a path of the highest average intensity along boundaries. Graph-cut methods segment objects by creating a graph out of pixels treated as nodes and difference between their intensities as a weight for edges, followed by finding the minimum cut for the graph @cite_12 @cite_10 . Both of these approaches require prominent gradients at boundaries to be effective in segmenting objects.
@cite_10 @cite_12 @cite_17
2121947440 1968056609
We propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the image data, our approach aims at extracting the global impression of an image. We treat image segmentation as a graph partitioning problem and propose a novel global criterion, the normalized cut, for segmenting the graph. The normalized cut criterion measures both the total dissimilarity between the different groups as well as the total similarity within the groups. We show that an efficient computational technique based on a generalized eigenvalue problem can be used to optimize this criterion. We applied this approach to segmenting static images, as well as motion sequences, and found the results to be very encouraging. Background Understanding the cellular and molecular basis of tissue development and function requires analysis of individual cells while in their tissue context. Methods We developed software to find the optimum border around each cell (segmentation) from two-dimensional microscopic images of intact tissue. Samples were labeled with a fluorescent cell surface marker so that cell borders were brighter than elsewhere. The optimum border around each cell was defined as the border with an average intensity per unit length greater that any other possible border around that cell, and was calculated using the gray-weighted distance transform. Algorithm initiation requiring the user to mark two points per cell, one approximately in the center and the other on the border, ensured virtually 100 correct segmentation. Thereafter segmentation was automatic. Results The method was highly robust, because intermittent labeling of the cell borders, diffuse borders, and spurious signals away from the border do not significantly affect the optimum path. Computer-generated cells with increasing levels of added noise showed that the approach was accurate provided the cell could be detected visually. Conclusions We have developed a highly robust algorithm for segmenting images of surface-labeled cells, enabling accurate and quantitative analysis of individual cells in tissue. © 2005 International Society for Analytical Cytology