Probabilistic Search for Object Segmentation and Recognition
<|reference_start|>Probabilistic Search for Object Segmentation and Recognition: The problem of searching for a model-based scene interpretation is analyzed within a probabilistic framework. Object models are formulated as generative models for range data of the scene. A new statistical criterion, the truncated object probability, is introduced to infer an optimal sequence of object hypotheses to be evaluated for their match to the data. The truncated probability is partly determined by prior knowledge of the objects and partly learned from data. Some experiments on sequence quality and object segmentation and recognition from stereo data are presented. The article recovers classic concepts from object recognition (grouping, geometric hashing, alignment) from the probabilistic perspective and adds insight into the optimal ordering of object hypotheses for evaluation. Moreover, it introduces point-relation densities, a key component of the truncated probability, as statistical models of local surface shape.<|reference_end|>
@article{hillenbrand2002probabilistic,
    title={Probabilistic Search for Object Segmentation and Recognition},
    author={Ulrich Hillenbrand and Gerd Hirzinger},
    journal={Proceedings ECCV 2002, Lecture Notes in Computer Science Vol.
  2352, pp. 791-806},
    year={2002},
    archivePrefix={arXiv},
    eprint={cs/0208005},
    primaryClass={cs.CV}
}