Tree Graph Recognition by Using Kernel Method
-
- ZHANG Mingming
- Graduate School of Engineering, Tohoku University
-
- OMACHI Shinichiro
- Graduate School of Engineering, Tohoku University
Bibliographic Information
- Other Title
-
- カーネル法による木グラフの識別
- カーネルホウ ニ ヨル キグラフ ノ シキベツ
Search this article
Abstract
In pattern recognition, graphs are usually used to represent the features of objects due to their richer representability than feature vectors. However, some disadvantages limit the development of graph pattern recognition, such as there is few classsifier that can be used on graph patterns and the crucial method of graph matching has a high computational complexity. In this paper, we focus on the structure analysis of tree graphs. By defining the propagations of probability among graph structures, we propose a kernel method for tree graphs with no graph matching. The experimental results with the tree graph representation of silhouette images confirm the effectiveness of the proposed method.
Journal
-
- The Journal of the Institute of Image Electronics Engineers of Japan
-
The Journal of the Institute of Image Electronics Engineers of Japan 40 (2), 306-313, 2011
The Institute of Image Electronics Engineers of Japan
- Tweet
Details 詳細情報について
-
- CRID
- 1390282679589031680
-
- NII Article ID
- 130004437954
- 10028158382
-
- NII Book ID
- AN00041650
-
- ISSN
- 13480316
- 02859831
-
- NDL BIB ID
- 11091745
-
- Text Lang
- ja
-
- Data Source
-
- JaLC
- NDL
- CiNii Articles
-
- Abstract License Flag
- Disallowed