Summary
International Technical Conference on Circuits/Systems, Computers and Communications
2008
Session Number:C3
Session:
Number:C3-3
Towards the Easy Manipulation of Graph-Based Content Representation of Multimedia Data
Teruhisa Hochin,
pp.-
Publication Date:2008/7/7
Online ISSN:2188-5079
Summary:
The contents of multimedia data has complex relationships including deeply nested whole-part and the many-to-many relationships. A data model incorporating the concepts of directed graphs, recursive graphs, and hypergraphs has been proposed for representing the contents of multimedia data. In this data model, an instance is represented with a directed recursive hypergraph called an {\it instance graph}. This paper studies on the characteristics of instance graphs. The depth of an edge of an instance graph is introduced. When the depth of an edge is equal to zero, the instance graph can be decomposed into sub-instance graphs. Decomposing instance graphs could make their treatment easy.