ResearchTrend.AI
Deterministic consensus maximization with biconvex programming
v1v2v3 (latest)

Deterministic consensus maximization with biconvex programming

Zhipeng Cai
Tat-Jun Chin
Huu Le
David Suter
ArXiv (abs)PDFHTML

Papers citing "Deterministic consensus maximization with biconvex programming"

8 / 8 papers shown
Title
Accelerating Globally Optimal Consensus Maximization in Geometric Vision
Accelerating Globally Optimal Consensus Maximization in Geometric Vision
Xinyue Zhang
Liangzu Peng
Wanting Xu
L. Kneip
88
9
0
11 Apr 2023
A Hybrid Quantum-Classical Algorithm for Robust Fitting
A Hybrid Quantum-Classical Algorithm for Robust Fitting
Anh-Dzung Doan
Michele Sasdelli
David Suter
Tat-Jun Chin
89
26
0
25 Jan 2022
GLIMPS: A Greedy Mixed Integer Approach for Super Robust Matched Subspace Detection
GLIMPS: A Greedy Mixed Integer Approach for Super Robust Matched Subspace Detection
M. Rahman
Daniel L. Pimentel-Alarcón
25
0
0
29 Oct 2019
Convex Relaxations for Consensus and Non-Minimal Problems in 3D Vision
Convex Relaxations for Consensus and Non-Minimal Problems in 3D Vision
Thomas Probst
D. Paudel
Ajad Chhatkuli
Luc Van Gool
78
12
0
26 Sep 2019
Consensus Maximization Tree Search Revisited
Consensus Maximization Tree Search Revisited
Zhipeng Cai
Tat-Jun Chin
V. Koltun
68
21
0
06 Aug 2019
SDRSAC: Semidefinite-Based Randomized Approach for Robust Point Cloud Registration without Correspondences
SDRSAC: Semidefinite-Based Randomized Approach for Robust Point Cloud Registration without Correspondences
Huu Le
Thanh-Toan Do
Tuan Hoang
Ngai-Man Cheung
3DV3DPC
79
89
0
06 Apr 2019
An Efficient Solution to Non-Minimal Case Essential Matrix Estimation
An Efficient Solution to Non-Minimal Case Essential Matrix Estimation
Ji Zhao
77
51
0
21 Mar 2019
Robust Fitting in Computer Vision: Easy or Hard?
Robust Fitting in Computer Vision: Easy or Hard?
Tat-Jun Chin
Zhipeng Cai
Frank Neumann
87
75
0
18 Feb 2018