Global ETD Search

171	Robot navigation in sensor space Keeratipranon, Narongdech January 2009 (has links) This thesis investigates the problem of robot navigation using only landmark bearings. The proposed system allows a robot to move to a ground target location specified by the sensor values observed at this ground target posi- tion. The control actions are computed based on the difference between the current landmark bearings and the target landmark bearings. No Cartesian coordinates with respect to the ground are computed by the control system. The robot navigates using solely information from the bearing sensor space. Most existing robot navigation systems require a ground frame (2D Cartesian coordinate system) in order to navigate from a ground point A to a ground point B. The commonly used sensors such as laser range scanner, sonar, infrared, and vision do not directly provide the 2D ground coordi- nates of the robot. The existing systems use the sensor measurements to localise the robot with respect to a map, a set of 2D coordinates of the objects of interest. It is more natural to navigate between the points in the sensor space corresponding to A and B without requiring the Cartesian map and the localisation process. Research on animals has revealed how insects are able to exploit very limited computational and memory resources to successfully navigate to a desired destination without computing Cartesian positions. For example, a honeybee balances the left and right optical flows to navigate in a nar- row corridor. Unlike many other ants, Cataglyphis bicolor does not secrete pheromone trails in order to find its way home but instead uses the sun as a compass to keep track of its home direction vector. The home vector can be inaccurate, so the ant also uses landmark recognition. More precisely, it takes snapshots and compass headings of some landmarks. To return home, the ant tries to line up the landmarks exactly as they were before it started wandering. This thesis introduces a navigation method based on reflex actions in sensor space. The sensor vector is made of the bearings of some landmarks, and the reflex action is a gradient descent with respect to the distance in sensor space between the current sensor vector and the target sensor vec- tor. Our theoretical analysis shows that except for some fully characterized pathological cases, any point is reachable from any other point by reflex action in the bearing sensor space provided the environment contains three landmarks and is free of obstacles. The trajectories of a robot using reflex navigation, like other image- based visual control strategies, do not correspond necessarily to the shortest paths on the ground, because the sensor error is minimized, not the moving distance on the ground. However, we show that the use of a sequence of waypoints in sensor space can address this problem. In order to identify relevant waypoints, we train a Self Organising Map (SOM) from a set of observations uniformly distributed with respect to the ground. This SOM provides a sense of location to the robot, and allows a form of path planning in sensor space. The navigation proposed system is analysed theoretically, and evaluated both in simulation and with experiments on a real robot.
172	Užití astronomické nivelace pro vytváření modelů kvazigeoidu / Use of Astronomical Levelling for Creation of Quasigeoid Models Jurčík, Josef January 2012 (has links) My master´s thesis deals with use of astronomical levelling for creation of quasigeoid models. The basic input dates are componets of astronomical-geodetic deflections of the vertical in points, which are determined on AGNES and VEVEŘÍ nets. The dates are adjust for determination of relative quasigeoid. In literature [4], there is simplified solution for adjustment of this dates. The thesis looks for the most comprehensive solutions of adjustment without simplification. The solutions are compared.
173	Methods for face detection and adaptive face recognition Pavani, Sri-Kaushik 21 July 2010 (has links) The focus of this thesis is on facial biometrics; specifically in the problems of face detection and face recognition. Despite intensive research over the last 20 years, the technology is not foolproof, which is why we do not see use of face recognition systems in critical sectors such as banking. In this thesis, we focus on three sub-problems in these two areas of research. Firstly, we propose methods to improve the speed-accuracy trade-off of the state-of-the-art face detector. Secondly, we consider a problem that is often ignored in the literature: to decrease the training time of the detectors. We propose two techniques to this end. Thirdly, we present a detailed large-scale study on self-updating face recognition systems in an attempt to answer if continuously changing facial appearance can be learnt automatically. / L'objectiu d'aquesta tesi és sobre biometria facial, específicament en els problemes de detecció de rostres i reconeixement facial. Malgrat la intensa recerca durant els últims 20 anys, la tecnologia no és infalible, de manera que no veiem l'ús dels sistemes de reconeixement de rostres en sectors crítics com la banca. En aquesta tesi, ens centrem en tres sub-problemes en aquestes dues àrees de recerca. En primer lloc, es proposa mètodes per millorar l'equilibri entre la precisió i la velocitat del detector de cares d'última generació. En segon lloc, considerem un problema que sovint s'ignora en la literatura: disminuir el temps de formació dels detectors. Es proposen dues tècniques per a aquest fi. En tercer lloc, es presenta un estudi detallat a gran escala sobre l'auto-actualització dels sistemes de reconeixement facial en un intent de respondre si el canvi constant de l'aparença facial es pot aprendre de forma automàtica. Fisher's LDA Gaussian weak classifiers Weak classifier Variance normalization Transductive reasoning training complexity rejection cascade fusion of p-values OSTCM-kNN classifier integrated Performance Primitives impostor detection haar-like features fusion of shape and texture face recognition system delaunay triangulation MIT+CMU face database YT database GEFA database temporal confidence segmentation confidence face detector confidence classification confidence laplacian clutter model clutter models changes in facial appearance face segmentation face normalization face detection automatic face recognition system 62
174	High order numerical methods for a unified theory of fluid and solid mechanics Chiocchetti, Simone 10 June 2022 (has links) This dissertation is a contribution to the development of a unified model of continuum mechanics, describing both fluids and elastic solids as a general continua, with a simple material parameter choice being the distinction between inviscid or viscous fluid, or elastic solids or visco-elasto-plastic media. Additional physical effects such as surface tension, rate-dependent material failure and fatigue can be, and have been, included in the same formalism. The model extends a hyperelastic formulation of solid mechanics in Eulerian coordinates to fluid flows by means of stiff algebraic relaxation source terms. The governing equations are then solved by means of high order ADER Discontinuous Galerkin and Finite Volume schemes on fixed Cartesian meshes and on moving unstructured polygonal meshes with adaptive connectivity, the latter constructed and moved by means of a in- house Fortran library for the generation of high quality Delaunay and Voronoi meshes. Further, the thesis introduces a new family of exponential-type and semi- analytical time-integration methods for the stiff source terms governing friction and pressure relaxation in Baer-Nunziato compressible multiphase flows, as well as for relaxation in the unified model of continuum mechanics, associated with viscosity and plasticity, and heat conduction effects. Theoretical consideration about the model are also given, from the solution of weak hyperbolicity issues affecting some special cases of the governing equations, to the computation of accurate eigenvalue estimates, to the discussion of the geometrical structure of the equations and involution constraints of curl type, then enforced both via a GLM curl cleaning method, and by means of special involution-preserving discrete differential operators, implemented in a semi-implicit framework. Concerning applications to real-world problems, this thesis includes simulation ranging from low-Mach viscous two-phase flow, to shockwaves in compressible viscous flow on unstructured moving grids, to diffuse interface crack formation in solids. High order ADER Discontinuous Galerkin DG Finite Volume FV Finite Element FE FEM DGFEM CFD Voronoi Delaunay Unstructured meshe Fortran Fluid mechanic Solid Mechanic Continuum Mechanic Baer Nunziato Surface tension Multiphase flow Compressible flow Navier Stoke Semi-implicit GLM cleaning Partial differential equation Numerical method Stiff source Finite rate stiff relaxation Hyperbolic equation Metodi d'alto ordine ADER Discontinous Galerkin Volumi Finiti Elementi Finiti Meccanica dei fluidi Meccanica dei solidi Meccanica dei continui Fluidi multifase Fluidi comprimibili Metodi semi-impliciti Equazioni alle derivate parziali Metodi numerici Equazioni iperboliche Griglie non strutturate

Page generated in 0.0525 seconds