Structural matching by discrete relaxation

Richard C. Wilson1, Edwin R. Hancock2
1Dept. of Comput. Sci., York Univ., UK#TAB#
2University of York, York, UK

Tóm tắt

Từ khóa


Tài liệu tham khảo

10.1109/34.400565

10.1109/34.121788

10.1109/TPAMI.1981.4767164

10.1016/S0031-3203(96)00060-X

10.1109/72.265956

10.1109/ICPR.1994.576907

10.1109/TPAMI.1985.4767707

10.1016/0167-8655(95)00115-8

10.1109/ICCV.1995.466905

10.1016/0262-8856(95)99728-J

10.1109/34.134040

10.1109/TPAMI.1984.4767596

10.1007/3-540-62909-2_85

10.1088/0305-4470/19/16/017

10.1109/34.67642

10.1016/0031-3203(90)90094-2

gold, 1996, a graduated assignment algorithm for graph matching, IEEE Trans Pattern Analysis and Machine Intelligence, 18, 377, 10.1109/34.491619

10.1016/0166-218X(94)90211-9

glover, 1995, genetic algorithms and tabu search—hybrids for optimization, Discrete Applied Mathematics, 49, 111

10.1109/CVPR.1993.340965

10.1109/ICNN.1993.298580

10.1109/34.42855

messmer, 1994, efficient error-tolerant subgraph isomorphism detection, Shape Structure and Pattern Recognition, 231

10.1016/0262-8856(96)01093-1

10.1109/34.75511

10.1109/34.3880

10.1109/TSMC.1983.6313167

10.1016/0020-0190(76)90049-1

10.1109/TSMC.1976.4309519

barrow, 1971, relational descriptions in picture processing, Machine Intelligence, 6, 377

10.1109/TPAMI.1981.4767144

10.1109/34.385984

10.1162/neco.1991.3.2.268

10.1109/TPAMI.1985.4767621

10.1016/0031-3203(94)00166-J