Quantum Multi-Model Fitting
About
Geometric model fitting is a challenging but fundamental computer vision problem. Recently, quantum optimization has been shown to enhance robust fitting for the case of a single model, while leaving the question of multi-model fitting open. In response to this challenge, this paper shows that the latter case can significantly benefit from quantum hardware and proposes the first quantum approach to multi-model fitting (MMF). We formulate MMF as a problem that can be efficiently sampled by modern adiabatic quantum computers without the relaxation of the objective function. We also propose an iterative and decomposed version of our method, which supports real-world-sized problems. The experimental evaluation demonstrates promising results on a variety of datasets. The source code is available at: https://github.com/FarinaMatteo/qmmf.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Object motion segmentation | Hopkins Traffic3 45 | Mean Misclassification Error55 | 8 | |
| Object motion segmentation | Hopkins Traffic2 45 | Mean Misclassification Error10 | 7 | |
| Vanishing Point Detection | York DB 15 (full) | Mean Misclassification Error0.74 | 6 | |
| Fundamental Matrix Estimation | AdelaideRMF single-model sequences (10% outliers) | Misclassification Error2.41 | 4 | |
| Fundamental Matrix Estimation | AdelaideRMF single-model sequences 20% outliers | Misclassification Error (%)8.28 | 4 | |
| Fundamental Matrix Estimation | AdelaideRMF single-model sequences (Full) | Misclassification Error10.83 | 4 | |
| Multi-model fitting | AdelaideRMF 15 multi-model sequences | Mean Misclassification Error0.77 | 4 | |
| Robust Multi-Model Fitting | AdelaideRMF single-model (test) | Mean Runtime (s)0.99 | 4 | |
| Robust Multi-Model Fitting | AdelaideRMF multi-model (test) | Mean Runtime (s)0.77 | 4 | |
| Robust Multi-Model Fitting | Traffic2 (test) | Mean Runtime (s)2.54 | 4 |