Bipartite Graph Matching for Points on a Line or a Circle

By Michael Werman, Shmuel Peleg, R. Melter, T. Y. Kong. 1986

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Ofir Pele
2. Michael Werman
3. Relja Arandjelovi'c
4. Tilke Judd
5. Hema Swetha Koppula
6. Julian Chow
7. Yujia Xie
8. Andrew Zisserman

Citations in the corpus

• Fast and robust Earth Mover's Distances (2009, methodology): “Early work using cross-bin distances for histogram comparison can be found in [33, 39, 38, 28].”
• A Linear Time Histogram Metric for Improved SIFT Matching (2008, methodology): “Finally, we present experimental results for SIFT matching on the Mikolajczyk and Schmid dataset [2] showing that our method outperforms state of the art distances such as L2, EMD-L1 [20], diffusion distance [21] and EMDMOD [22, 23].”