科研之友
微信
新浪微博
Facebook
分享链接
摘要
A generalized polygon is an ordered set of vertices. This notion generalizes the concept of the boundary of a polygonal shape because self-intersections are allowed. In this paper we study the problem of matching generalized polygons under affine transformations. Our approach is based on invariants. Firstly we associate an ordered set of complex numbers with each polygon and construct a collection of complex scalar functions on the space of plane polygons. These invariant functions are defined as quotients of the so-called Fourier descriptors, also known as discrete Fourier transforms. Each one of these functions is invariant under similarity transformations; that is, the function associates the same complex number to similar polygons. Moreover, if two polygons are affine related (one of them is the image of the other under an affine transformation), the pseudo-hyperbolic distance between their associated values is a constant that depends only on the affine transformation involved, but independent of the polygons. More formally, given a collection {Z(1), Z(2),..., Z(m)} of n-sided polygons in the plane and a query polygon W, we give algorithms to find all Z(l) such that f (Z(l)) = W + Delta W, where f is an unknown affine transformation and Delta W = (Delta w(1),..., Delta w(n)) with vertical bar Delta w(k)vertical bar <= rho, where rho is certain tolerance.
- 出版日期2016-10
