PARSAC: Accelerating Robust Multi-Model Fitting with Parallel Sample Consensus

Research output: Contribution to journalConference articleResearchpeer review

View graph of relations

Details

Original languageEnglish
Pages (from-to)2804-2812
Number of pages9
JournalProceedings of the AAAI Conference on Artificial Intelligence
Volume38
Issue number3
Publication statusPublished - 24 Mar 2024
Event38th AAAI Conference on Artificial Intelligence, AAAI 2024 - Vancouver, Canada
Duration: 20 Feb 202427 Feb 2024

Abstract

We present a real-time method for robust estimation of multiple instances of geometric models from noisy data. Geometric models such as vanishing points, planar homographies or fundamental matrices are essential for 3D scene analysis. Previous approaches discover distinct model instances in an iterative manner, thus limiting their potential for speedup via parallel computation. In contrast, our method detects all model instances independently and in parallel. A neural network segments the input data into clusters representing potential model instances by predicting multiple sets of sample and inlier weights. Using the predicted weights, we determine the model parameters for each potential instance separately in a RANSAC-like fashion. We train the neural network via task-specific loss functions, i.e. we do not require a ground-truth segmentation of the input data. As suitable training data for homography and fundamental matrix fitting is scarce, we additionally present two new synthetic datasets. We demonstrate state-of-the-art performance on these as well as multiple established datasets, with inference times as small as five milliseconds per image.

ASJC Scopus subject areas

Cite this

PARSAC: Accelerating Robust Multi-Model Fitting with Parallel Sample Consensus. / Kluger, Florian; Rosenhahn, Bodo.
In: Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 38, No. 3, 24.03.2024, p. 2804-2812.

Research output: Contribution to journalConference articleResearchpeer review

Kluger, F & Rosenhahn, B 2024, 'PARSAC: Accelerating Robust Multi-Model Fitting with Parallel Sample Consensus', Proceedings of the AAAI Conference on Artificial Intelligence, vol. 38, no. 3, pp. 2804-2812. https://doi.org/10.1609/aaai.v38i3.28060, https://doi.org/10.48550/arXiv.2401.14919
Kluger F, Rosenhahn B. PARSAC: Accelerating Robust Multi-Model Fitting with Parallel Sample Consensus. Proceedings of the AAAI Conference on Artificial Intelligence. 2024 Mar 24;38(3):2804-2812. doi: 10.1609/aaai.v38i3.28060, 10.48550/arXiv.2401.14919
Kluger, Florian ; Rosenhahn, Bodo. / PARSAC : Accelerating Robust Multi-Model Fitting with Parallel Sample Consensus. In: Proceedings of the AAAI Conference on Artificial Intelligence. 2024 ; Vol. 38, No. 3. pp. 2804-2812.
Download
@article{d4ef4666503b4447ae769a665e509163,
title = "PARSAC: Accelerating Robust Multi-Model Fitting with Parallel Sample Consensus",
abstract = "We present a real-time method for robust estimation of multiple instances of geometric models from noisy data. Geometric models such as vanishing points, planar homographies or fundamental matrices are essential for 3D scene analysis. Previous approaches discover distinct model instances in an iterative manner, thus limiting their potential for speedup via parallel computation. In contrast, our method detects all model instances independently and in parallel. A neural network segments the input data into clusters representing potential model instances by predicting multiple sets of sample and inlier weights. Using the predicted weights, we determine the model parameters for each potential instance separately in a RANSAC-like fashion. We train the neural network via task-specific loss functions, i.e. we do not require a ground-truth segmentation of the input data. As suitable training data for homography and fundamental matrix fitting is scarce, we additionally present two new synthetic datasets. We demonstrate state-of-the-art performance on these as well as multiple established datasets, with inference times as small as five milliseconds per image.",
author = "Florian Kluger and Bodo Rosenhahn",
note = "Publisher Copyright: Copyright {\textcopyright} 2024, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 38th AAAI Conference on Artificial Intelligence, AAAI 2024 ; Conference date: 20-02-2024 Through 27-02-2024",
year = "2024",
month = mar,
day = "24",
doi = "10.1609/aaai.v38i3.28060",
language = "English",
volume = "38",
pages = "2804--2812",
number = "3",

}

Download

TY - JOUR

T1 - PARSAC

T2 - 38th AAAI Conference on Artificial Intelligence, AAAI 2024

AU - Kluger, Florian

AU - Rosenhahn, Bodo

N1 - Publisher Copyright: Copyright © 2024, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

PY - 2024/3/24

Y1 - 2024/3/24

N2 - We present a real-time method for robust estimation of multiple instances of geometric models from noisy data. Geometric models such as vanishing points, planar homographies or fundamental matrices are essential for 3D scene analysis. Previous approaches discover distinct model instances in an iterative manner, thus limiting their potential for speedup via parallel computation. In contrast, our method detects all model instances independently and in parallel. A neural network segments the input data into clusters representing potential model instances by predicting multiple sets of sample and inlier weights. Using the predicted weights, we determine the model parameters for each potential instance separately in a RANSAC-like fashion. We train the neural network via task-specific loss functions, i.e. we do not require a ground-truth segmentation of the input data. As suitable training data for homography and fundamental matrix fitting is scarce, we additionally present two new synthetic datasets. We demonstrate state-of-the-art performance on these as well as multiple established datasets, with inference times as small as five milliseconds per image.

AB - We present a real-time method for robust estimation of multiple instances of geometric models from noisy data. Geometric models such as vanishing points, planar homographies or fundamental matrices are essential for 3D scene analysis. Previous approaches discover distinct model instances in an iterative manner, thus limiting their potential for speedup via parallel computation. In contrast, our method detects all model instances independently and in parallel. A neural network segments the input data into clusters representing potential model instances by predicting multiple sets of sample and inlier weights. Using the predicted weights, we determine the model parameters for each potential instance separately in a RANSAC-like fashion. We train the neural network via task-specific loss functions, i.e. we do not require a ground-truth segmentation of the input data. As suitable training data for homography and fundamental matrix fitting is scarce, we additionally present two new synthetic datasets. We demonstrate state-of-the-art performance on these as well as multiple established datasets, with inference times as small as five milliseconds per image.

UR - http://www.scopus.com/inward/record.url?scp=85188931493&partnerID=8YFLogxK

U2 - 10.1609/aaai.v38i3.28060

DO - 10.1609/aaai.v38i3.28060

M3 - Conference article

AN - SCOPUS:85188931493

VL - 38

SP - 2804

EP - 2812

JO - Proceedings of the AAAI Conference on Artificial Intelligence

JF - Proceedings of the AAAI Conference on Artificial Intelligence

SN - 2159-5399

IS - 3

Y2 - 20 February 2024 through 27 February 2024

ER -

By the same author(s)