Suppr超能文献

在图像堆栈中识别同细胞轮廓:制作 3D 重建的关键步骤。

Identifying same-cell contours in image stacks: a key step in making 3D reconstructions.

机构信息

Department of Civil and Environmental Engineering, University of Waterloo, Waterloo, Ontario, Canada.

出版信息

Ann Biomed Eng. 2011 Feb;39(2):698-705. doi: 10.1007/s10439-010-0198-9. Epub 2010 Nov 20.

Abstract

Identification of contours belonging to the same cell is a crucial step in the analysis of confocal stacks and other image sets in which cell outlines are visible, and it is central to the making of 3D cell reconstructions. When the cells are close packed, the contour grouping problem is more complex than that found in medical imaging, for example, because there are multiple regions of interest, the regions are not separable from each other by an identifiable background and regions cannot be distinguished by intensity differences. Here, we present an algorithm that uses three primary metrics-overlap of contour areas in adjacent images, co-linearity of the centroids of these areas across three images in a stack, and cell taper-to assign cells to groups. Decreasing thresholds are used to successively assign contours whose membership is less obvious. In a final step, remaining contours are assigned to existing groups by setting all thresholds to zero and groups having strong hour-glass shapes are partitioned. When applied to synthetic data from isotropic model aggregates, a curved model epithelium in which the long axes of the cells lie at all possible angles to the transection plane, and a confocal image stack, algorithm assignments were between 97 and 100% accurate in sets having at least four contours per cell. The algorithm is not particularly sensitive to the thresholds used, and a single set of parameters was used for all of the tests. The algorithm, which could be extended to time-lapse data, solves a key problem in the translation of image data into cell information.

摘要

鉴定属于同一细胞的轮廓是分析共聚焦堆栈和其他可见细胞轮廓的图像集的关键步骤,也是制作 3D 细胞重建的核心。当细胞紧密堆积时,轮廓分组问题比医学成像中的问题更为复杂,因为存在多个感兴趣区域,这些区域彼此之间没有可识别的背景,也不能通过强度差异来区分。在这里,我们提出了一种算法,该算法使用三个主要指标——相邻图像中轮廓区域的重叠、堆栈中三幅图像中这些区域质心的共线性以及细胞锥度——来分配细胞到组。使用递减的阈值来成功地分配那些归属不太明显的轮廓。在最后一步中,通过将所有阈值设置为零并将具有强烈沙漏形状的组进行分区,将剩余的轮廓分配给现有组。当应用于各向同性模型聚集体的合成数据、细胞长轴处于与横切面所有可能角度的弯曲模型上皮以及共聚焦图像堆栈时,算法分配在至少每细胞四个轮廓的组中具有 97%至 100%的准确性。该算法对使用的阈值不特别敏感,并且所有测试都使用了一组参数。该算法可以扩展到时间推移数据,解决了将图像数据转换为细胞信息的关键问题。

文献AI研究员

20分钟写一篇综述,助力文献阅读效率提升50倍。

立即体验

用中文搜PubMed

大模型驱动的PubMed中文搜索引擎

马上搜索

文档翻译

学术文献翻译模型,支持多种主流文档格式。

立即体验