Tree Graph Recognition by Using Kernel Method

Mingming Zhang, Shinichiro Omachi

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)306-313
Number of pages8
JournalJournal of the Institute of Image Electronics Engineers of Japan
Volume40
Issue number2
DOIs
Publication statusPublished - 2011 Jan

Keywords

  • graph recognition
  • kernel method
  • silhouette image
  • structure analysis

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Tree Graph Recognition by Using Kernel Method'. Together they form a unique fingerprint.

Cite this