摘要
A structural description of a pictorial graph called the vertex type connectivity partition description is proposed. The vertex type connectivity partition description captures the structural information embedded in a pictorial graph and can be used to build the knowledge base for the representation and recognition of pictorial graphs. We are interested in characterizing a graph as a whole, rather than its individual vertices.
| 原文 | ???core.languages.en_GB??? |
|---|---|
| 頁（從 - 到） | 98-101 |
| 頁數 | 4 |
| 期刊 | IEE Conference Publication |
| 發行號 | 307 |
| 出版狀態 | 已出版 - 1989 |
| 事件 | Third International Conference on Image Processing and its Applications - Coventry, Engl 持續時間: 18 7月 1989 → 20 7月 1989 |