Fast contour matching using approximate earth mover's distance

@article{Grauman2004FastCM,
  title={Fast contour matching using approximate earth mover's distance},
  author={Kristen Grauman and Trevor Darrell},
  journal={Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004.},
  year={2004},
  volume={1},
  pages={I-I}
}
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matching between two shapes' features often reveals how similar the shapes are. However due to the complexity of computing the exact minimum cost matching, previous algorithms could only run efficiently when using a limited number of features per shape, and could not scale to perform retrievals from large databases. We… CONTINUE READING
Highly Cited
This paper has 270 citations. REVIEW CITATIONS
160 Citations
18 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 160 extracted citations

270 Citations

02040'02'05'09'13'17
Citations per Year
Semantic Scholar estimates that this publication has 270 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Fast image retrieval via embeddings

  • P. Indyk, N. Thaper
  • In Third International workshop on Statistical…
  • 2003
Highly Influential
6 Excerpts

AMethod for Efficient Approximate Similarity Rankings

  • S. Sclaroff, G. Kollios
  • 2004

Curious Labs. Poser 5 : The Ultimate 3D Character Solution

  • Egisys Co
  • 2002
1 Excerpt

High-Dimensional Computational Geometry

  • P. Indyk
  • PhD thesis, Stanford University,
  • 2000
1 Excerpt

Similar Papers

Loading similar papers…