Playing with Kruskal: algorithms for flat and hierarchical watershed cuts

arXiv:2610.10012 · cs.CV · Submitted 2026-10-07 · Read on arXiv

cs.CV

Submitted: 2026-10-07

Updated: 2026-10-07

Terminology

• Minimum Spanning Tree — 9× in this paper
• Core — 7× in this paper · explained in 2 episodes
• Combinatorial Optimization — 5× in this paper · explained in 2 episodes
• Binary Partition Tree by Altitude Ordering — 3× in this paper
• Clustering — 2× in this paper · explained in 2 episodes
• Consistency — 2× in this paper · explained in 3 episodes
• Generalization — 2× in this paper · explained in 13 episodes
• Reinforcement Learning — 2× in this paper · explained in 4 episodes
• Topological Order — 2× in this paper · explained in 2 episodes
• Adaptation — 1× in this paper · explained in 1 episode
• Foundation Model — 1× in this paper · explained in 3 episodes
• Graph Construction — 1× in this paper · explained in 3 episodes
• Modularity — 1× in this paper · explained in 9 episodes

Related papers

• Loss Knows Best: Detecting Annotation Errors in Videos via Loss Trajectories
• AnchorWeave: World-Consistent Video Generation with Retrieved Local Spatial Memories
• Benchmarking the Robustness of Foundation Models for Mammography under Domain Shift
• MambaX-Net: Dual-Input Mamba-Enhanced Cross-Attention Network for Longitudinal MRI Segmentation
• TeleOCR: Navigating Document Parsing Across Digital and Camera-Captured Documents
• A Survey on Efficient Vision-Language-Action Models