When Slots Compete: Slot Merging in Object-Centric Learning
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910049660567552 |
|---|---|
| author | Chatzisavvas, Christos Rigas, Panagiotis Ioannakis, George Katsouros, Vassilis Mitianoudis, Nikolaos |
| author_facet | Chatzisavvas, Christos Rigas, Panagiotis Ioannakis, George Katsouros, Vassilis Mitianoudis, Nikolaos |
| contents | Slot-based object-centric learning represents an image as a set of latent slots with a decoder that combines them into an image or features. The decoder specifies how slots are combined into an output, but the slot set is typically fixed: the number of slots is chosen upfront and slots are only refined. This can lead to multiple slots competing for overlapping regions of the same entity rather than focusing on distinct regions. We introduce slot merging: a drop-in, lightweight operation on the slot set that merges overlapping slots during training. We quantify overlap with a Soft-IoU score between slot-attention maps and combine selected pairs via a barycentric update that preserves gradient flow. Merging follows a fixed policy, with the decision threshold inferred from overlap statistics, requiring no additional learnable modules. Integrated into the established feature-reconstruction pipeline of DINOSAUR, the proposed method improves object factorization and mask quality, surpassing other adaptive methods in object discovery and segmentation benchmarks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_11246 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | When Slots Compete: Slot Merging in Object-Centric Learning Chatzisavvas, Christos Rigas, Panagiotis Ioannakis, George Katsouros, Vassilis Mitianoudis, Nikolaos Computer Vision and Pattern Recognition Slot-based object-centric learning represents an image as a set of latent slots with a decoder that combines them into an image or features. The decoder specifies how slots are combined into an output, but the slot set is typically fixed: the number of slots is chosen upfront and slots are only refined. This can lead to multiple slots competing for overlapping regions of the same entity rather than focusing on distinct regions. We introduce slot merging: a drop-in, lightweight operation on the slot set that merges overlapping slots during training. We quantify overlap with a Soft-IoU score between slot-attention maps and combine selected pairs via a barycentric update that preserves gradient flow. Merging follows a fixed policy, with the decision threshold inferred from overlap statistics, requiring no additional learnable modules. Integrated into the established feature-reconstruction pipeline of DINOSAUR, the proposed method improves object factorization and mask quality, surpassing other adaptive methods in object discovery and segmentation benchmarks. |
| title | When Slots Compete: Slot Merging in Object-Centric Learning |
| topic | Computer Vision and Pattern Recognition |
| url | https://arxiv.org/abs/2603.11246 |