Efficient Matching of Pictorial Structures (2000)
| Venue: | Proc. IEEE Computer Vision and Pattern Recognition Conf. |
| Citations: | 114 - 9 self |
BibTeX
@INPROCEEDINGS{Felzenszwalb00efficientmatching,
author = {Pedro F. Felzenszwalb and Daniel P. Huttenlocher},
title = {Efficient Matching of Pictorial Structures},
booktitle = {Proc. IEEE Computer Vision and Pattern Recognition Conf.},
year = {2000},
pages = {66--73},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A pictorial structure is a collection of parts arranged in a deformable configuration. Each part is represented using a simple appearance model and the deformable configuration is represented by spring-like connections between pairs of parts. While pictorial structures were introduced a number of years ago, they have not been broadly applied to matching and recognition problems. This has been due in part to the computational difficulty of matching pictorial structures to images. In this paper we present an efficient algorithm for finding the best global match of a pictorial structure to an image. The running time of the algorithm is optimal and it it takes only a few seconds to match a model with ve to ten parts. With this improved algorithm, pictorial structures provide a practical and powerful framework for qualitative descriptions of objects and scenes, and are suitable for many generic image recognition problems. We illustrate the approach using simple models of a person and a car.
