FORMAL DEFINITION AND ENTROPY CALCULATION OF HIERARCHICAL ATTRIBUTED RANDOM GRAPH

For the representation of a complex object, the object is decomposed into several parts, and it is described by these decomposed parts and their relations. In general, the parts can be the primitive elements that can not be decomposed further, or still can be decomposed into their subparts. Therefore, the hierarchical description method is very natural and the hierarchical description is represented by a hicrarchical graph whose vertices represent either primitive elements or graphs. These graphs also have vertices which contain primitive elements or graphs. When some uncertainty exists in the hierarchical description of a complex object either due to noise or minor deformation, a probabilistic description of the object ensemble is necessary. For this purpose, in this paper, we formally define the hierarchical attributed random graph and derive the equations fo the entropy calculation of the hierarchical random graph.
Publisher
ELSEVIER SCIENCE BV
Issue Date
1992-08
Language
ENG
Keywords

RECOGNITION

Citation

PATTERN RECOGNITION LETTERS, v.13, no.8, pp.545 - 555

ISSN
0167-8655
DOI
10.1016/0167-8655(92)90089-I
URI
http://hdl.handle.net/10203/66069
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
  • Hit : 98
  • Download : 0
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 2 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0