[CVPR 2025 Award Candidate & Oral] Convex Relaxation for Robust Vanishing Point Estimation in Manhattan World
-
Updated
May 10, 2025 - Python
[CVPR 2025 Award Candidate & Oral] Convex Relaxation for Robust Vanishing Point Estimation in Manhattan World
[ECCV 2024] GlobalPointer: Large-Scale Plane Adjustment with Bi-Convex Relaxation
MCPy is a python library for McCormick relaxations with sub-gradients. This is quite useful for prototyping and testing new convex relaxation and global optimization algorithms.
Proof-of-concept implementation of a new method for computing convex relaxations for implicit functions and inverse functions.
Add a description, image, and links to the convex-relaxation topic page so that developers can more easily learn about it.
To associate your repository with the convex-relaxation topic, visit your repo's landing page and select "manage topics."