In rail transport, various automatic protection systems are available to ensure the safe operation of trains and to facilitate automation and optimization tasks. For this purpose, a set of physical balises is used, which are placed at fixed points along the railway track. Based on the information provided by these balises, different information is displayed to the driver, and control actions are generated. The use of physical balises located at fixed points does not allow for automatic protection actions on sections of track where they are not installed. This is a major drawback as in many cases, temporary automatic protection actions are necessary on sections of the railway line without balises due to various circumstances (work on the track, accidents, etc.). To solve this problem, this paper presents a solution called announcement signals and automatic braking using virtual balises (ASAB-VB). This proposal allows the incorporation of virtual balises at points on the track where it is necessary to temporarily perform automatic protection actions. For this purpose, the ASAB-VB system allows obtaining the train position in real-time and storing a digital map of the track that will be made by each train. This digital map includes geographic information about the balises (both physical and virtual ones) located on the track. At the same time, the train position is obtained by merging the information provided by a GNSS, an odometer, and an inertial system (gyro and accelerometers).

In this paper, we address the generation of semantic labels describing the headgear accessories carried out by people in a scene under surveillance, only using depth information obtained from a Time-of-Flight (ToF) camera placed in an overhead position. We propose a new method for headgear accessories classification based on the design of a robust processing strategy that includes the estimation of a meaningful feature vector that provides the relevant information about the people’s head and shoulder areas. This paper includes a detailed description of the proposed algorithmic approach, and the results obtained in tests with persons with and without headgear accessories, and with different types of hats and caps. In order to evaluate the proposal, a wide experimental validation has been carried out on a fully labeled database (that has been made available to the scientific community), including a broad variety of people and headgear accessories. For the validation, three different levels of detail have been defined, considering a different number of classes: the first level only includes two classes (hat/cap, and no hat/cap), the second one considers three classes (hat, cap and no hat/cap), and the last one includes the full class set with the five classes (no hat/cap, cap, small size hat, medium size hat, and large size hat). The achieved performance is satisfactory in every case: the average classification rates for the first level reaches 95.25%, for the second one is 92.34%, and for the full class set equals 84.60%. In addition, the online stage processing time is 5.75 ms per frame in a standard PC, thus allowing for real-time operation.

This article is a study about the existence and the uniqueness of solutions of a specific quadratic first-order ODE that frequently appears in multiple reconstruction problems. It is called the \emph{planar-perspective equation} due to the duality with the geometric problem of reconstruction of planar-perspective curves from their modulus. Solutions of the \emph{planar-perspective equation} are related with planar curves parametrized with perspective parametrization due to this geometric interpretation. The article proves the existence of only two local solutions to the \emph{initial value problem} with \emph{regular initial conditions} and a maximum of two analytic solutions with \emph{critical initial conditions}. The article also gives theorems to extend the local definition domain where the existence of both solutions are guaranteed. It introduces the \emph{maximal depth function} as a function that upper-bound all possible solutions of the \emph{planar-perspective equation} and contains all its possible \emph{critical points}. Finally, the article describes the \emph{maximal-depth solution problem} that consists of finding the solution of the referred equation that has maximum the depth and proves its uniqueness. It is an important problem as it does not need initial conditions to obtain the unique solution and its the frequent solution that practical algorithms of the state-of-the-art give.