Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA 19104, USA.
Med Image Anal. 2011 Oct;15(5):690-707. doi: 10.1016/j.media.2011.06.009. Epub 2011 Jul 7.
In medical research, many applications require counting and measuring small regions in a large image. Extracting these regions poses a dilemma in terms of segmentation granularity due to fine structures and segmentation complexity due to large image sizes. We propose a constrained spectral graph partitioning framework to address the former while also reducing the segmentation complexity associated with the latter. The final segmentation is obtained from a set of patch segmentations, each independently derived subject to stitching constraints between neighboring patches. Individual segmentation is based on local pairwise cues designed to pop out all cells simultaneously from their common background, while the constraints are derived from mutual agreement analysis on patch segmentations from a previous round of segmentation. Our results demonstrate that the constrained segmentation not only stitches solutions seamlessly along overlapping patch borders but also refines the segmentation in the patch interiors.
在医学研究中,许多应用都需要在大型图像中计数和测量小区域。由于精细结构,提取这些区域会在分割粒度方面带来困境,而由于图像尺寸较大,又会在分割复杂性方面带来困境。我们提出了一个受约束的谱图划分框架来解决前者问题,同时也降低了与后者相关的分割复杂性。最终的分割是从一组补丁分割中得到的,每个补丁分割都是独立推导出来的,需要满足相邻补丁之间的拼接约束。每个分割都是基于局部成对线索的,这些线索旨在同时从它们的共同背景中弹出所有的细胞,而约束则是从上一轮分割中来自补丁分割的相互一致分析中得出的。我们的结果表明,受约束的分割不仅可以在重叠的补丁边界处无缝拼接解决方案,还可以在补丁内部细化分割。