Papers › Solving the Blind Perspective-n-Point Problem End-To-End With Robust Differentiable...

Solving the Blind Perspective-n-Point Problem End-To-End With Robust Differentiable Geometric Optimization

29 Jul 2020ECCV 2020 8arXiv:2007.14628archive 2025-07-28

Dylan Campbell, Liu Liu, Stephen Gould

Blind Perspective-n-Point (PnP) is the problem of estimating the position and orientation of a camera relative to a scene, given 2D image points and 3D scene points, without prior knowledge of the 2D-3D correspondences. Solving for pose and correspondences simultaneously is extremely challenging since the search space is very large. Fortunately it is a coupled problem: the pose can be found easily given the correspondences and vice versa. Existing approaches assume that noisy correspondences are provided, that a good pose prior is available, or that the problem size is small. We instead propose the first fully end-to-end trainable network for solving the blind PnP problem efficiently and globally, that is, without the need for pose priors. We make use of recent results in differentiating optimization problems to incorporate geometric model fitting into an end-to-end learning framework, including Sinkhorn, RANSAC and PnP algorithms. Our proposed approach significantly outperforms other methods on synthetic and real data.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2007.14628")

Code

Syntology Ran 7 of 19 code samples harvested from 2 repositories linked to this paper; 12 have no recorded run. Of those that ran: 1 ran · violated contract; 1 ran · our draft was wrong; 2 ran · fixture could not drive it; 3 ran with no contract checked.

By repository: official repository: 1 sample from 1 repository, 1 ran; community (archive-listed): 18 samples from 1 repository, 6 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

dylan-campbell/bpnpnet officialmentioned in papermentioned on GitHubpytorch report
Liumouliu/Deep_blind_PnP mentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

19 samples harvested; 7 ran; 0 honoured the contract we drafted; 12 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · violated contract
1ran · our draft was wrong
2ran · fixture could not drive it
3ran
12unverified

Licence: 0 of the 19 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

Dy dylan-campbell/bpnpnet/lib/nonlinear_weighted_blind_pnp.py official repository ran · fixture could not drive it MIT (permissive) · 50906fc42db82ac9 · report
add_argument_group Liumouliu/Deep_blind_PnP/config.py community (archive-listed) ran · our draft was wrong MIT (permissive) · 6d80592fd6d47b2d · report
get_file_list Liumouliu/Deep_blind_PnP/lib/file.py community (archive-listed) ran MIT (permissive) · 262f74c5ade997a1 · report
knn Liumouliu/Deep_blind_PnP/model/ops.py community (archive-listed) ran · fixture could not drive it fingerprinted MIT (permissive) · cdd0141594039dcb · report
read_txt Liumouliu/Deep_blind_PnP/lib/file.py community (archive-listed) ran MIT (permissive) · 6f1f2152e78c5e6f · report
sorted_alphanum Liumouliu/Deep_blind_PnP/lib/file.py community (archive-listed) ran MIT (permissive) · 03faf5df924907dd · report
str2bool Liumouliu/Deep_blind_PnP/config.py community (archive-listed) ran · violated contract MIT (permissive) · 248284f69adfeaad · report
bn_act Liumouliu/Deep_blind_PnP/model/ops.py community (archive-listed) unverified MIT (permissive) · 5a0fa80f8d2294d9 · report
correspondenceLoss Liumouliu/Deep_blind_PnP/lib/loss.py community (archive-listed) unverified MIT (permissive) · c53032885d220555 · report
correspondenceProbabilityBCE Liumouliu/Deep_blind_PnP/lib/loss.py community (archive-listed) unverified MIT (permissive) · 15fcc76407a58c98 · report
correspondenceProbabilityDistances Liumouliu/Deep_blind_PnP/lib/loss.py community (archive-listed) unverified MIT (permissive) · 3753d4559e502380 · report
get_graph_feature Liumouliu/Deep_blind_PnP/model/ops.py community (archive-listed) unverified MIT (permissive) · f5dcd38523dc6217 · report
load_data_3d2d_pairs Liumouliu/Deep_blind_PnP/lib/data_loaders.py community (archive-listed) unverified MIT (permissive) · bd6343637c69e84b · report
load_model Liumouliu/Deep_blind_PnP/lib/utils.py community (archive-listed) unverified MIT (permissive) · cf0cddae7aa96a4b · report
make_data_loader Liumouliu/Deep_blind_PnP/lib/data_loaders.py community (archive-listed) unverified MIT (permissive) · ad9e933f883a8298 · report
pairwiseL2Dist Liumouliu/Deep_blind_PnP/model/model.py community (archive-listed) unverified MIT (permissive) · c2f2bf68ef50b018 · report
reflection_matrix Liumouliu/Deep_blind_PnP/lib/transformations.py community (archive-listed) unverified MIT (permissive) · f7f6bfdeee237f86 · report
translation_from_matrix Liumouliu/Deep_blind_PnP/lib/transformations.py community (archive-listed) unverified MIT (permissive) · 77cb383b0cd2a54e · report
translation_matrix Liumouliu/Deep_blind_PnP/lib/transformations.py community (archive-listed) unverified MIT (permissive) · edeb1406911ce025 · report

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections