Outlier-Robust Multi-Model Fitting on Quantum Annealers
Saurabh Pandey, Luca Magri, Federica Arrigoni, Vladislav Golyanik
TL;DR
This work tackles the challenging problem of outlier-prone multi-model fitting by introducing Robust Quantum Multi-Model Fitting (R-QuMF), a formulation that explicitly models outliers within a maximum-set-coverage objective compatible with quantum annealers. By sampling provisional models to build a binary preference matrix $P$ and reformulating MSC as a QUBO with $ extbf{w}=[ extbf{y}; extbf{z}]$, the method jointly selects a small number of non-redundant models without requiring prior knowledge of the true model count $k$. A decomposition strategy, De-RQuMF, partitions large MSC problems into subproblems solvable on current quantum hardware, enabling scalable, robust fitting on real and synthetic data; experiments demonstrate superior robustness to outliers compared with prior quantum approaches and competitive performance against classical baselines. The results, including line, plane, and motion-segmentation tasks on synthetic and AdelaideRMF datasets, indicate the practical potential of quantum-accelerated MMF for noisy, real-world data, while also acknowledging hardware maturity as a current limitation. Overall, R-QuMF advances robust MMF in quantum settings and opens avenues for handling heterogeneous models and larger-scale vision tasks as quantum hardware continues to evolve.
Abstract
Multi-model fitting (MMF) presents a significant challenge in Computer Vision, particularly due to its combinatorial nature. While recent advancements in quantum computing offer promise for addressing NP-hard problems, existing quantum-based approaches for model fitting are either limited to a single model or consider multi-model scenarios within outlier-free datasets. This paper introduces a novel approach, the robust quantum multi-model fitting (R-QuMF) algorithm, designed to handle outliers effectively. Our method leverages the intrinsic capabilities of quantum hardware to tackle combinatorial challenges inherent in MMF tasks, and it does not require prior knowledge of the exact number of models, thereby enhancing its practical applicability. By formulating the problem as a maximum set coverage task for adiabatic quantum computers (AQC), R-QuMF outperforms existing quantum techniques, demonstrating superior performance across various synthetic and real-world 3D datasets. Our findings underscore the potential of quantum computing in addressing the complexities of MMF, especially in real-world scenarios with noisy and outlier-prone data.
