Tiered Scene Labeling with Dynamic Programming

10 years 9 months ago
Tiered Scene Labeling with Dynamic Programming
Dynamic programming (DP) has been a useful tool for a variety of computer vision problems. However its application is usually limited to problems with a one dimensional or low treewidth structure, whereas most domains in vision are at least 2D. In this paper we show how to apply DP for pixel labeling of 2D scenes with simple "tiered" structure. While there are many variations possible, for the applications we consider the following tiered structure is appropriate. An image is first divided by horizontal curves into the top, middle, and bottom regions, and the middle region is further subdivided vertically into subregions. Under these constraints a globally optimal labeling can be found using an efficient dynamic programming algorithm. We apply this algorithm to two very different tasks. The first is the problem of geometric class labeling where the goal is to assign each pixel a label such as "sky", "ground", and "surface above ground". The seco...
Pedro Felzenszwalb, Olga Veksler
Added 30 Mar 2010
Updated 14 May 2010
Type Conference
Year 2010
Where CVPR
Authors Pedro Felzenszwalb, Olga Veksler
Comments (0)