Recent advances in scene understanding and related tasks
have highlighted the importance of using regions to reason
about high-level scene structure. Typically, the regions are
selected beforehand and then an energy function is defined
over them. This two step process suffers from the follow-
ing deficiencies: (i) the regions may not match the bound-
aries of the scene entities, thereby introducing errors; and
(ii) as the regions are obtained without any knowledge of
the energy function, they may not be suitable for the task at
hand. We address these problems by designing an efficient
approach for obtaining the best set of regions in terms of
the energy function itself. Each iteration of our algorithm
selects regions from a large dictionary by solving an accu-
rate linear programming relaxation via dual decomposition.
The dictionary of regions is constructed by merging and in-
tersecting segments obtained from multiple bottom-up over-
segmentations. To demonstrate the u...
M. Pawan Kumar, Daphne Koller