Abstract: This paper presents a domain adaptation strategy to efficiently train network architectures for estimating the relative camera pose in multi-view scenarios. The network architectures are fed by a pair of simultaneously acquired
images, hence in order to improve the accuracy of the solutions, and due to the lack of large datasets with pairs of
overlapped images, a domain adaptation strategy is proposed. The domain adaptation strategy consists on transferring the knowledge learned from synthetic images to real-world scenarios. For this, the networks are firstly
trained using pairs of synthetic images, which are captured at the same time by a pair of cameras in a virtual environment; and then, the learned weights of the networks are transferred to the real-world case, where the networks are retrained with a few real images. Different virtual 3D scenarios are generated to evaluate the
relationship between the accuracy on the result and the similarity between virtual and real scenarios—similarity
on both geometry of the objects contained in the scene as well as relative pose between camera and objects in the
scene. Experimental results and comparisons are provided showing that the accuracy of all the evaluated networks for estimating the camera pose improves when the proposed domain adaptation strategy is used,
highlighting the importance on the similarity between virtual-real scenarios.

Abstract: This manuscript evaluates the usage of fused cross-spectral images in a monocular visual odometry approach. Fused images are obtained through a Discrete Wavelet Transform (DWT) scheme, where the best setup is em- pirically obtained by means of a mutual information based evaluation met- ric. The objective is to have a exible scheme where fusion parameters are adapted according to the characteristics of the given images. Visual odom- etry is computed from the fused monocular images using an off the shelf approach. Experimental results using data sets obtained with two different platforms are presented. Additionally, comparison with a previous approach as well as with monocular-visible/infrared spectra are also provided showing the advantages of the proposed scheme.

Abstract: When an autonomous vehicle is traveling through some scenario it receives a continuous stream of sensor data. This sensor data arrives in an asynchronous fashion and often contains overlapping or redundant information. Thus, it is not trivial how a representation of the environment observed by the vehicle can be created and updated over time. This paper presents a novel methodology to compute an incremental 3D representation of a scenario from 3D range measurements. We propose to use macro scale polygonal primitives to model the scenario. This means that the representation of the scene is given as a list of large scale polygons that describe the geometric structure of the environment. Furthermore, we propose mechanisms designed to update the geometric polygonal primitives over time whenever fresh sensor data is collected. Results show that the approach is capable of producing accurate descriptions of the scene, and that it is computationally very efficient when compared to other reconstruction techniques.

Abstract: The authors present a model-free policy-based reinforcement learning
model that introduces perturbations on the pattern of a metasurface.
The objective is to learn a policy that changes the size of the
patches, and therefore the impedance in the sides of an artificially structured
material. The proposed iterative model assigns the highest reward
when the patch sizes allow the transmission along a constrained path
and penalties when the patch sizes make the surface wave radiate to
the sides of the metamaterial. After convergence, the proposed
model learns an optimal patch pattern that achieves lateral confinement
along the metasurface. Simulation results show that the proposed
learned-pattern can effectively guide the electromagnetic wave
through a metasurface, maintaining its instantaneous eigenstate when
the homogeneity is perturbed. Moreover, the pattern learned to
prevent reflections by changing the patch sizes adiabatically. The
reflection coefficient S1, 2 shows that most of the power gets transferred
from the source to the destination with the proposed design.

Abstract: Durante los últimos años ha existido un fuerte incremento en el acceso a internet, causando que los centros de datos ( DC) deban adaptar dinámicamente su infraestructura de red de cara a enfrentar posibles problemas de congestión, la cual no siempre se da de forma oportuna. Ante esto, nuevas topologías de red se han propuesto en los últimos años, como una forma de brindar mejores condiciones para el manejo de tráfico interno, sin embargo es común que para el estudio de estas mejoras, se necesite recrear el comportamiento de un verdadero DC en modelos de simulación/emulación. Por lo tanto se vuelve esencial validar dichos modelos, de cara a obtener resultados coherentes con la realidad. Esta validación es posible por medio de la identificación de ciertas propiedades que se deducen a partir de las variables y los parámetros que describen la red, y que se mantienen en las topologías de los DC para diversos escenarios y/o configuraciones. Estas propiedades, conocidas como invariantes, son una expresión del funcionamiento de la red en ambientes reales, como por ejemplo la ruta más larga entre dos nodos o el número de enlaces mínimo que deben fallar antes de una pérdida de conectividad en alguno de los nodos de la red. En el presente trabajo se realiza la identificación, formulación y comprobación de dos invariantes para la topología Fat-Tree, utilizando como software emulador a mininet. Las conclusiones muestran resultados concordantes entre lo analítico y lo práctico.