111 |
Evaluation of Coarse Sun Sensor in a Miniaturized Distributed Relative Navigation System: An Experimental and Analytical InvestigationMaeland, Lasse 2011 May 1900 (has links)
Observing the relative state of two space vehicles has been an active field of research since the earliest attempts at space rendezvous and docking during the 1960's. Several techniques have successfully been employed by several space agencies and the importance of these systems has been repeatedly demonstrated during the on-orbit assembly and continuous re-supply of the International Space Station. More recent efforts are focused on technologies that can enable fully automated navigation and control of space vehicles. Technologies which have previously been investigated or are actively researched include Video Guidance Systems (VGS), Light Detection and Ranging (LIDAR), RADAR, Differential GPS (DGPS) and Visual Navigation Systems.
The proposed system leverages the theoretical foundation which has been advanced in the development of VisNav, invented at Texas A & M University, and the miniaturized commercially available Northstar sensor from Evolution Robotics. The dissertation first surveys contemporary technology, followed by an analytical investigation of the coarse sun sensor and errors associated with utilizing it in the near-field. Next, the commercial Northstar sensor is investigated, utilizing fundamentals to generate a theoretical model of its behavior, followed by the development of an experiment for the purpose of investigating and characterizing the sensor's performance. Experimental results are then presented and compared with a numerical simulation of a single-sensor system performance. A case study evaluating a two sensor implementation is presented evaluating the proposed system's performance in a multisensor configuration.
The initial theoretical analysis relied on use of the cosine model, which proved inadequate in fully capturing the response of the coarse sun sensor. Fresenel effects were identified as a significant source of unmodeled sensor behavior and subsequently incorporated into the model. Additionally, near-field effects were studied and modeled. The near-field effects of significance include: unequal incidence angle, unequal incidence power, and non-uniform radiated power. It was found that the sensor displayed inherent instabilities in the 0.3 degree range. However, it was also shown that the sensor could be calibrated to this level. Methods for accomplishing calibration of the sensor in the near-field were introduced and feasibility of achieving better than 1 cm and 1 degree relative position and attitude accuracy in close proximity, even on a small satellite platform, was determined.
|
112 |
A Comparative Study On Pose Estimation Algorithms Using Visual DataCetinkaya, Guven 01 February 2012 (has links) (PDF)
Computation of the position and orientation of an object with respect to a camera from its images is called pose estimation problem. Pose estimation is one of the major problems in computer vision, robotics and photogrammetry. Object tracking, object recognition, self-localization of robots are typical examples for the use of pose estimation.
Determining the pose of an object from its projections requires 3D model of an object in its own reference system, the camera parameters and 2D image of the object. Most of the pose estimation algorithms require the correspondences between the 3D model points of the object and 2D image points.
In this study, four well-known pose estimation algorithms requiring the 2D-3D correspondences to be known a priori / namely, Orthogonal Iterations, POSIT, DLT and Efficient PnP are compared. Moreover, two other well-known algorithms that solve the correspondence and pose problems simultaneously / Soft POSIT and Blind- PnP are also compared in the scope of this thesis study. In the first step of the simulations, synthetic data is formed using a realistic motion scenario and the algorithms are compared using this data. In the next step, real images captured by a calibrated camera for an object with known 3D model are exploited.
The simulation results indicate that POSIT algorithm performs the best among the algorithms requiring point correspondences. Another result obtained from the experiments is that Soft-POSIT algorithm can be considered to perform better than Blind-PnP algorithm.
|
113 |
Statistical methods for 2D image segmentation and 3D pose estimationSandhu, Romeil Singh 26 October 2010 (has links)
The field of computer vision focuses on the goal of developing techniques to exploit and extract information from underlying data that may represent images or other multidimensional data. In particular, two well-studied problems in computer vision are the fundamental tasks of 2D image segmentation and 3D pose estimation from a 2D scene.
In this thesis, we first introduce two novel methodologies that attempt to independently solve 2D image segmentation and 3D pose estimation separately. Then, by leveraging the advantages of certain techniques from each problem, we couple both tasks in a variational and non-rigid manner through a single energy functional. Thus, the three theoretical components and contributions of this thesis are as follows:
Firstly, a new distribution metric for 2D image segmentation is introduced. This is employed within the geometric active contour (GAC) framework.
Secondly, a novel particle filtering approach is proposed for the problem of estimating the pose of two point sets that differ by a rigid body transformation.
Thirdly, the two techniques of image segmentation and pose estimation are coupled in a single energy functional for a class of 3D rigid objects.
After laying the groundwork and presenting these contributions, we then turn to their applicability to real world problems such as visual tracking. In particular, we present an example where we develop a novel tracking scheme for 3-D Laser RADAR imagery. However, we should mention that the proposed contributions are solutions for general imaging problems and therefore can be applied to medical imaging problems such as extracting the prostate from MRI imagery
|
114 |
Face Detection and Pose Estimation using Triplet Invariants / Ansiktsdetektering med hjälp av triplet-invarianterIsaksson, Marcus January 2002 (has links)
<p>Face detection and pose estimation are two widely studied problems - mainly because of their use as subcomponents in important applications, e.g. face recognition. In this thesis I investigate a new approach to the general problem of object detection and pose estimation and apply it to faces. Face detection can be considered a special case of this general problem, but is complicated by the fact that faces are non-rigid objects. The basis of the new approach is the use of scale and orientation invariant feature structures - feature triplets - extracted from the image, as well as a biologically inspired associative structure which maps from feature triplets to desired responses (position, pose, etc.). The feature triplets are constructed from curvature features in the image and coded in a way to represent distances between major facial features (eyes, nose and mouth). The final system has been evaluated on different sets of face images.</p>
|
115 |
Channel-Coded Feature Maps for Computer Vision and Machine LearningJonsson, Erik January 2008 (has links)
<p>This thesis is about channel-coded feature maps applied in view-based object recognition, tracking, and machine learning. A channel-coded feature map is a soft histogram of joint spatial pixel positions and image feature values. Typical useful features include local orientation and color. Using these features, each channel measures the co-occurrence of a certain orientation and color at a certain position in an image or image patch. Channel-coded feature maps can be seen as a generalization of the SIFT descriptor with the options of including more features and replacing the linear interpolation between bins by a more general basis function.</p><p>The general idea of channel coding originates from a model of how information might be represented in the human brain. For example, different neurons tend to be sensitive to different orientations of local structures in the visual input. The sensitivity profiles tend to be smooth such that one neuron is maximally activated by a certain orientation, with a gradually decaying activity as the input is rotated.</p><p>This thesis extends previous work on using channel-coding ideas within computer vision and machine learning. By differentiating the channel-coded feature maps with respect to transformations of the underlying image, a method for image registration and tracking is constructed. By using piecewise polynomial basis functions, the channel coding can be computed more efficiently, and a general encoding method for N-dimensional feature spaces is presented.</p><p>Furthermore, I argue for using channel-coded feature maps in view-based pose estimation, where a continuous pose parameter is estimated from a query image given a number of training views with known pose. The optimization of position, rotation and scale of the object in the image plane is then included in the optimization problem, leading to a simultaneous tracking and pose estimation algorithm. Apart from objects and poses, the thesis examines the use of channel coding in connection with Bayesian networks. The goal here is to avoid the hard discretizations usually required when Markov random fields are used on intrinsically continuous signals like depth for stereo vision or color values in image restoration.</p><p>Channel coding has previously been used to design machine learning algorithms that are robust to outliers, ambiguities, and discontinuities in the training data. This is obtained by finding a linear mapping between channel-coded input and output values. This thesis extends this method with an incremental version and identifies and analyzes a key feature of the method -- that it is able to handle a learning situation where the correspondence structure between the input and output space is not completely known. In contrast to a traditional supervised learning setting, the training examples are groups of unordered input-output points, where the correspondence structure within each group is unknown. This behavior is studied theoretically and the effect of outliers and convergence properties are analyzed.</p><p>All presented methods have been evaluated experimentally. The work has been conducted within the cognitive systems research project COSPAL funded by EC FP6, and much of the contents has been put to use in the final COSPAL demonstrator system.</p>
|
116 |
Pose Estimation and Calibration Algorithms for Vision and Inertial SensorsHol, Jeroen Diederik January 2008 (has links)
<p>This thesis deals with estimating position and orientation in real-time, using measurements from vision and inertial sensors. A system has been developed to solve this problem in unprepared environments, assuming that a map or scene model is available. Compared to ‘camera-only’ systems, the combination of the complementary sensors yields an accurate and robust system which can handle periods with uninformative or no vision data and reduces the need for high frequency vision updates.</p><p>The system achieves real-time pose estimation by fusing vision and inertial sensors using the framework of nonlinear state estimation for which state space models have been developed. The performance of the system has been evaluated using an augmented reality application where the output from the system is used to superimpose virtual graphics on the live video stream. Furthermore, experiments have been performed where an industrial robot providing ground truth data is used to move the sensor unit. In both cases the system performed well.</p><p>Calibration of the relative position and orientation of the camera and the inertial sensor turn out to be essential for proper operation of the system. A new and easy-to-use algorithm for estimating these has been developed using a gray-box system identification approach. Experimental results show that the algorithm works well in practice.</p>
|
117 |
Système de réalité augmentée basé sur l'observation de structures planes:<br />conception et évaluationVigueras-Gomez, Flavio 29 January 2007 (has links) (PDF)
L'objectif de la Réalité Augmentée (RA) est d'intégrer des objets virtuels dans des images d'une scène réelle.<br />Les applications de la RA nécessitent que la scène augmentée soit continuellement mise à jour en fonction des mouvements de la caméra dans la scène.<br />Il est donc primordial de pouvoir calculer à chaque instant les paramètres de la caméra pour avoir une composition cohérente.<br />Cependant, les paramètres calculés sont souvent affectés par des fluctuations statistiques, ce qui nuit à l'impression visuelle de la scène augmentée.<br />Le problème de stabilisation de la caméra a été considéré par Kanatani et Matsuaga qui classifient les déplacements de la caméra par un certain nombre de modèles de mouvement.<br />Nous avons proposé de poursuivre leurs travaux dans un cadre d'environnements de type multi-planaire et de tester différents critères de sélection de modèles, ce qui a mis en évidence que l'usage de critères impliquant l'information sur la covariance des paramètres calculés améliorait la précision et la robustesse des points de vues calculées.<br /><br />Idéalement, un système de RA devrait fonctionner dans un environnement sans besoin de préparer la scène.<br />Dans cette thèse, nous considérons les problèmes du calcul du point de vue et des paramètres intrinsèques de la caméra dans le cadre d'environnements de type mu<br />lti-planaire.<br />De telles structures sont très courantes en intérieurs comme en extérieurs et le domaine d'application de nos méthodes est donc assez large.<br /><br />Nos évaluations expérimentales montrent que les stratégies ici proposées améliorent la précision et la stabilité dans le calcul des paramètres de la caméra et,<br />par conséquent, la qualité des séquences augmentées.
|
118 |
Palm Programmierung unter LinuxJahre, Daniel 12 March 2002 (has links)
Die PDAs von Palm Inc. und seinen Lizenznehmern werden gerne zur Adress- und Terminverwaltung eingesetzt. Damit ist ihr Leistungspotential jedoch nicht erschöpft. Wer gerne selbst Applikationen für Palm PDAs entwickeln möchte, ist dabei nicht zwingend auf eine windowsbasierte Entwicklungsumgebung angewiesen. Unter Linux gibt es Compiler, Ressourceeditoren und Emulatoren für PalmOS. Ich werde in meinem Vortrag diese Werkzeuge vorstellen, demonstrieren und ein Beispielprogramm zeigen.
|
119 |
Visual surveillance: dynamic behavior analysis at multiple levelsBreitenstein, Michael D. January 2009 (has links)
Zugl.: Zürich, Techn. Hochsch., Diss., 2009
|
120 |
Security with visual understanding : Kinect human recognition capabilities applied in a home security system / Kinect human recognition capabilities applied in a home security systemFluckiger, S Joseph 08 August 2012 (has links)
Vision is the most celebrated human sense. Eighty percent of the information humans receive is obtained through vision. Machines capable of capturing images are now ubiquitous, but until recently, they have been unable to recognize objects in the images they capture. In effect, machines have been blind.
This paper explores the revolutionary new capability of a camera to recognize whether a human is present in an image and take detailed measurements of the person’s dimensions. It explains how the hardware and software of the camera work to provide this remarkable capability in just 200 milliseconds per image.
To demonstrate these capabilities, a home security application has been built called Security with Visual Understanding (SVU). SVU is a hardware/software solution that detects a human and then performs biometric authentication by comparing the dimensions of the seen person against a database of known people. If the person is unrecognized, an alarm is sounded, and a picture of the intruder is sent via SMS text message to the home owner. Analysis is performed to measure the tolerance of the SVU algorithm for differentiating between two people based on their body dimensions. / text
|
Page generated in 0.0159 seconds