Sciweavers

NIPS
2007

Rapid Inference on a Novel AND/OR graph for Object Detection, Segmentation and Parsing

14 years 18 days ago
Rapid Inference on a Novel AND/OR graph for Object Detection, Segmentation and Parsing
In this paper we formulate a novel AND/OR graph representation capable of describing the different configurations of deformable articulated objects such as horses. The representation makes use of the summarization principle so that lower level nodes in the graph only pass on summary statistics to the higher level nodes. The probability distributions are invariant to position, orientation, and scale. We develop a novel inference algorithm that combined a bottom-up process for proposing configurations for horses together with a top-down process for refining and validating these proposals. The strategy of surround suppression is applied to ensure that the inference time is polynomial in the size of input data. The algorithm was applied to the tasks of detecting, segmenting and parsing horses. We demonstrate that the algorithm is fast and comparable with the state of the art approaches.
Yuanhao Chen, Long Zhu, Chenxi Lin, Alan L. Yuille
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2007
Where NIPS
Authors Yuanhao Chen, Long Zhu, Chenxi Lin, Alan L. Yuille, HongJiang Zhang
Comments (0)