Correlation Clustering of Organoid Images
Not on the map. Why?
Abstract (arXiv)
In biological and medical research, scientists now routinely acquire microscopy images of hundreds of morphologically heterogeneous organoids and are then faced with the task of finding patterns in the image collection, i.e., subsets of organoids that appear similar and potentially represent the same morphological class. We adopt models and algorithms for correlating organoid images, i.e., for quantifying the similarity in appearance and geometry of the organoids they depict, and for clustering organoid images by consolidating conflicting correlations. For correlating organoid images, we adopt and compare two alternatives, a partial quadratic assignment problem and a twin network. For clustering organoid images, we employ the correlation clustering problem. Empirically, we learn the parameters of these models, infer a clustering of organoid images, and quantify the accuracy of the inferred clusters, with respect to a training set and a test set we contribute of state-of-the-art light microscopy images of organoids clustered manually by biologists.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 19 of its 55 references that are in the map. First posted on arXiv 20 Mar 2024.
Builds on
19 of 55 references.
References · 19
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018Cell Detection with Star-convex Polygonscited by 182
- 2019SPair-71k: A Large-scale Benchmark for Semantic Correspondencecited by 140
- 2017Deep Metric Learning with Angular Losscited by 107
- 2020Deep Graph Matching via Blackbox Differentiation of Combinatorial Solverscited by 81
- 2015Efficient Decomposition of Image and Mesh Graphs by Lifted Multicutscited by 26
- 2016A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matchingcited by 26
- 2021Fusion Moves for Graph Matchingcited by 16
- 2022A Comparative Study of Graph Matching Algorithms in Computer Visioncited by 14
- 2021Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Boundscited by 12
- 2021RAMA: A Rapid Multicut Algorithm on GPUcited by 9
- 2021FastDOG: Fast Discrete Optimization on GPUcited by 8
7 more
- 2016Multicuts and Perturb & MAP for Probabilistic Graph Clusteringcited by 6
- 2022DOGE-Train: Discrete Optimization on GPU with End-to-end Trainingcited by 6
- 2023ClusterFuG: Clustering Fully connected Graphs by Multicutcited by 5
- 2022Structured Prediction Problem Archivecited by 4
- 2023Unsupervised Deep Graph Matching Based on Cycle Consistencycited by 2
- 2023Spatio-Temporal Analysis of Patient-Derived Organoid Videos Using Deep Learning for the Prediction of Drug Efficacycited by 2
- 2023Relative-Interior Solution for the (Incomplete) Linear Assignment Problem with Applications to the Quadratic Assignment Problemcited by 1
Built on by
Not cited yet.