Efficient RGBD Cuboid Matching with Mixed Integer Programing for Global Optimal Solution

DESCRIPTION

This research presents a linear approach for matching cuboids in RGBD images. By utilizing candidate proposals and context modeling with mixed integer programing, a global optimal solution is achieved within 10 seconds. The efficient algorithm covers key aspects like intersection, occlusion, and branch-and-bound, enabling precise rendering from multiple views.

Download

1 / 7

Mar 18, 2014

Télécharger la présentation

Efficient RGBD Cuboid Matching with Mixed Integer Programing for Global Optimal Solution

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

3D Context Model Input RGB Image Input Depth Image Result Rendering from Different Views A Linear Approach to Matching Cuboids in RGBD Images. Jiang and Xiao, CVPR 2013.
Candidate Proposals
Context Model: Mixed IP UnaryCost Intersection Number Coverage Occlusion Branch and Bound Mixed Integer Programing Global Optimal Solution in 10 seconds (Code Available)