Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 98-101 |
| Number of pages | 4 |
| Journal | IEE Conference Publication |
| Issue number | 307 |
| State | Published - 1989 |
| Event | Third International Conference on Image Processing and its Applications - Coventry, Engl Duration: 18 Jul 1989 → 20 Jul 1989 |