二维形状的透视不变性认别

在计算机视觉中,二维形状的识别有着十分重要的意义.为了实现二维形状的透视投影 不变性识别,本文推导出了一种共面二次曲线对的透视投影不变量,提出了一种基于椭圆的平 面曲线的透视不变性表示方法,并且给出了用该不变量和不变性表示方法实现二维形状识别 的算法.实验结果证实了该算法的有效性.     

计算射影与排列不变量的新方法

给出了一种表示和计算离散有限点集的射影与排列不变量的简单有效方法.该不变量在计算机视觉、模式识别中有重要应用.首先导出了射影直线上4个点的基于一种对称函数的射影与排列不变量,该不变量等于这4个点的某个原始交比值,具有计算量低,不丢失分辨力等优点.然后根据这个简单的对称函数,结合基本的多项式对称函数,推导出了平面上5个点的两个函数无关的射影与排列不变量,以及空间中6个点的3个函数无关的射影与排列不变量.     

Texture discrimination by projective invariants

We investigate the use of projective invariants for discriminating textured surfaces under projective transformation. A theorem is presented which shows that statistics of cross ratios of groups of four collinear points are a projective invariant. The distance between normalized vectors is used as the similarity measure for texture discrimination.     

Weighted Projective Spaces and a Generalization of Eves’ Theorem

For a certain class of configurations of points in space, Eves’ Theorem gives a ratio of products of distances that is invariant under projective transformations, generalizing the cross-ratio for four points on a line. We give a generalization of Eves’ theorem, which applies to a larger class of configurations and gives an invariant with values in a weighted projective space. We also show how the complex version of the invariant can be determined from classically known ratios of products of determinants, while the real version of the invariant can distinguish between configurations that the classical invariants cannot.     

General methods for determining projective invariants in imagery

This paper presents the results of a study of projective invariants and their applications in image analysis and object recognition. The familiar cross-ratio theorem, relating collinear points in the plane to the projections through a point onto a line, provides a starting point for their investigation. Methods are introduced in two dimensions for extending the cross-ratio theorem to relate noncollinear object points to their projections on multiple image lines. The development is further extended to three dimensions. It is well known that, for a set of points distributed in three dimensions, stereo pairs of images can be made and relative distances of the points from the film plane computed from measurements of the disparity of the image points in the stereo pair. These computations require knowledge of the effective focal length and baseline of the imaging system. It is less obvious, but true, that invariant metric relationships among the object points can be derived from measured relationships among the image points. These relationships are a generalization into three dimensions of the invariant cross-ratio of distances between points on a line. In three dimensions the invariants are cross-ratios of areas and volumes defined by the object points. These invariant relationships, which are independent of the parameters of the imaging system, are derived and demonstrated with examples.     

Fundamental limitations on projective invariants of planar curves

In this paper, some fundamental limitations of projective invariants of non-algebraic planar curves are discussed. It is shown that all curves within a large class can be mapped arbitrarily close to a circle by projective transformations. It is also shown that arbitrarily close to each of a finite number of closed planar curves there is one member of a set of projectively equivalent curves. Thus a continuous projective invariant on closed curves is constant. This also limits the possibility of finding so called projective normalisation schemes for closed planar curves     

Invariants of six points and projective reconstruction from threeuncalibrated images

There are three projective invariants of a set of six points in general position in space. It is well known that these invariants cannot be recovered from one image, however an invariant relationship does exist between space invariants and image invariants. This invariant relationship is first derived for a single image. Then this invariant relationship is used to derive the space invariants, when multiple images are available. This paper establishes that the minimum number of images for computing these invariants is three, and the computation of invariants of six points from three images can have as many as three solutions. Algorithms are presented for computing these invariants in closed form. The accuracy and stability with respect to image noise, selection of the triplets of images and distance between viewing positions are studied both through real and simulated images. Applications of these invariants are also presented. Both the results of Faugeras (1992) and Hartley et al. (1992) for projective reconstruction and Sturm's method (1869) for epipolar geometry determination from two uncalibrated images with at least seven points are extended to the case of three uncalibrated images with only six points     

Integral invariants for shape matching

For shapes represented as closed planar contours, we introduce a class of functionals which are invariant with respect to the Euclidean group and which are obtained by performing integral operations. While such integral invariants enjoy some of the desirable properties of their differential counterparts, such as locality of computation (which allows matching under occlusions) and uniqueness of representation (asymptotically), they do not exhibit the noise sensitivity associated with differential quantities and, therefore, do not require presmoothing of the input shape. Our formulation allows the analysis of shapes at multiple scales. Based on integral invariants, we define a notion of distance between shapes. The proposed distance measure can be computed efficiently and allows warping the shape boundaries onto each other; its computation results in optimal point correspondence as an intermediate step. Numerical results on shape matching demonstrate that this framework can match shapes despite the deformation of subparts, missing parts and noise. As a quantitative analysis, we report matching scores for shape retrieval from a database.     

Quantitative planar region detection

This paper presents a means of segmenting planar regions from two views of a scene using point correspondences. The initial selection of groups of coplanar points is performed on the basis of conservation of two five point projective invariants (groups for which this invariant is conserved are assumed to be coplanar). The five point correspondences are used to estimate a projectivity which is used to predict the change in position of other points assuming they lie on the same plane as the original four. The variance in any points new position is then used to define a distance threshold between actual and predicted position which is used as a coplanarity test to find extended planar regions. If two distinct planar regions can be found then a novel motion direction estimator suggests itself. The projection of the line of intersection of two planes in an image may also be recovered. An analytical error model is derived which relates image uncertainty in a corner's position to genuine perpendicular height of a point above a given plane in the world. The model may be used for example to predict the performance of given stereo ground plane prediction system or a monocular drivable region detection system on and AGV. The model may also be used in reverse to determine the camera resolution required if a vehicle in motion is to resolve obstacles of a given height a given distance from it.     

Projective Splines and Estimators for Planar Curves

Recognizing shapes in multiview imaging is still a challenging task, which usually relies on geometrical invariants estimations. However, very few geometric estimators that achieve projective invariance have been devised. This paper proposes a projective length and a projective curvature estimators for plane curves, when the curves are represented by points together with their tangent directions. In this context, the estimations can be performed with only three point-tangent samples for the projective length and five samples for the projective curvature. The proposed length and curvature estimator are based on projective splines built by fitting logarithmic spirals to the point-tangent samples. They are projective invariant and convergent.     

基于协方差矩阵的仿射不变量

为了对仿射变形的物体进行有效和正确的识别,构造了一种新的仿射不变量.构造的主要过程是：先计算图像的协方差矩阵,接着计算该矩阵的特征值和特征向量,再构造出一组同心椭圆,这些椭圆以图像质心为中心,以两个特征向量为长、短轴,且轴长和两个特征值的平方根成正比,进而利用图像紧化原理和仿射变换的有关性质推导出一组仿射不变量.文中将仿射不变量用于模式识别,获得很高的识别率.     

Projective invariants of co-moments of 2D images

Functions of moments of 2D images that are invariant under some changes are important in image analysis and pattern recognition. One of the most basic changes to a 2D image is geometric change. Two images of the same plane taken from different viewpoints are related by a projective transformation. Unfortunately, it is well known that geometric moment invariants for projective transformations do not exist in general. Yet if we generalize the standard definition of the geometric moments and utilize some additional information from the images, certain type of projective invariants of 2D images can be derived. This paper first defines co-moment as a moment-like function of image that contains two reference points. Then a set of functions of co-moments that is invariant under general projective transformations is derived. The invariants are simple and in explicit form. Experimental results validated the mathematical derivations.     

Application of the Fisher-Rao Metric to Ellipse Detection

The parameter space for the ellipses in a two dimensional image is a five dimensional manifold, where each point of the manifold corresponds to an ellipse in the image. The parameter space becomes a Riemannian manifold under a Fisher-Rao metric, which is derived from a Gaussian model for the blurring of ellipses in the image. Two points in the parameter space are close together under the Fisher-Rao metric if the corresponding ellipses are close together in the image. The Fisher-Rao metric is accurately approximated by a simpler metric under the assumption that the blurring is small compared with the sizes of the ellipses under consideration. It is shown that the parameter space for the ellipses in the image has a finite volume under the approximation to the Fisher-Rao metric. As a consequence the parameter space can be replaced, for the purpose of ellipse detection, by a finite set of points sampled from it. An efficient algorithm for sampling the parameter space is described. The algorithm uses the fact that the approximating metric is flat, and therefore locally Euclidean, on each three dimensional family of ellipses with a fixed orientation and a fixed eccentricity. Once the sample points have been obtained, ellipses are detected in a given image by checking each sample point in turn to see if the corresponding ellipse is supported by the nearby image pixel values. The resulting algorithm for ellipse detection is implemented. A multiresolution version of the algorithm is also implemented. The experimental results suggest that ellipses can be reliably detected in a given low resolution image and that the number of false detections can be reduced using the multiresolution algorithm.     

Calculating ellipse overlap areas

We present an approach for finding the overlap area between two ellipses that does not rely on proxy curves. The Gauss-Green formula is used to determine a segment area between two points on an ellipse. Overlap between two ellipses is calculated by combining the areas of appropriate segments and polygons in each ellipse. For four of the ten possible orientations of two ellipses, the method requires numerical determination of transverse intersection points. Approximate intersection points can be determined by solving the two implicit ellipse equations simultaneously. Alternative approaches for finding transverse intersection points are available using tools from algebraic geometry, e.g., based on solving an Eigen-problem that is related to companion matrices of the two implicit ellipse curves. Implementations in C of several algorithm options are analyzed for accuracy, precision and robustness with a range of input ellipses.     

On differential invariants of planar curves and recognizing partially occluded planar shapes

Viewing transformations like similarity, affine and projective maps may distort planar shapes considerably. However, it is possible to associate local invariant signature functions to smooth boundaries that enable recognition of distorted shapes even in the case of partial occlusion. The derivation of signature functions, generalizing the intrinsic curvature versus arc-length representation in the case of rigid motions in the plane, is based on differential invariants associated to viewing transformation.     

A Geometric Approach for the Theory and Applications of 3D Projective Invariants

A central task of computer vision is to automatically recognize objects in real-world scenes. The parameters defining image and object spaces can vary due to lighting conditions, camera calibration and viewing position. It is therefore desirable to look for geometric properties of the object which remain invariant under such changes in the observation parameters. The study of such geometric invariance is a field of active research. This paper presents the theory and computation of projective invariants formed from points and lines using the geometric algebra framework. This work shows that geometric algebra is a very elegant language for expressing projective invariants using n views. The paper compares projective invariants involving two and three cameras using simulated and real images. Illustrations of the application of such projective invariants in visual guided grasping, camera self-localization and reconstruction of shape and motion complement the experimental part.     

基于虚拟直线的单目视觉坐标测量模型研究

在摄像机位置随意固定和测量点共面的约束条件下,基于单目视觉提出了一种基于虚拟直线的单帧图像物点坐标测量的新算法。用几何方法代替常规代数方法,回避了传统的通过求解旋转矩阵和平移向量来获取摄像机位置和姿态参数的过程。利用直线平行、垂直的先验知识,通过空间共线四点经过射影变换的交比不变性得到目标点的位置坐标信息。实验证明：该方法简单、可行,摄像机位置随意摆放,具有很强的可操作性、实用性,且精度较高。     

基于射影不变量的摄像机自标定方法

为了方便而精确地进行摄像机标定,提出了一种基于射影不变量的求解摄像机内参数的方法,该方法利用交比在射影变换中不变的性质,通过同一平面中相交直线的无穷远点与虚圆点的交比,先求出同一模板的不同方位的3幅图像中的虚圆点的像;然后利用绝对二次曲线的像在摄像机做刚体运动时保持不变的性质,进而求出绝对二次曲线的像;最后对结果进行Cholesky分解,就可以得到摄像机的内参数。实验表明,该方法行之有效,可以达到较高的精度。