相关论文: Two view constraints on the epipoles from few corr…

In many automation tasks involving manipulation of rigid objects, the poses of the objects must be acquired. Vision-based pose estimation using a single RGB or RGB-D sensor is especially popular due to its broad applicability. However,…

To reconstruct the points in three dimensional space, we need at least two images. In this paper we compared two different methods: the first uses only two images, the second one uses three. During the research we measured how camera…

We describe a method by which the number of intersections one ellipse makes inside the plane of another can be determined. The method is based on applying a transformation that reverts one ellipse to the unit circle, and examining the…

Considerable progress has recently been made in the development of techniques to exactly determine two-point resistances in networks of various topologies. In particular, two types of method have emerged. One is based on potentials and the…

We present a novel method to compute the relative pose of multi-camera systems using two affine correspondences (ACs). Existing solutions to the multi-camera relative pose estimation are either restricted to special cases of motion, have…

An $\epsilon$-approximate incidence between a point and some geometric object (line, circle, plane, sphere) occurs when the point and the object lie at distance at most $\epsilon$ from each other. Given a set of points and a set of objects,…

When matching parts of a surface to its whole, a fundamental question arises: Which points should be included in the matching process? The issue is intensified when using isometry to measure similarity, as it requires the validation of…

The problem to compute the vertices of a polytope given by affine inequalities is called vertex enumeration. The inverse problem, which is equivalent by polarity, is called the convex hull problem. We introduce `approximate vertex…

Affine transformations have been recently used for stereo vision. They can be exploited in various computer vision application, e.g., when estimating surface normals, homographies, fundamental and essential matrices. Even full 3D…

Finding correspondences between shapes is a fundamental problem in computer vision and graphics, which is relevant for many applications, including 3D reconstruction, object tracking, and style transfer. The vast majority of correspondence…

Correspondence is a ubiquitous problem in computer vision and graph matching has been a natural way to formalize correspondence as an optimization problem. Recently, graph matching solvers have included higher-order terms representing…

We present a conceptually simple and intuitive method to calculate and to measure the dissimilarities among 2D shapes. Several methods to interpret and to visualize the resulting dissimilarity matrix are presented and compared.

Meanders form a set of combinatorial problems concerned with the enumeration of self-avoiding loops crossing a line through a given number of points, $n$. Meanders are considered distinct up to any smooth deformation leaving the line fixed.…

We systematically compile an exhaustive catalogue of multiview varieties and anchored multiview varieties arising from projections of points and lines in 1, 2, and 3-dimensional projective space. We say that two such varieties are…

We present a new framework for multi-view geometry in computer vision. A camera is a mapping between $\mathbb{P}^3$ and a line congruence. This model, which ignores image planes and measurements, is a natural abstraction of traditional…

This paper presents a new method to recover the relative pose between two images, using three points and the vertical direction information. The vertical direction can be determined in two ways: 1- using direct physical measurement like IMU…

An end-to-end trainable ConvNet architecture, that learns to harness the power of shape representation for matching disparate image pairs, is proposed. Disparate image pairs are deemed those that exhibit strong affine variations in scale,…

We introduce an estimator for the curvature of curves and surfaces by using finite sample points drawn from sampling a probability distribution that has support on the curve or surface. First we give an algorithm for estimation of the…

This work studies fundamental limits for recovering the underlying correspondence among multiple correlated graphs. In the setting of inhomogeneous random graphs, we present and analyze a matching algorithm: first partially match the graphs…

The computation of the topology of a real algebraic plane curve is greatly simplified if there are no more than one critical point in each vertical line: the general position condition. When this condition is not satisfied, then a finite…