Definition of hierarchcal attributed random graph and its application to computer vision and machine learning계층적 속성 랜덤 그래프의 정의와 컴퓨터 비젼 및 기계학습에의 응용

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 492
  • Download : 0
An attributed graph was defined to represent both sturctural and semantic information contained in structural objects. When uncertainty exists in descrption of a structural object either due to noise or minor deformation, a probabilistic description of the object ensemble is necessary. For this purpose, we define an attributed random graph, which can be considered as a generalization of conventional ones, to include multiple attributes as well as numeric attribute instead of a single nominal attribute in random vertices and edges. Then, we derived the equations for an entropy of a random graph to reflect the variability of the 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 hierarchical graph whose vertices represent either primitive elements or graphs. This 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 of minor deformation, a probabilistic desdription of the object ensemble is also necessary. For this purpose, we formally define the hierarchical attributed random graph and derive the equations for the entropy calculation of the hierarchical random graph. We adopt this concepts to three parts to computer vision and machine learning such as incremental clustering of attributed graphs, optimal isomorphism between two random graphs and optimal isomorphism between two hierarchical attributed graphs. First, we introduce an incremental clustering system to group the patterns represented by attributed graphs as an application example. The purpose of this system is to take a succ...
Advisors
Park, Kyu-Horesearcher박규호researcher
Description
한국과학기술원 : 전기 및 전자공학과,
Publisher
한국과학기술원
Issue Date
1992
Identifier
60514/325007 / 000875200
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전기 및 전자공학과, 1992.8, [ xi, 165 p. ]

URI
http://hdl.handle.net/10203/35695
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=60514&flag=dissertation
Appears in Collection
EE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0