Abstract. We provide criteria for deciding whether a given planar curve is an image of a given spatial curve, obtained by a central or a parallel projection with unknown parameters. These criteria reduce the projection problem to a certain modification of the equivalence problem of planar curves under affine and projective transformations. The latter problem can be addressed using Cartan’s moving frame method. This leads to a novel algorithmic solution of the projection problem for curves. The computational advantage of the algo-rithms presented here, in comparison to algorithms based on a straightforward solution, lies in a significant reduction of a number of real parameters that has to be eliminated in order to establish existence or non...
In this paper, we consider the problem of finding an optimal reconstruction from two views of a piec...
A new algorithm for pose determination of known arbitrary planar curves is presented. The method dir...
Recent research has shown that invariant indexing can speed up the recognition process in computer v...
Abstract. We present a novel algorithm for deciding whether a given planar curve is an image of a gi...
We present a novel algorithm for deciding whether a given planar curve is an image of a given spatia...
In this paper, we propose an algorithm for doing reconstruction of general 3D-curves from a number o...
In this paper, we extend the notion of affine shape, introduced by Sparr, from finite point sets to ...
In this paper, an algorithm for projective reconstruction of general 3D-curves from a number of its ...
Projective geometry is a standard mathematical tool for image-based 3D reconstruction. Most reconstr...
In this paper the problem of computing the point correspondences in a sequence of time-varying image...
LNCS v. 6454 is Proceedings of the 6th International Symposium, ISVC 2010, pt. 2In this paper, we pr...
This paper presents a linear algorithm for recovering 3D affine shape and motion from line correspon...
also in IEEE Workshop on Visual Motion, New Jersey, pages 249--254, 1991 [http://hal.inria.fr/inria-...
Abstract. We propose new robust classification algorithms for planar and spatial curves subjected to...
International audienceThe 3D reconstruction from projections and feature correspondence between proj...
In this paper, we consider the problem of finding an optimal reconstruction from two views of a piec...
A new algorithm for pose determination of known arbitrary planar curves is presented. The method dir...
Recent research has shown that invariant indexing can speed up the recognition process in computer v...
Abstract. We present a novel algorithm for deciding whether a given planar curve is an image of a gi...
We present a novel algorithm for deciding whether a given planar curve is an image of a given spatia...
In this paper, we propose an algorithm for doing reconstruction of general 3D-curves from a number o...
In this paper, we extend the notion of affine shape, introduced by Sparr, from finite point sets to ...
In this paper, an algorithm for projective reconstruction of general 3D-curves from a number of its ...
Projective geometry is a standard mathematical tool for image-based 3D reconstruction. Most reconstr...
In this paper the problem of computing the point correspondences in a sequence of time-varying image...
LNCS v. 6454 is Proceedings of the 6th International Symposium, ISVC 2010, pt. 2In this paper, we pr...
This paper presents a linear algorithm for recovering 3D affine shape and motion from line correspon...
also in IEEE Workshop on Visual Motion, New Jersey, pages 249--254, 1991 [http://hal.inria.fr/inria-...
Abstract. We propose new robust classification algorithms for planar and spatial curves subjected to...
International audienceThe 3D reconstruction from projections and feature correspondence between proj...
In this paper, we consider the problem of finding an optimal reconstruction from two views of a piec...
A new algorithm for pose determination of known arbitrary planar curves is presented. The method dir...
Recent research has shown that invariant indexing can speed up the recognition process in computer v...