1 / 1

Scene Labeling Using Beam Search Under Mutex Constraints Anirban Roy and Sinisa Todorovic

Scene Labeling Using Beam Search Under Mutex Constraints Anirban Roy and Sinisa Todorovic. Beam Search for Solving QP Results Acknowledgment. Problem and Motivation Approach Extracting superpixels Incorporating mutex in the standard CRF formulation Formulating CRF inference as QP

mignon
Download Presentation

Scene Labeling Using Beam Search Under Mutex Constraints Anirban Roy and Sinisa Todorovic

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

  1. Scene Labeling Using Beam Search Under Mutex Constraints Anirban Roy and Sinisa Todorovic Beam Search for Solving QP Results Acknowledgment Problem and Motivation Approach Extracting superpixels Incorporating mutex in the standard CRF formulation Formulating CRF inference as QP Beam search for solving QP Learning – piecewise How to Specify CRF Energy? CRF Inference as QP Specifying Mutex Constraints State: label assignment Heuristic function: Semantic segmentation without Mutex Semantic segmentation with Mutex Input Image Assignment vector MUTual EXclusion= (object, object, relationship) next state previous state Superpixel Class label Score: maximum score Matrix of CRF potentials Pixelwise accuracy(%) ∞ must be Appearance features of the superpixels • Smoothness • and Context Mutex violations can be arbitrary Matrix of mutex constraints NSF RI 1302700

More Related