Sciweavers

ACCV
2007
Springer
13 years 12 months ago
Accelerating Pattern Matching or How Much Can You Slide?
This paper describes a method that accelerates pattern matching. The distance between a pattern and a window is usually close to the distance of the pattern to the adjacement windo...
Ofir Pele, Michael Werman
ECCV
2008
Springer
14 years 7 months ago
A Linear Time Histogram Metric for Improved SIFT Matching
We present a new metric between histograms such as SIFT descriptors and a linear time algorithm for its computation. It is common practice to use the L2 metric for comparing SIFT d...
Ofir Pele, Michael Werman
ICCV
2009
IEEE
14 years 10 months ago
Fast and Robust Earth Mover's Distances
We present a new algorithm for a robust family of Earth Mover’s Distances - EMDs with thresholded ground distances. The algorithm transforms the flow-network of the EMD so that t...
Ofir Pele , Michael Werman