331 search results - page 11 / 67 » Fast Matching for All Pairs Similarity Search |
EUROGRAPHICS
2010
Eurographics
15 years 6 months ago
2010
Eurographics
This paper challenges the difficult problem of automatic semantic correspondence between two given shapes which are semantically similar but possibly geometrically very different...
ICMCS
2006
IEEE
15 years 3 months ago
2006
IEEE
Block-matching motion estimation plays an important role in video coding and faster, more robust and more effective search algorithms are needed. Recently, a great number of fast ...
149
Voted
VLDB
2002
ACM
15 years 9 months ago
2002
ACM
Abstract. We propose an indexing technique for the fast retrieval of objects in 2D images based on similarity between their boundary shapes. Our technique is robust in the presence...
ICCV
2007
IEEE
15 years 4 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
110
Voted
BMCBI
2007
14 years 9 months ago
2007
Background: Protein structural data has increased exponentially, such that fast and accurate tools are necessary to access structure similarity search. To improve the search speed...