PARTITIONING GRAPH MATCHING WITH CONSTRAINTS

被引：5
作者：
BLAKE, RE
机构：
[1] Department of Computer Systems and Telematics, University of Trondheim-NTH
来源：
PATTERN RECOGNITION | 1994年 / 27卷 / 03期
关键词：
GRAPH MATCHING; COMPUTER VISION; INFERENCE; LATTICE THEORY;
D O I：
10.1016/0031-3203(94)90120-1
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The partitioning of the graph matching problem into sub-problems under the control of constraints is considered. Scott lattice theory is suggested as a basis and the essential requirements on the data types and algorithms are stated. An example lattice of constraints is shown and a matching algorithm that partitions the matching problem is illustrated with an example.
引用
收藏
页码：439 / 446
页数：8
相关论文
共 9 条
1