Sciweavers

591 search results - page 2 / 119
» Compatible Geometric Matchings
Sort
View
CVPR
2012
IEEE
12 years 1 months ago
Jigsaw Puzzles with Pieces of Unknown Orientation
This paper introduces new types of square-piece jigsaw puzzles: those for which the orientation of each jigsaw piece is unknown. We propose a tree-based reassembly that greedily me...
Andrew Gallagher
ICCV
2009
IEEE
14 years 10 months ago
Subspace matching: Unique solutions to point matching with geometric constraints
Finding correspondences between feature points is one of the most relevant problems in the whole set of visual tasks. In this paper we address the problem of matching a feature ...
Manuel Marques, Marko Stosic and Joao Costeira
VIS
2004
IEEE
139views Visualization» more  VIS 2004»
14 years 6 months ago
Compatible Triangulations of Spatial Decompositions
We describe a general algorithm to produce compatible 3D triangulations from spatial decompositions. Such triangulations match edges and faces across spatial cell boundaries, solv...
Berk Geveci, Mathieu Malaterre, William J. Schroed...
COMPGEOM
1999
ACM
13 years 9 months ago
Geometric Pattern Matching: A Performance Study
In this paper, we undertake a performance study of some recent algorithms for geometric pattern matching. These algorithms cover two general paradigms for pattern matching; alignm...
Martin Gavrilov, Piotr Indyk, Rajeev Motwani, Sure...
ICPR
2000
IEEE
14 years 6 months ago
Robust Dense Matching Using Local and Global Geometric Constraints
A new robust dense matching algorithm is introduced in this paper. The algorithm starts from matching the most textured points, then a match propagation algorithm is developed wit...
Maxime Lhuillier, Long Quan