Fitting line projections in non-central catadioptric cameras with revolution symmetry

Line-images in non-central cameras contain much richer information of the original 3D line than line projections in central cameras. The projection surface of a 3D line in most catadioptric non-central cameras is a ruled surface, encapsulating the complete information of the 3D line. The resulting line-image is a curve which contains the 4 degrees of freedom of the 3D line. That means a qualitative advantage with respect to the central case, although extracting this curve is quite difficult. In this paper, we focus on the analytical description of the line-images in non-central catadioptric systems with symmetry of revolution. As a direct application we present a method for automatic line-image extraction for conical and spherical calibrated catadioptric cameras. For designing this method we have analytically solved the metric distance from point to line-image for non-central catadioptric systems. We also propose a distance we call effective baseline measuring the quality of the reconstruction of a 3D line from the minimum number of rays. This measure is used to evaluate the different random attempts of a robust scheme allowing to reduce the number of trials in the process. The proposal is tested and evaluated in simulations and with both synthetic and real images

Konforme geometrische Algebra und deren Anwendungen auf stochastische Optimierungsprobleme im Bereich 3D-Vision

In the present work, the modeling capabilities of conformal geometric algebra (CGA) are harnessed to approach typical problems from the research field of 3D-vision. This increasingly popular methodology is then extended in a new fashion by the integration of a least squares technique into the framework of CGA. Specifically, choosing the linear Gauss-Helmert model as the basis, the most general variant of least squares adjustment can be brought into operation. The result is a new versatile parameter estimation, termed GH-method, that reconciles two different mathematical areas, that is algebra and stochastics, under the umbrella of geometry. The main concern of the thesis is to show up the advantages inhering with this combination. Monocular pose estimation, from the subject 3D-vision, is the applicational focus of this thesis; given a picture of a scene, position and orientation of the image capturing vision system with respect to an external coordinate system define the pose. The developed parameter estimation technique is applied to different variants of this problem. Parameters are encoded by the algebra elements, called multivectors. They can be geometric objects as a circle, geometric operators as a rotation or likewise the pose. In the conducted pose experiments, observations are image pixels with associated uncertainties. The high accuracy achieved throughout all experiments confirms the competitiveness of the proposed estimation technique. Central to this work is also the consideration of omnidirectional vision using a paracatadioptric imaging sensor. It is demonstrated that CGA provides the ideal framework to model the related image formation. Two variants of the perspective pose estimation problem are adapted to the omnidirectional case. A new formalization of the epipolar geometry of two images in terms of CGA is developed, from which new insights into the structures behind the essential and the fundamental matrix, respectively, are drawn. Renowned standard approaches are shown to implicitly make use of CGA. Finally, an invocation of the GH-method for estimating epipoles is presented. Experimental results substantiate the goodness of this approach. Next to the detailed elucidations on parameter estimation, this text also gives a comprehensive introduction to geometric algebra, its tensor representation, the conformal space and the respective conformal geometric algebra. A valuable contribution is especially the analytic investigation into the geometric capabilities of CGA.Die vorliegende Arbeit ist motiviert durch die im Forschungszweig Computer Vision (CV) der Informatik typisch auftretenden geometrischen Problemstellungen auf der Grundlage von digitalen Bildaufnahmen. Hierzu zählt die Berechnung einer optimal durch eine Menge von Bildpunkten verlaufende Kurve, die Bestimmung der Epipolargeometrie, das Schätzen der Pose eines Objektes oder die 3D-Rekonstruktion. Diese Klasse von Problemen lässt sich durch den Einsatz der geometrischen Algebra (GA) – so werden unter geometrischen Aspekten besonders interessante Clifford Algebren bezeichnet – in überaus prägnanter und geschlossener Form modellieren. Dieser mit wachsender Akzeptanz verfolgte Ansatz, der beständig durch den Lehrstuhl „Kognitive Systeme“ der Universität Kiel weiterentwickelt wird, ist zentraler Bestandteile der Dissertation. Speziell wird die „konforme geometrische Algebra“ (CGA), die auf einer nicht-linearen Einbettung des euklidischen 3D-Raumes in einen fünfdimensionalen projektiven konformen Raum beruht, eingesetzt. Die Elemente dieser Algebra erlauben die Repräsentation geometrischer Basisentitäten, im wesentlichen Punkte, Linien, Kreise, Kugeln und Ebenen. Eine Vielzahl von Operationen ist möglich; besonders interessant sind die Transformationen der enthaltenen konformen Gruppe sowie die Möglichkeit algebraisch mit Unterräumen zu rechnen, d.h. diese zu vergrößern, zu schneiden oder Inzidenzen abzufragen. Den zweiten wichtigen Bestandteil der Arbeit stellt ein für die oben genannten Problemstellungen typisches stochastischen Verfahren dar – die Ausgleichsrechnung nach der Methode der kleinsten Quadrate. Deren allgemeinste Form erwächst aus der Verwendung des aus der Geodäsie bekannten linearen Gauß-Helmert (GH) Modells. Der resultierende GH-Schätzer zeigt alle Optimalitätseigenschaften wie minimale Varianz und Erwartungstreue. Eine der geometrischen Algebra inhärente Tensordarstellung stellt eine geeignete numerische Schnittstelle zwischen CGA und der GH-Schätzmethode zur Verfügung. Aufgrund der Bilinearität des Algebraprodukts lässt sich so ebenfalls das Konzept der Fehlerfortpflanzung, ein wichtiges Instrument der Ausgleichsrechnung, mit hoher Genauigkeit auf die Operationen der Algebra ausdehnen. Im Ergebnis entsteht ein neues universelles Parameterschätzverfahren zur Bestimmung der des jeweiligen Problems zugrundeliegenden Variablen. Ziel der vorliegenden Arbeit ist es auch, die aus der Verbindung von Algebra und Stochastik entstehenden Vorteile anhand von typischen CV-Anwendungen herauszustellen. Den Schwerpunkt hierfür bildet die Schätzung der Pose (Position und Orientierung eines Objekts bezüglich eines objektfremden Koordinatensystems), z.B. die eines Roboters anhand eines vom Roboter aufgenommenen Kamerabildes. Es wird ebenfalls gezeigt, dass CGA den optimalen Rahmen zur Modellierung omnidirektionaler Bildgebungsverfahren bietet, falls diese auf einem katadioptrischen System mit parabolischem Spiegel beruhen. Als omnidirektionale Anwendungen werden Posenschätzung sowie die Bestimmung der Epipolargeometrie präsentiert. Die erreichte Güte der GH-Parameterschätzung in den einzelnen Anwendungen wird jeweils durch experimentell gewonnene Resultate untermauert. Neben den umfangreichen Ausführungen zur Parameterschätzung liefert diese Arbeit auch eine detaillierte Einführung und Herleitung der geometrischen Algebra. Besonderes Augenmerk ist auch auf die analytische Darlegung der konformen geometrischen Algebra zu richten

Monocular Pose Estimation Based on Global and Local Features

The presented thesis work deals with several mathematical and practical aspects of the monocular pose estimation problem. Pose estimation means to estimate the position and orientation of a model object with respect to a camera used as a sensor element. Three main aspects of the pose estimation problem are considered. These are the model representations, correspondence search and pose computation. Free-form contours and surfaces are considered for the approaches presented in this work. The pose estimation problem and the global representation of free-form contours and surfaces are defined in the mathematical framework of the conformal geometric algebra (CGA), which allows a compact and linear modeling of the monocular pose estimation scenario. Additionally, a new local representation of these entities is presented which is also defined in CGA. Furthermore, it allows the extraction of local feature information of these models in 3D space and in the image plane. This local information is combined with the global contour information obtained from the global representations in order to improve the pose estimation algorithms. The main contribution of this work is the introduction of new variants of the iterative closest point (ICP) algorithm based on the combination of local and global features. Sets of compatible model and image features are obtained from the proposed local model representation of free-form contours. This allows to translate the correspondence search problem onto the image plane and to use the feature information to develop new correspondence search criteria. The structural ICP algorithm is defined as a variant of the classical ICP algorithm with additional model and image structural constraints. Initially, this new variant is applied to planar 3D free-form contours. Then, the feature extraction process is adapted to the case of free-form surfaces. This allows to define the correlation ICP algorithm for free-form surfaces. In this case, the minimal Euclidean distance criterion is replaced by a feature correlation measure. The addition of structural information in the search process results in better conditioned correspondences and therefore in a better computed pose. Furthermore, global information (position and orientation) is used in combination with the correlation ICP to simplify and improve the pre-alignment approaches for the monocular pose estimation. Finally, all the presented approaches are combined to handle the pose estimation of surfaces when partial occlusions are present in the image. Experiments made on synthetic and real data are presented to demonstrate the robustness and behavior of the new ICP variants in comparison with standard approaches

Pose Estimation Revisited

The presented thesis deals with the 2D-3D pose estimation problem. Pose estimation means to estimate the relative position and orientation of a 3D object with respect to a reference camera system. The main focus concentrates on the geometric modeling and application of the pose problem. To deal with the different geometric spaces (Euclidean, affine and projective ones), a homogeneous model for conformal geometry is applied in the geometric algebra framework. It allows for a compact and linear modeling of the pose scenario. In the chosen embedding of the pose problem, a rigid body motion is represented as an orthogonal transformation whose parameters can be estimated efficiently in the corresponding Lie algebra. In addition, the chosen algebraic embedding allows the modeling of extended features derived from sphere concepts in contrast to point concepts used in classical vector calculus. For pose estimation, 3D object models are further treated two-fold, feature based and free-form based: While the feature based pose scenarios provide constraint equations to link different image and object entities, the free-form approach for pose estimation is achieved by applying extracted image silhouettes from objects on 3D free-form contours modeled by 3D Fourier descriptors. In conformal geometric algebra an extended scenario is derived, which deals beside point features with higher-order features such as lines, planes, circles, spheres, kinematic chains or cycloidal curves. This scenario is extended to general free-form contours by interpreting contours generated with 3D Fourier descriptors as n-times nested cycloidal curves. The introduced method for shape modeling links signal theory, geometry and kinematics and is applied advantageously for 2D-3D silhouette based free-form pose estimation. The experiments show the real-time capability and noise stability of the algorithms. Experiments of a running navigation system with visual self-localization are also presented

Monocular pose estimation based on global and local features

The presented thesis work deals with several mathematical and practical aspects of the monocular pose estimation problem. Pose estimation means to estimate the position and orientation of a model object with respect to a camera used as a sensor element. Threemain aspects of the pose estimation problem are considered. These are themodel representations, correspondence search and pose computation. Free-form contours and surfaces are considered for the approaches presented in this work. The pose estimation problem and the global representation of free-form contours and surfaces are defined in the mathematical framework of the conformal geometric algebra (CGA), which allows a compact and linear modeling of the monocular pose estimation scenario. Additionally, a new local representation of these entities is presented which is also defined in CGA. Furthermore, it allows the extraction of local feature information of these models in 3D space and in the image plane. This local information is combined with the global contour information obtained from the global representations in order to improve the pose estimation algorithms. The main contribution of this work is the introduction of new variants of the iterative closest point (ICP) algorithm based on the combination of local and global features. Sets of compatible model and image features are obtained from the proposed local model representation of free-form contours. This allows to translate the correspondence search problem onto the image plane and to use the feature information to develop new correspondence search criteria. The structural ICP algorithm is defined as a variant of the classical ICP algorithm with additional model and image structural constraints. Initially, this new variant is applied to planar 3D free-form contours. Then, the feature extraction process is adapted to the case of free-form surfaces. This allows to define the correlation ICP algorithm for free-form surfaces. In this case, the minimal Euclidean distance criterion is replaced by a feature correlation measure. The addition of structural information in the search process results in better conditioned correspondences and therefore in a better computed pose. Furthermore, global information (position and orientation) is used in combination with the correlation ICP to simplify and improve the pre-alignment approaches for the monocular pose estimation. Finally, all the presented approaches are combined to handle the pose estimation of surfaces when partial occlusions are present in the image. Experiments made on synthetic and real data are presented to demonstrate the robustness and behavior of the new ICP variants in comparison with standard approaches

On the Analysis and Decomposition of Intrinsically One-Dimensional Signals and their Superpositions

Computer and machine vision tasks can roughly be divided into a hierarchy of processing steps applied to input signals captured by a measuring device. In the case of image signals, the first stage in this hierarchy is also referred to as low-level vision or low-level image processing. The field of low-level image processing includes the mathematical description of signals in terms of certain local signal models. The choice of the signal model is often task dependent. A common task is the extraction of features from the signal. Since signals are subject to transformations, for example camera movements in the case of image signals, the features are supposed to fulfill the properties of invariance or equivariance with respect to these transformations. The chosen signal model should reflect these properties in terms of its parameters. This thesis contributes to the field of low-level vision. Local signal structures are represented by (sinusoidal) intrinsically one-dimensional signals and their superpositions. Each intrinsically one-dimensional signal consists of certain parameters such as orientation, amplitude, frequency and phase. If the affine group acts on these signals, the transformations induce a corresponding action in the parameter space of the signal model. Hence, it is reasonable, to estimate the model parameters in order to describe the invariant and equivariant features. The first and main contribution studies superpositions of intrinsically one-dimensional signals in the plane. The parameters of the signal are supposed to be extracted from the responses of linear shift invariant operators: the generalized Hilbert transform (Riesz transform) and its higher-order versions and the partial derivative operators. While well known signal representations, such as the monogenic signal, allow to obtain the local features amplitude, phase and orientation for a single intrinsically one-dimensional signal, there exists no general method to decompose superpositions of such signals into their corresponding features. A novel method for the decomposition of an arbitrary number of sinusoidal intrinsically one-dimensional signals in the plane is proposed. The responses of the higher-order generalized Hilbert transforms in the plane are interpreted as symmetric tensors, which allow to restate the decomposition problem as a symmetric tensor decomposition. Algorithms, examples and applications for the novel decomposition are provided. The second contribution studies curved intrinsically one-dimensional signals in the plane. This signal model introduces a new parameter, the curvature, and allows the representation of curved signal structures. Using the inverse stereographic projection to the sphere, these curved signals are locally identified with intrinsically one-dimensional signals in the three-dimensional Euclidean space and analyzed in terms of the generalized Hilbert transform and partial derivatives therein. The third contribution studies the generalized Hilbert transform in a non-Euclidean space, the two-sphere. The mathematical framework of Clifford analysis proposes a further generalization of the generalized Hilbert transform to the two-sphere in terms of the corresponding Cauchy kernel. Nonetheless, this transform lacks an intuitive interpretation in the frequency domain. A decomposition of the Cauchy kernel in terms of its spherical harmonics is provided. Its coefficients not only provide insights to the generalized Hilbert transform on the sphere, but also allow for fast implementations in terms of analogues of the convolution theorem on the sphere