Sciweavers

11 search results - page 3 / 3
» On the Hamming distance in combinatorial optimization proble...
Sort
View
EMMCVPR
2007
Springer
13 years 11 months ago
Efficient Shape Matching Via Graph Cuts
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...