A constraint satisfaction framework with bayesian inference for model-based object recognition

N/ACitations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A general (application independent) framework for the recognition of partially hidden 3-D objects in images is presented. It views the model-to-image matching as a constraint satisfaction problem (CSP) supported by Bayesian net-based evaluation of partial variable assignments. A modified incremental search for CSP is designed that allows partial solutions and calls for stochastic inference in order to provide judgments of partial states. Hence the detection of partial occlusion of objects is handled consistently with Bayesian inference over evidence and hidden variables. A particular problem of passing different objects to a machine by a human hand is solved while applying the general framework. The conducted experiments deal with the recognition of three objects: a simple cube, a Rubik cube and a tea cup. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kasprzak, W., Czajka, Ł., & Wilkowski, A. (2010). A constraint satisfaction framework with bayesian inference for model-based object recognition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6375 LNCS, pp. 1–8). https://doi.org/10.1007/978-3-642-15907-7_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free