Cycle-Consistent Multi-Graph Matching for Self-Supervised Annotation of C.Elegans
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912937796435968 |
|---|---|
| author | Karg, Christoph Stricker, Sebastian Hutschenreiter, Lisa Savchynskyy, Bogdan Kainmueller, Dagmar |
| author_facet | Karg, Christoph Stricker, Sebastian Hutschenreiter, Lisa Savchynskyy, Bogdan Kainmueller, Dagmar |
| contents | In this work we present a novel approach for unsupervised multi-graph matching, which applies to problems for which a Gaussian distribution of keypoint features can be assumed. We leverage cycle consistency as loss for self-supervised learning, and determine Gaussian parameters through Bayesian Optimization, yielding a highly efficient approach that scales to large datasets. Our fully unsupervised approach enables us to reach the accuracy of state-of-the-art supervised methodology for the biomedical use case of semantic cell annotation in 3D microscopy images of the worm C. elegans. To this end, our approach yields the first unsupervised atlas of C. elegans, i.e. a model of the joint distribution of all of its cell nuclei, without the need for any ground truth cell annotation. This advancement enables highly efficient semantic annotation of cells in large microscopy datasets, overcoming a current key bottleneck. Beyond C. elegans, our approach offers fully unsupervised construction of cell-level atlases for any model organism with a stereotyped body plan down to the level of unique semantic cell labels, and thus bears the potential to catalyze respective biomedical studies in a range of further species. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_07348 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Cycle-Consistent Multi-Graph Matching for Self-Supervised Annotation of C.Elegans Karg, Christoph Stricker, Sebastian Hutschenreiter, Lisa Savchynskyy, Bogdan Kainmueller, Dagmar Computer Vision and Pattern Recognition In this work we present a novel approach for unsupervised multi-graph matching, which applies to problems for which a Gaussian distribution of keypoint features can be assumed. We leverage cycle consistency as loss for self-supervised learning, and determine Gaussian parameters through Bayesian Optimization, yielding a highly efficient approach that scales to large datasets. Our fully unsupervised approach enables us to reach the accuracy of state-of-the-art supervised methodology for the biomedical use case of semantic cell annotation in 3D microscopy images of the worm C. elegans. To this end, our approach yields the first unsupervised atlas of C. elegans, i.e. a model of the joint distribution of all of its cell nuclei, without the need for any ground truth cell annotation. This advancement enables highly efficient semantic annotation of cells in large microscopy datasets, overcoming a current key bottleneck. Beyond C. elegans, our approach offers fully unsupervised construction of cell-level atlases for any model organism with a stereotyped body plan down to the level of unique semantic cell labels, and thus bears the potential to catalyze respective biomedical studies in a range of further species. |
| title | Cycle-Consistent Multi-Graph Matching for Self-Supervised Annotation of C.Elegans |
| topic | Computer Vision and Pattern Recognition |
| url | https://arxiv.org/abs/2503.07348 |