An And-Or graph is a 6-tuple for representing an image grammar G
where S is a root node for a scene or object category, V N is a set of non-terminal nodes including an And-node set and an Or-node set, V T is a set of terminal nodes for primitives, parts and objects, R is a number of relations between the nodes, Σ is the set of all valid configurations derivable from the grammar, and P is the probability model defined on the And-Or graph.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this entry
Cite this entry
(2009). And-Or Graph. In: Li, S.Z., Jain, A. (eds) Encyclopedia of Biometrics. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-73003-5_879
Download citation
DOI: https://doi.org/10.1007/978-0-387-73003-5_879
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-73002-8
Online ISBN: 978-0-387-73003-5
eBook Packages: Computer ScienceReference Module Computer Science and Engineering