Sciweavers

2843 search results - page 107 / 569
» On Efficient Spatial Matching
Sort
View
141
Voted
IJCV
2008
157views more  IJCV 2008»
15 years 3 months ago
Pairwise Matching of 3D Fragments Using Cluster Trees
Abstract We propose a novel and efficient surface matching approach for reassembling broken solids as well as for matching assembly components using cluster trees of oriented point...
Simon Winkelbach, Friedrich M. Wahl
CVPR
2003
IEEE
16 years 5 months ago
Many-to-Many Graph Matching via Metric Embedding
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
Yakov Keselman, Ali Shokoufandeh, M. Fatih Demirci...
119
Voted
CORR
2010
Springer
80views Education» more  CORR 2010»
15 years 3 months ago
Many-to-Many Graph Matching: a Continuous Relaxation Approach
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
ECEASST
2006
96views more  ECEASST 2006»
15 years 3 months ago
Optimizing Pattern Matching Compilation by Program Transformation
Motivated by the promotion of rewriting techniques and their use in major industrial applications, we have designed Tom: a pattern matching layer on top of conventional programming...
Emilie Balland, Pierre-Etienne Moreau
126
Voted
CVPR
2007
IEEE
16 years 5 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell