Related papers: Object-image correspondence for curves under proje…
This paper presents a generalization to image matching of the Hamiltonian approach for planar curve matching developed in the context of group of diffeomorphisms. We propose an efficient framework to deal with discontinuous images in any…
We show that it is possible to decide whether a given planar diagram correctly depicts the spatial figure consisting of a planar quadrangle together with its shadow in another plane.
This paper presents the first purely numerical (i.e., non-algebraic) subdivision algorithm for the isotopic approximation of a simple arrangement of curves. The arrangement is "simple" in the sense that any three curves have no common…
Change detection is one of the most challenging issues when analyzing remotely sensed images. Comparing several multi-date images acquired through the same kind of sensor is the most common scenario. Conversely, designing robust, flexible…
Given a non-rational real space curve and a tolerance $\epsilon>0$, we present an algorithm to approximately parametrize the curve. The algorithm checks whether a planar projection of the space curve is $\epsilon$-rational and, in the…
Face recognition is a popular application of pat- tern recognition methods, and it faces challenging problems including illumination, expression, and pose. The most popular way is to learn the subspaces of the face images so that it could…
In this paper, we introduce a new method for classifying 3D objects. Our main idea is to project a 3D object onto a spherical domain centered around its barycenter and develop neural network to classify the spherical projection. We…
We present a method to match three dimensional shapes under non-isometric deformations, topology changes and partiality. We formulate the problem as matching between a set of pair-wise and point-wise descriptors, imposing a continuity prior…
ConicCurv is a new derivative-free algorithm to estimate the curvature of a plane curve from a sample of data points. It is based on a known tangent estimator method grounded on classic results of Projective Geometry and B\'ezier rational…
This paper is devoted to the investigation of selected situations when the computation of projective (and other) equivalences of algebraic varieties can be efficiently solved with the help of finding projective equivalences of finite sets…
In this paper, we present a multi-object 6D detection and tracking pipeline for potentially similar and non-textured objects. The combination of a convolutional neural network for object classification and rough pose estimation with a local…
With the explosive growth of web-based cameras and mobile devices, billions of photographs are uploaded to the internet. We can trivially collect a huge number of photo streams for various goals, such as 3D scene reconstruction and other…
Object tracking is a key aspect in many applications such as augmented reality in medicine (e.g. tracking a surgical instrument) or robotics. Squared planar markers have become popular tools for tracking since their pose can be estimated…
We present a new method for visualizing implicit real algebraic curves inside a bounding box in the $2$-D or $3$-D ambient space based on numerical continuation and critical point methods. The underlying techniques work also for tracing…
Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics, which is for example relevant for tasks like shape interpolation, pose transfer, or texture transfer. An often neglected but essential property…
AR/VR applications and robots need to know when the scene has changed. An example is when objects are moved, added, or removed from the scene. We propose a 3D object discovery method that is based only on scene changes. Our method does not…
6D pose estimation is a central problem in robot vision. Compared with pose estimation based on point correspondences or its robust versions, correspondence-free methods are often more flexible. However, existing correspondence-free methods…
The aim of this paper is to present a new method of approximation of planar data set using only arcs or segments. The first problem we are trying to solve is the following: the CNC machines can work only with simple curves (arcs or…
This paper presents a novel image-based path planning algorithm that was developed using computer vision techniques, as well as its comparative analysis with well-known deterministic and probabilistic algorithms, namely A* and Probabilistic…
Let $k$ be an arbitrary field, and C be a curve in A^n defined parametrically by x_1=f_1(t),...,x_n=f_n(t), where f_1,...,f_n\in k[t]. A necessary and sufficient condition for the two function fields k(t) and k(f_1,...,f_n) to be same is…