arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2611.06624cs.CV
收藏

基于3D延时显微镜稀疏标注的细胞追踪学习

Learning to Track Cells from Sparse Annotations in 3D Time-Lapse Microscopy

GO Drive Inc.(GO Drive公司);Tokyo, Japan(日本东京)

Yusuke Uchida

AI总结:

针对3D延时显微镜稀疏标注下的细胞追踪问题,提出整合检测、连接校准与谱系事件联合选择的流程,在斑马鱼胚胎视频上验证其性能优于顺序方法,提升源于分裂恢复。

摘要:

从3D延时显微镜重建细胞谱系需要区分细胞运动与分裂,并推断时间上一致的连接。然而,当仅对部分细胞进行标注时,将未标注区域视为背景或错误对应关系的训练流程会存在问题。我们提出一种细胞追踪流程,整合稀疏标注的检测、利用图像特征校准候选连接,以及联合选择谱系图事件。检测环节结合2.5D与3D模型的输出,以抑制未标注细胞处错误的背景监督;随后利用稠密流的运动特征、学习型细胞匹配模型的对应特征,以及识别分裂前细胞、分裂母细胞、分裂后子细胞的模型特征,校准普通连接与分裂概率。在源自评估指标的代理目标下,联合选择普通连接、以子细胞对表示的分裂及节点包含关系,之后进行间隙填充与时间坐标优化。该流程在2个斑马鱼胚胎的199个视频上进行5折交叉验证,整体得分达0.9762;在候选与校准值固定的情况下,联合选择相比允许替换现有分裂并重新优化普通连接的顺序方法,性能提升0.0105,该提升主要源于分裂恢复。

英文摘要:

Reconstructing cell lineages from 3D time-lapse microscopy requires distinguishing cell motion from division and inferring temporally consistent connections. When only a subset of cells is annotated, however, training procedures that treat unannotated regions as background or incorrect correspondences can be problematic. We propose a cell tracking pipeline that integrates detection from sparse annotations, calibration of candidate connections using image features, and joint selection of lineage graph events. For detection, we combine the outputs of 2.5D and 3D models trained to suppress erroneous background supervision at unannotated cells. We then calibrate ordinary link and division probabilities using motion features from dense flow, correspondence features from a learned cell-matching model, and features from models that identify cells immediately before division, dividing parents, and daughters immediately after division. Ordinary links, divisions represented as daughter pairs, and node inclusion are selected jointly under a surrogate objective derived from the evaluation metric, followed by gap filling and temporal coordinate refinement. The pipeline achieves an overall score of 0.9762 in 5-fold cross-validation on 199 videos from 2 zebrafish embryos. With candidates and calibrated values held fixed, joint selection outperforms a sequential method that allows replacement of existing divisions and reoptimization of ordinary links by 0.0105. The improvement arises primarily from division recovery.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑