Research map / Learning theory and algorithms / Clustering
Higher-Order Multicuts for Geometric Model Fitting and Motion Segmentation
Evgeny Levinkov, Amirhossein Kardoost, Bjoern Andres, Margret Keuper
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Higher-Order Minimum Cost Lifted Multicuts for Motion Segmentation (ICCV 2017 · similarity 0.91)
- What to Select: Pursuing Consistent Motion Segmentation from Multiple Geometric Models (AAAI 2021 · similarity 0.87)
- Geometric Multi-Model Fitting With a Convex Relaxation Algorithm (CVPR 2018 · similarity 0.86)
- GaussianCut: Interactive segmentation via graph cut for 3D Gaussian Splatting (NeurIPS 2024 · similarity 0.85)
- SegGraph: Leveraging Graphs of SAM Segments for Few-Shot 3D Part Segmentation (NeurIPS 2025 · similarity 0.84)
- PARSAC: Accelerating Robust Multi-Model Fitting with Parallel Sample Consensus (AAAI 2024 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
