Automatic segmentation of mitochondria in EM data using pairwise affinity factorization and graph-based contour searching.

In this paper we investigate the segmentation of closed contours in sub-cellular data using a framework that primarily combines the pairwise affinity grouping principles with a graph partitioning contour searching approach. One salient problem that precluded the application of these methods to large scale segmentation problems is the onerous computational complexity required to generate comprehensive representations that include all pairwise relationships between all pixels in the input data. To compensate for this problem a practical solution is to reduce the complexity of the input data by applying an oversegmentation technique prior to the application of the computationally demanding strands of the segmentation process. This approach opens the opportunity to build specific shape and intensity models that can be successfully employed to extract the salient structures in the input image which are further processed to identify the cycles in an undirected graph. The proposed framework has been applied to the segmentation of mitochondria membranes in electron microscopy (EM) data which are characterized by low contrast and low signal to noise ratio. The algorithm has been quantitatively evaluated using two datasets where the segmentation results have been compared with the corresponding manual annotations. The performance of the proposed algorithm has been measured using standard metrics such as Precision and Recall and the experimental results indicate a high level of segmentation accuracy.