Dynamic Programming and Graph Algorithms in Computer Vision

Abstract

Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization techniques are especially interesting since, by carefully exploiting problem structure, they often provide nontrivial guarantees concerning solution quality. In this paper, we review dynamic programming and graph algorithms, and discuss representative examples of how these discrete optimization techniques have been applied to some classical vision problems. We focus on the low-level vision problem of stereo, the mid-level problem of interactive object segmentation, and the high-level problem of model-based recognition.

DOI: 10.1109/TPAMI.2010.135

Extracted Key Phrases

9 Figures and Tables

010203020102011201220132014201520162017
Citations per Year

112 Citations

Semantic Scholar estimates that this publication has 112 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Felzenszwalb2011DynamicPA, title={Dynamic Programming and Graph Algorithms in Computer Vision}, author={Pedro F. Felzenszwalb and Ramin Zabih}, journal={IEEE Transactions on Pattern Analysis and Machine Intelligence}, year={2011}, volume={33}, pages={721-740} }