4 DAILY CVPR Saturday Oral & Award Candidate In this paper, Bangyan explores the challenge of vanishing point estimation in a Manhattan world, a classical problem in 3D computer vision. This problem involves identifying the points at which multiple parallel lines appear to converge in a 3D space, a critical task for several computer vision applications. Bangyan's research addresses the limitations of previous methods, which often struggled with speed and global solutions. “We apply a convex relaxation technique to these problems for the first time,” he explains. “Our method can jointly estimate vanishing point positions and line associations simultaneously, showing that GlobustVP achieves a superior balance of efficiency, robustness, and global optimality compared to prior works.” Vanishing point estimation is a fundamental building block for many downstream applications in 3D computer vision, and one which has not yet been fully solved, which served as a key motivator for Bangyan to push his research forward. “Since this problem is very old, everybody thinks it must be very simple, but I don't think so,” he points out. “It’s a typical chicken and egg problem. To solve such problems, you must address two subproblems simultaneously. These two subproblems are highly coupled with each other. Solving each subtask is simple, but solving them both is a very hard problem.” Bangyan Liao is a second-year PhD student at Westlake University in China. His paper introduces GlobustVP, a novel method for vanishing point estimation in a Manhattan world. In addition to being accepted for a coveted oral slot, it has been nominated as a candidate for a Best Paper award this year. Ahead of his presentation, Bangyan tells us more about his work. Convex Relaxation for Robust Vanishing Point Estimation in Manhattan World
RkJQdWJsaXNoZXIy NTc3NzU=