48 resultados para Geometría epipolar
em Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España
Resumo:
[ES]Los autores de este artículo trabajan desde hace algunos años en la formulación e implementación de procedimientos numéricos que permiten proponer geometrías de pantalla anti-ruido que sean acústicamente más eficientes. Estos procedimientos utilizan modelos de búsqueda de óptimos basados en Algoritmos Evolutivos que permiten seleccionar y ajustar los parámetros del problema en el sentido de obtener diseños mejorado.
Resumo:
[ES] Se presenta el análisis morfológico de un sector del replano RIOOO' El sector escogido está colgado por encima de la red fluvial actual. Este hecho permite atribuir a los cursos que drenan el replano un carácter semi funcional. Se han identificado once niveles de terrazas erosivas, que corresponden al desmantelamiento del replano inicial. La geometría de la red permite suponer que la organización actual se alcanzó mediante sucesivas capturas. Por otra parte, se han distinguido dos trazados de la red (centrípeta y en bayoneta); la red centrípeta define una superficie hueca y la red en bayoneta una superficie en rampas escalonadas. Se propone que ambas morfologías corresponderían a diferentes estadios de un mismo proceso: el vaciado del RIOOO' Por último, se propone la hipótesis de un descabalamiento tectónico del Rgoo para el origen de los Llanos.
Resumo:
Máster Universitario en Sistemas Inteligentes y Aplicaciones Numéricas en Ingeniería (SIANI)
Resumo:
[EN] We present an energy based approach to estimate a dense disparity map from a set of two weakly calibrated stereoscopic images while preserving its discontinuities resulting from image boundaries. We first derive a simplified expression for the disparity that allows us to estimate it from a stereo pair of images using an energy minimization approach. We assume that the epipolar geometry is known, and we include this information in the energy model. Discontinuities are preserved by means of a regularization term based on the Nagel-Enkelmann operator. We investigate the associated Euler-Lagrange equation of the energy functional, and we approach the solution of the underlying partial differential equation (PDE) using a gradient descent method The resulting parabolic problem has a unique solution. In order to reduce the risk to be trapped within some irrelevant local minima during the iterations, we use a focusing strategy based on a linear scalespace. Experimental results on both synthetic and real images arere presented to illustrate the capabilities of this PDE and scale-space based method.
Resumo:
Máster Oficial en Gestión Costera
Resumo:
Máster Universitario en Sistemas Inteligentes y Aplicaciones Numéricas en Ingeniería (SIANI)
Resumo:
[EN] This paper presents a Boundary Elements (BE) approach for the efficiency improvement of road acoustic barriers, mora specifically, for the shape design optimization of top-edge devices in the search for the best designs in terms of screening performance, usually represented by the insertion loss (IL).
Resumo:
[EN]In this work we develop a procedure to deform a given surface triangulation to obtain its alignment with interior curves. These curves are defined by splines in a parametric space and, subsequently, mapped to the surface triangulation. We have restricted our study to orthogonal mapping, so we require the curves to be included in a patch of the surface that can be orthogonally projected onto a plane (our parametric space). For example, the curves can represent interfaces between different materials or boundary conditions, internal boundaries or feature lines. Another setting in which this procedure can be used is the adaption of a reference mesh to changing curves in the course of an evolutionary process...
Resumo:
[EN]Longest edge (nested) algorithms for triangulation refinement in two dimensions are able to produce hierarchies of quality and nested irregular triangulations as needed both for adaptive finite element methods and for multigrid methods. They can be formulated in terms of the longest edge propagation path (Lepp) and terminal edge concepts, to refine the target triangles and some related neighbors. We discuss a parallel multithread algorithm, where every thread is in charge of refining a triangle t and its associated Lepp neighbors. The thread manages a changing Lepp(t) (ordered set of increasing triangles) both to find a last longest (terminal) edge and to refine the pair of triangles sharing this edge...