Moral Lineage Tracing
원문 초록
Lineage tracing, the tracking of living cells as they move and divide, is a central problem in biological image analysis. Solutions, called lineage forests, are key to understanding how the structure of multicellular organisms emerges. We propose an integer linear program (ILP) whose feasible solutions define a decomposition of each image in a sequence into cells (segmentation), and a lineage forest of cells across images (tracing). Unlike previous formulations, we do not constrain the set of decompositions, except by contracting pixels to superpixels. The main challenge, as we show, is to enforce the morality of lineages, i.e., the constraint that cells do not merge. To enforce morality, we introduce path-cut inequalities. To find feasible solutions of the NP-hard ILP, with certified bounds to the global optimum, we define efficient separation procedures and apply these as part of a branch-and-cut algorithm. We show the effectiveness of this approach by analyzing feasible solutions for real microscopy data in terms of bounds and run-time, and by their weighted edit distance to ground truth lineage forests traced by humans.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Structural-Spectral Graph Convolution with Evidential Edge Learning for Hyperspectral Image Clustering
Superpixel Tokenization for Vision Transformers: Preserving Semantic Integrity in Visual Tokens
STA-Unet: Rethink the semantic redundant for Medical Imaging Segmentation
A comprehensive review and new taxonomy on superpixel segmentation
ESA: Annotation-Efficient Active Learning for Semantic Segmentation
Persistence Image from 3D Medical Image: Superpixel and Optimized Gaussian Coefficient
토론
이 논문과 연결된 포럼 글이 아직 없습니다.