Kristen Grauman, Trevor Darrell  Home/Search
Context Related
| mit.edu/%7Ekgrauman...cvpr04_grauman.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mit.edu/~kgrauman/research (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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... (Update)
Cited by: More
Low-level Pedestrian Detection by means of - Visible And Far (2006) (Correct)
Indexing Spatially Sensitive Distance Measures - Using Multi-Resolution Lower (2006) (Correct)
LB-Index: A Multi-Resolution Index Structure for Images - Vebjorn Ljosa Arnab (2006) (Correct)
Active bibliography (related documents): More All
0.5: Inferring 3D Structure with a Statistical Image-Based.. - Grauman.. (2003) (Correct)
0.5: The Area of Overlap of two Unions of Convex Objects under.. - Mark De Berg (2003) (Correct)
0.2: Shape Contexts Enable Efficient Retrieval of Similar Shapes - Mori, Belongie, Malik (2001) (Correct)
Similar documents based on text:
0.1: The Berkeley FrameNet Project - Coilin Baker And (1998) (Correct)
Related documents from co-citation: More All
3: The earth mover's distance as a metric for image retrieval (context) - Rubner - 1998
3: Manyto -many feature matching using spherical coding of directed graphs - Demirci, Shokoufandeh et al. - 2004
2: Searching notated polyphonic music using transportation distances (context) - Typke, Veltkamp et al. - 2004
BibTeX entry: (Update)
K. Grauman K. and T. Darrell. Fast contour matching using approximate earth mover's distance. In Proc. IEEE Conf. on Comp. Vision and Pattern Recognition, pages 220--227. IEEE Computer Society, 2004. http://citeseer.ist.psu.edu/grauman04fast.html More
@misc{ grauman04fast,
author = "K. Grauman and K. Darrell",
title = "Fast contour matching using approximate earth mover's distance",
text = "K. Grauman K. and T. Darrell. Fast contour matching using approximate earth
mover's distance. In Proc. IEEE Conf. on Comp. Vision and Pattern Recognition,
pages 220--227. IEEE Computer Society, 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/grauman04fast.html" }
Citations (may not include all citations):76 Shape Matching and Object Recognition Using Shape Contexts - Belongie, Malik et al. - 2002
76 Similarity Search in High Dimensions via Hashing - Gionis, Indyk et al. - 1999
12 The Earth Mover's Distance under Transformation Sets - Cohen, Guibas - 1999
5 Boostmap: A Method for Efficient Approximate Similarity Rank.. - Athitsos, Alon et al. - 2004
4 Correspondence and Shape Based Categories (context) - Carlsson - 1998
2 A Pseudo-metric for Weighted Point Sets - Giannopoulos, Veltkamp - 2002
2 Poser 5 : The Ultimate 3D Character Solution (context) - Co - 2002
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC