X hits on this document

97 views

0 shares

0 downloads

0 comments

33 / 54

UNR - Computer Vision Laboratory

Interpretation Trees (cont’d) (E. Grimson and T. Lozano-Perez, 1987)

Search space is very large (i.e., exponential number of matches).

Find consistent interpretations without exploring all possible ways of matching image and model features.

Use geometric constraints to “prune” the tree:

Unary constraints: properties of individual features (e.g., length/orientation of a line)

Binary constraints: properties of pairs of features (e.g., distance/angle between two lines)

Document info
Document views97
Page views97
Page last viewedFri Oct 28 23:45:19 UTC 2016
Pages54
Paragraphs437
Words2344

Comments