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

Given a finite set of arbitrarily distributed points in affine space with arbitrary multiplicity structures, we present an algorithm to compute the reduced Groebner basis of the vanishing ideal under the lexicographic ordering. Our method…

The deep-learning based image matching networks can now handle significantly larger variations in viewpoints and illuminations while providing matched pairs of pixels with sub-pixel precision. These networks have been trained with…

We study the set of image tuples arising from fixed cameras observing varying planar 3-dimensional point configurations. We derive a formula for the number of complex critical points of the triangulation problem, which seeks to reconstruct…

We propose three novel solvers for estimating the relative pose of a multi-camera system from affine correspondences (ACs). A new constraint is derived interpreting the relationship of ACs and the generalized camera model. Using the…

In this paper we study geometric coincidence problems in the spirit of the following problems by B. Gr\"unbaum: How many affine diameters of a convex body in $\mathbb R^n$ must have a common point? How many centers (in some sense) of…

Given a set of points in the plane, we want to establish a connection network between these points that consists of several disjoint layers. Motivated by sensor networks, we want that each layer is spanning and plane, and that no edge is…

Adjacency between two vertices in graphs or hypergraphs is a pairwise relationship. It is redefined in this article as 2-adjacency. In general hypergraphs, hyperedges hold for $n$-adic relationship. To keep the $n$-adic relationship the…

We show that distances of objects at cosmological distances can be measured directly using interferometry. Our approach to interferometric parallax comes from analysis of 4-point amplitude and intensity correlations that can be generated…

We consider the problem of finding the minimal number of points required to intersect all lines in an affine space over the finite field of order 3. We also consider the problem of finding the minimal number of points required to intersect…

A common approach to localize 3D human joints in a synchronized and calibrated multi-view setup consists of two-steps: (1) apply a 2D detector separately on each view to localize joints in 2D, and (2) perform robust triangulation on 2D…

We develop a deep architecture to learn to find good correspondences for wide-baseline stereo. Given a set of putative sparse matches and the camera intrinsics, we train our network in an end-to-end fashion to label the correspondences as…

Affine correspondences have received significant attention due to their benefits in tasks like image matching and pose estimation. Existing methods for extracting affine correspondences still have many limitations in terms of performance;…

Many real world person-person or person-product relationships can be modeled graphically. More specifically, bipartite graphs can be especially useful when modeling scenarios that involve two disjoint groups. As a result, many existing…

We revisit Hopcroft's problem and related fundamental problems about geometric range searching. Given $n$ points and $n$ lines in the plane, we show how to count the number of point-line incidence pairs or the number of point-above-line…

Relative pose estimation, a fundamental computer vision problem, has been extensively studied for decades. Existing methods either estimate and decompose the essential matrix or directly estimate the rotation and translation to obtain the…

Computing the dispersion relation for two-dimensional photonic crystals is a notoriously challenging task: It involves solving parameterized Helmholtz eigenvalue problems with high-contrast coefficients. To resolve the challenge, we propose…

In random cellular systems, both observation and maximum entropy inference give a specific form to the topological pair correlation: it is bi-affine in the cells number of edges with coefficients depending on the distance between the two…

In this paper, we adapt the two topological numbers, which have been proposed to efficiently characterize simple points in specific neighborhoods for 3D binary images, to the case of 2D binary images. Unlike the 3D case, we only use a…

When considering geometry, one might think of working with lines and circles on a flat plane as in Euclidean geometry. However, doing geometry in other spaces is possible, as the existence of spherical and hyperbolic geometry demonstrates.…

A frequent task in exploratory data analysis consists in examining pairwise dependencies between data variables. Popular approaches include visualizing correlation or scatter plot matrices. However, both methods can be misleading. The…