Probabilistic Search for Object Segmentation and Recognition

dc.creatorHillenbrand, Ulrich
dc.creatorHirzinger, Gerd
dc.date2002-08-05
dc.date.accessioned2026-07-07T03:18:46Z
dc.date.available2026-07-07T03:18:46Z
dc.descriptionThe 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.
dc.description18 pages, 5 figures
dc.identifierhttps://arxiv.org/abs/cs/0208005
dc.identifierhttp://arxiv.org/abs/cs/0208005
dc.identifierProceedings ECCV 2002, Lecture Notes in Computer Science Vol. 2352, pp. 791-806
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31249
dc.subjectComputer Vision and Pattern Recognition
dc.subjectI.2.10; I.4.6; I.4.7; I.4.8; I.5.4
dc.titleProbabilistic Search for Object Segmentation and Recognition
dc.typetext

Files

Collections