Correlation Clustering of Organoid Images
Authors:
Preprint
Abstract
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.Keywords
All Related Versions
This publication has 46 references indexed in Scilit:
- Relative-interior solution for the (incomplete) linear assignment problem with applications to the quadratic assignment problemAnnals of Mathematics and Artificial Intelligence, 2025
- A Comparative Study of Graph Matching Algorithms in Computer Vision2022
- MSM: Multi-stage Multicuts for Scalable Image Clustering2021
- Self-organization of organoids from endoderm-derived cellsJournal of Molecular Medicine, 2020
- Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers2020
- Siamese Neural Networks: An Overview2020
- Cell Detection with Star-Convex Polygons2018
- Multicuts and Perturb & MAP for Probabilistic Graph ClusteringJournal of Mathematical Imaging and Vision, 2016
- Feature Correspondence Via Graph Matching: Models and Global Optimization2008
- The Quadratic Assignment Problem1998