Segmentation subject to stitching constraints: Finding many small structures in a large image

2Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.

Abstract

Extracting numerous cells in a large microscopic image is often required in medical research. The challenge is to reduce the segmentation complexity on a large image without losing the fine segmentation granularity of small structures. We propose a constrained spectral graph partitioning approach where the segmentation of the entire image is obtained from a set of patch segmentations, independently derived but subject to stitching constraints between neighboring patches. The constraints come from mutual agreement analysis on patch segmentations from a previous round. Our experimental results demonstrate that the constrained segmentation not only stitches solutions seamlessly along overlapping patch borders but also refines the segmentation in the patch interiors. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Bernardis, E., & Yu, S. X. (2010). Segmentation subject to stitching constraints: Finding many small structures in a large image. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6361 LNCS, pp. 119–126). https://doi.org/10.1007/978-3-642-15705-9_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free