mlsanityData to 7 Oct 2026

Quantum Motion Segmentation

arXiv 2203.13185 ↗First posted 24 Mar 2022cs.CVcited by 16

Not on the map. Why?

Abstract (arXiv)

Motion segmentation is a challenging problem that seeks to identify independent motions in two or several input images. This paper introduces the first algorithm for motion segmentation that relies on adiabatic quantum optimization of the objective function. The proposed method achieves on-par performance with the state of the art on problem instances which can be mapped to modern quantum annealers.

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). Builds on 22 of its 64 references that are in the map. First posted on arXiv 24 Mar 2022.

Builds on

22 of 64 references.

References · 22

  1. 2017A Survey of Structure from Motioncited by 157
  2. 2016SE-Sync: A Certifiably Correct Algorithm for Synchronization over the Special Euclidean Groupcited by 80
  3. 2021MultiBodySync: Multi-Body Segmentation and Motion Estimation via 3D Scan Synchronizationcited by 46
  4. 2015Multi-Image Matching via Fast Alternating Minimizationcited by 33
  5. 2021Quantum Permutation Synchronizationcited by 32
  6. 2021Q-Match: Iterative Shape Matching via Quantum Annealingcited by 27
  7. 2014A practical heuristic for finding graph minorscited by 26
  8. 2018Higher-order Projected Power Iterations for Scalable Multi-Matchingcited by 24
  9. 2017Nonnegative/binary matrix factorization with a D-Wave quantum annealercited by 23
  10. 2019A Quantum Computational Approach to Correspondence Problems on Point Setscited by 23
  11. 2021Adiabatic Quantum Graph Matching with Permutation Matrix Constraintscited by 20
  12. 2017Multi-Class Model Fitting by Energy Minimization and Mode-Seekingcited by 19
10 more
  1. 2020Synchronizing Probability Measures on Rotations via Optimal Transportcited by 19
  2. 2020Quantum-soft QUBO Suppression for Accurate Object Detectioncited by 19
  3. 2014Near-Optimal Joint Object Matching via Convex Relaxationcited by 17
  4. 2014A Solution for Multi-Alignment by Transformation Synchronisationcited by 15
  5. 2017Multi-Image Semantic Matching by Mining Consistent Featurescited by 13
  6. 20193D Rigid Motion Segmentation with Mixed and Unknown Number of Modelscited by 11
  7. 2021Matching Point Sets with Quantum Circuit Learningcited by 10
  8. 2015Shape Interaction Matrix Revisited and Robustified: Efficient Subspace Clustering with Corrupted and Incomplete Datacited by 8
  9. 2017Distributed methods for synchronization of orthogonal matrices over graphscited by 7
  10. 2019Robust Motion Segmentation from Pairwise Matchescited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 7; 2024: 4; 2025: 3; 2026: 1.

16 papers.

Sort:

  1. 2023Quantum Multi-Model Fittingcited by 12
  2. 2023CCuantuMM: Cycle-Consistent Quantum-Hybrid Matching of Multiple Shapescited by 11
  3. 2023Q-Seg: Quantum Annealing-Based Unsupervised Image Segmentationcited by 11
  4. 2024QClusformer: A Quantum Transformer-based Framework for Unsupervised Visual Clusteringcited by 11
  5. 2024Quantum Visual Feature Encoding Revisitedcited by 10
  6. 2024Robust Fitting on a Gate Quantum Computercited by 5
  7. 2025Quantum-enhanced Computer Vision: Going Beyond Classical Algorithmscited by 5
  8. 2022QuAnt: Quantum Annealing with Learnt Couplingscited by 3
  9. 2023Probabilistic Sampling of Balanced K-Means using Adiabatic Quantum Computingcited by 3
  10. 2023Projected Stochastic Gradient Descent with Quantum Annealed Binary Gradientscited by 3
  11. 2024Quantum Artificial Intelligence: A Brief Surveycited by 3
  12. 2023Quantum Annealing for Computer Vision Minimization Problemscited by 2
4 more
  1. 2023Quantum-Hybrid Stereo Matching With Nonlinear Regularization and Spatial Pyramidscited by 2
  2. 2025Outlier-Robust Multi-Model Fitting on Quantum Annealerscited by 1
  3. 2026Quantum Multiple Rotation Averagingcited by 1
  4. 2025HQC-NBV: A Hybrid Quantum-Classical View Planning Approachcited by 0