Pith. sign in

REVIEW 4 cited by

Progressive NAPSAC: sampling from gradually growing neighborhoods

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1906.02295 v1 pith:F6AVPSQQ submitted 2019-06-05 cs.CV

Daniel Barath , Maksym Ivashechkin , Jiri Matas This is my paper · ORCID
classification cs.CV
keywords p-napsacsamplinglocalprogressiveusacglobalgraduallygrowing
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We propose Progressive NAPSAC, P-NAPSAC in short, which merges the advantages of local and global sampling by drawing samples from gradually growing neighborhoods. Exploiting the fact that nearby points are more likely to originate from the same geometric model, P-NAPSAC finds local structures earlier than global samplers. We show that the progressive spatial sampling in P-NAPSAC can be integrated with PROSAC sampling, which is applied to the first, location-defining, point. P-NAPSAC is embedded in USAC, a state-of-the-art robust estimation pipeline, which we further improve by implementing its local optimization as in Graph-Cut RANSAC. We call the resulting estimator USAC*. The method is tested on homography and fundamental matrix fitting on a total of 10,691 models from seven publicly available datasets. USAC* with P-NAPSAC outperforms reference methods in terms of speed on all problems.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. RANSAC Scoring Done Right

    cs.LG 2026-06 unverdicted novelty 7.0 of 10

    A new RANSAC score obtained by marginalizing inlier scale in closed form under an Inverse-Gamma prior, outperforming threshold-based baselines on a 70k-pair benchmark while remaining insensitive to scale miscalibration.

  2. Efficient Minimal Solvers for Relative Pose Estimation in Autonomous Driving Applications

    cs.RO 2026-06 unverdicted novelty 6.0 of 10

    Proposes three efficient minimal solvers for relative pose estimation in multi-camera autonomous driving systems by reducing point correspondences via new parameterization and motion priors.

  3. Efficient Minimal Solvers for Visual-Inertial Relative Pose Estimation in Multi-Camera Systems

    cs.CV 2026-06 unverdicted novelty 6.0 of 10

    Two new minimal solvers for multi-camera visual-inertial relative pose that use four points and IMU direction priors to reach a univariate 6th-degree polynomial.

  4. SupeRANSAC: One RANSAC to Rule Them All

    cs.CV 2025-06 conditional novelty 5.0 of 10

    SupeRANSAC, a well-engineered combination of known RANSAC components, achieves state-of-the-art accuracy on homography, fundamental and essential matrix, and rigid and absolute pose estimation benchmarks.

Pith tools