-
1
-
-
3142669879
-
Subgraph isomorphism, matching relational structures and maximal cliques
-
H. G. Barrow and R. M. Burstall, Subgraph isomorphism, matching relational structures and maximal cliques, Inf. Proc. Letter, Vol. 4, pp.83, 84, 1976.
-
(1976)
Inf. Proc. Letter
, vol.4
-
-
Barrow, H.G.1
Burstall, R.M.2
-
2
-
-
0033893388
-
Mean and maximum common subgraph of two graphs
-
H. Bunke and A. Kandel, Mean and maximum common subgraph of two graphs, Pattern Recognition Letters, Vol. 21, pp. 163-168, 2000.
-
(2000)
Pattern Recognition Letters
, vol.21
, pp. 163-168
-
-
Bunke, H.1
Kandel, A.2
-
3
-
-
0029182228
-
Active shape models - their training and application
-
T. F. Cootes, C. J. Taylor, and D. H. Cooper, Active shape models - their training and application, CVIU, Vol. 61, pp. 38-59, 1995.
-
(1995)
CVIU
, vol.61
, pp. 38-59
-
-
Cootes, T.F.1
Taylor, C.J.2
Cooper, D.H.3
-
4
-
-
0032310568
-
Wormholes in shape space: Tracking through discontinuous changes in shape
-
T. Heap and D. Hogg, Wormholes in shape space: tracking through discontinuous changes in shape, ICCV, pp. 344-349, 1998.
-
(1998)
ICCV
, pp. 344-349
-
-
Heap, T.1
Hogg, D.2
-
5
-
-
0034857373
-
Recognition of shapes by editing shock graphs
-
T. Sebastian, P. Klein, and B. Kimia, Recognition of shapes by editing shock graphs, in ICCV, Vol. 1, pp. 755-762, 2001.
-
(2001)
ICCV
, vol.1
, pp. 755-762
-
-
Sebastian, T.1
Klein, P.2
Kimia, B.3
-
6
-
-
0035683532
-
Clustering shock trees
-
B. Luo, et al., Clustering shock trees, in CVPR, Vol 1, pp. 912-919, 2001.
-
(2001)
CVPR
, vol.1
, pp. 912-919
-
-
Luo, B.1
-
7
-
-
0033220897
-
Matching hierarchical structures using association graphs
-
M. Pelillo, K. Siddiqi, and S. W. Zucker, Matching hierarchical structures using association graphs, PAMI, Vol. 21, pp. 1105-1120, 1999.
-
(1999)
PAMI
, vol.21
, pp. 1105-1120
-
-
Pelillo, M.1
Siddiqi, K.2
Zucker, S.W.3
-
8
-
-
0029322345
-
Modal matching for correspondence and recognition
-
S. Sclaroff and A. P. Pentland, Modal matching for correspondence and recognition, PAMI, Vol. 17, pp. 545-661, 1995.
-
(1995)
PAMI
, vol.17
, pp. 545-661
-
-
Sclaroff, S.1
Pentland, A.P.2
-
9
-
-
0033323113
-
Shock graphs and shape matching
-
K. Siddiqi et al., Shock graphs and shape matching, Int. J. of Comp. Vision, Vol. 35, pp. 13-32, 1999.
-
(1999)
Int. J. Of Comp. Vision
, vol.35
, pp. 13-32
-
-
Siddiqi, K.1
-
10
-
-
84958634610
-
Efficiently computing weighted tree edit distance using relaxation labeling
-
A. Torsello and E. R. Hancock, Efficiently computing weighted tree edit distance using relaxation labeling, in EMMCVPR, LNCS 2134, pp. 438-453, 2001
-
(2001)
EMMCVPR, LNCS 2134
, pp. 438-453
-
-
Torsello, A.1
Hancock, E.R.2
-
11
-
-
0000307499
-
On the editing distance between unorderes labeled trees
-
K. Zhang, R. Statman, and D. Shasha, On the editing distance between unorderes labeled trees, Inf. Proc. Letters, Vol. 42, pp. 133-139, 1992.
-
(1992)
Inf. Proc. Letters
, vol.42
, pp. 133-139
-
-
Zhang, K.1
Statman, R.2
Shasha, D.3
|