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...
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...
Catherine Stringfellow, Richard Simpson, H. Bui, Y...
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...
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...
Galina Pasko, Alexander A. Pasko, M. Ikeda, Tosiya...
—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...