Bibliography

1

R. Agarwala, V. Bafna, M. Farach, M. Paterson, and M. Thorup.
On the approximability of numerical taxonomy (fitting distances by tree metrics).
SIAM Journal on Computing, 28(2):1073-1085, 1999.

2

S. Belongie, J. Malik, and J. Puzicha.
Shape matching and object recognition using shape contexts.
IEEE PAMI, 24(4):509-522, April 2002.

3

R. Beveridge and E. M. Riseman.
How easy is matching 2D line models using local search?
IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(6):564-579, June 1997.

4

P. Buneman.
The recovery of trees from measures of dissimilarity.
In F. Hodson, D. Kendall, and P. Tautu, editors, Mathematics in the Archaeological and Historical Sciences, pages 387-395. Edinburgh University Press, Edinburgh, 1971.

5

S. D. Cohen and L. J. Guibas.
The earth mover's distance under transformation sets.
In Proceedings, 7th International Conference on Computer Vision, pages 1076-1083, Kerkyra, Greece, 1999.

6

J. H. Conway and N. J. A. Sloane.
Sphere Packing, Lattices and Groups.
Springer-Verlag, New York, 1998.

7

F. Demirci, A. Shokoufandeh, Y. Keselman, S. Dickinson, and L. Bretzner.
Many-to-many matching of scale-space feature hierarchies using metric embedding.
In Scale Space Methods in Computer Vision, 4th International Conference, pages 17-32, Isle of Skye, UK, June, 10-12 2003.

8

A. Gupta.
Embedding tree metrics into low dimensional euclidean spaces.
In Proceedings of the thirty-first annual ACM symposium on Theory of computing, pages 694-700, 1999.

9

P. Indyk.
Algorithmic aspects of geometric embeddings.
In Proceedings, 42nd Annual Symposium on Foundations of Computer Science, 2001.

10

Y. Keselman, A. Shokoufandeh, F. Demirci, and S. Dickinson.
Many-to-many graph matching via low-distortion embedding.
In Proceedings, IEEE Conference on Computer Vision and Pattern Recognition, Madison, WI, June 2003.

11

S. Kosinov and T. Caelli.
Inexact multisubgraph matching using graph eigenspace and clustering models.
In Proceedings of SSPR/SPR, volume 2396, pages 133-142. Springer, 2002.

12

T.-L. Liu and D. Geiger.
Approximate tree matching and shape similarity.
In Proceedings, 7th International Conference on Computer Vision, pages 456-462, Kerkyra, Greece, 1999.

13

J. Matousek.
On embedding trees into uniformly convex Banach spaces.
Israel Journal of Mathematics, 237:221-237, 1999.

14

B. Messmer and H. Bunke.
Efficient error-tolerant subgraph isomorphism detection.
In D. Dori and A. Bruckstein, editors, Shape, Structure and Pattern Recognition, pages 231-240. World Scientific Publ. Co., 1995.

15

R. Myers, R. Wilson, and E. Hancock.
Bayesian graph edit distance.
IEEE PAMI, 22(6):628-635, 2000.

16

Y. Rubner, C. Tomasi, and L. J. Guibas.
The earth mover's distance as a metric for image retrieval.
International Journal of Computer Vision, 40(2):99-121, 2000.

17

G. Scott and H. Longuet-Higgins.
An algorithm for associating the features of two patterns.
Proceedings of Royal Society of London, B244:21-26, 1991.

18

T. Sebastian, P. Klein, and B. Kimia.
Recognition of shapes by editing shock graphs.
In IEEE International Conference on Computer Vision, pages 755-762, 2001.

19

A. Shokoufandeh, S.J. Dickinson, C. Jönsson, L. Bretzner, and T. Lindeberg.
On the representation and matching of qualitative shape at multiple scales.
In Proceedings, 7th European Conference on Computer Vision, volume 3, pages 759-775, 2002.

20

K. Siddiqi, A. Shokoufandeh, S. Dickinson, and S. Zucker.
Shock graphs and shape matching.
International Journal of Computer Vision, 30:1-24, 1999.