37 search results - page 1 / 8 » On Solving 2D and 3D Puzzles Using Curve Matching |
CVPR
2001
IEEE
14 years 6 months ago
2001
IEEE
We approach the problem of 2-D and 3-D puzzle solving by matching the geometric features of puzzle pieces three at a time. First, we define an affinity measure for a pair of piece...
CAINE
2008
13 years 6 months ago
2008
This paper describes an algorithm that pieces together 2D fragments of an object. Matching fragments of an object is useful for solving puzzles or reassembling archaeological frag...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We propose new robust classification algorithms for planar and spatial curves subjected to affine transformations. Our motivation comes from the problems in computer image recognit...
MMM
2003
Springer
13 years 9 months ago
2003
Springer
Computer animation is one of the key components of a multimedia document or presentation. Shape transformation between objects of different topology and positions is an open model...
PAMI
2007
13 years 4 months ago
2007
—This paper presents a new affine-invariant matching algorithm based on B-Spline modeling, which solves the problem of the nonuniqueness of B-Spline in curve matching. This metho...