Fast human pose estimation using 3D Zernike descriptors

Markerless video-based human pose estimation algorithms face a high-dimensional problem that is frequently broken down into several lower-dimensional ones by estimating the pose of each limb separately. However, in order to do so they need to reliably locate the torso, for which they typically rely on time coherence and tracking algorithms. Their losing track usually results in catastrophic failure of the process, requiring human intervention and thus precluding their usage in real-time applications. We propose a very fast rough pose estimation scheme based on global shape descriptors built on 3D Zernike moments. Using an articulated model that we configure in many poses, a large database of descriptor/pose pairs can be computed off-line. Thus, the only steps that must be done on-line are the extraction of the descriptors for each input volume and a search against the database to get the most likely poses. While the result of such process is not a fine pose estimation, it can be useful to help more sophisticated algorithms to regain track or make more educated guesses when creating new particles in particle-filter-based tracking schemes. We have achieved a performance of about ten fps on a single computer using a database of about one million entries.

Desing and development of a robotic platform for the evaluation of search algorithms

Plant diseases represent a major economic and environmental problem in agriculture and forestry. Upon infection, a plant develops symptoms that affect different parts of the plant causing a significant agronomic impact. As many such diseases spread in time over the whole crop, a system for early disease detection can aid to mitigate the losses produced by the plant diseases and can further prevent their spread [1]. In recent years, several mathematical algorithms of search have been proposed [2,3] that could be used as a non-invasive, fast, reliable and cost-effective methods to localize in space infectious focus by detecting changes in the profile of volatile organic compounds. Tracking scents and locating odor sources is a major challenge in robotics, on one hand because odour plumes consists of non-uniform intermittent odour patches dispersed by the wind and on the other hand because of the lack of precise and reliable odour sensors. Notwithstanding, we have develop a simple robotic platform to study the robustness and effectiveness of different search algorithms [4], with respect to specific problems to be found in their further application in agriculture, namely errors committed in the motion and sensing and to the existence of spatial constraints due to land topology or the presence of obstacles.

Algorithms hardware implementation for ultrasonic data processing in SHM system

Nowadays, devices that monitor the health of structures consume a lot of power and need a lot of time to acquire, process, and send the information about the structure to the main processing unit. To decrease this time, fast electronic devices are starting to be used to accelerate this processing. In this paper some hardware algorithms implemented in an electronic logic programming device are described. The goal of this implementation is accelerate the process and diminish the information that has to be send. By reaching this goal, the time the processor needs for treating all the information is reduced and so the power consumption is reduced too.

A new regularization method for fast and accurate propagation of roto-translationally coupled asteroids

There is a well-distinguished group of asteroids for which the roto-translational cou-pling is known to have a non-negligible e�ect in the long-term. The study of such asteroids suggests the use of specialized propagation techniques, where perturbation methods make their best. The techniques from which the special regularization method DROMO is derived, have now been extended to the attitude dynamics, with equally remarkable results in terms of speed and accuracy, thus making the combination of these algorithms specially. well-suited to deal with the propagation of bodies with strong attitude coupling.

Parallel Computer Vision Algorithms for Graphics Processing Units

La evolución de los teléfonos móviles inteligentes, dotados de cámaras digitales, está provocando una creciente demanda de aplicaciones cada vez más complejas que necesitan algoritmos de visión artificial en tiempo real; puesto que el tamaño de las señales de vídeo no hace sino aumentar y en cambio el rendimiento de los procesadores de un solo núcleo se ha estancado, los nuevos algoritmos que se diseñen para visión artificial han de ser paralelos para poder ejecutarse en múltiples procesadores y ser computacionalmente escalables. Una de las clases de procesadores más interesantes en la actualidad se encuentra en las tarjetas gráficas (GPU), que son dispositivos que ofrecen un alto grado de paralelismo, un excelente rendimiento numérico y una creciente versatilidad, lo que los hace interesantes para llevar a cabo computación científica. En esta tesis se exploran dos aplicaciones de visión artificial que revisten una gran complejidad computacional y no pueden ser ejecutadas en tiempo real empleando procesadores tradicionales. En cambio, como se demuestra en esta tesis, la paralelización de las distintas subtareas y su implementación sobre una GPU arrojan los resultados deseados de ejecución con tasas de refresco interactivas. Asimismo, se propone una técnica para la evaluación rápida de funciones de complejidad arbitraria especialmente indicada para su uso en una GPU. En primer lugar se estudia la aplicación de técnicas de síntesis de imágenes virtuales a partir de únicamente dos cámaras lejanas y no paralelas—en contraste con la configuración habitual en TV 3D de cámaras cercanas y paralelas—con información de color y profundidad. Empleando filtros de mediana modificados para la elaboración de un mapa de profundidad virtual y proyecciones inversas, se comprueba que estas técnicas son adecuadas para una libre elección del punto de vista. Además, se demuestra que la codificación de la información de profundidad con respecto a un sistema de referencia global es sumamente perjudicial y debería ser evitada. Por otro lado se propone un sistema de detección de objetos móviles basado en técnicas de estimación de densidad con funciones locales. Este tipo de técnicas es muy adecuada para el modelado de escenas complejas con fondos multimodales, pero ha recibido poco uso debido a su gran complejidad computacional. El sistema propuesto, implementado en tiempo real sobre una GPU, incluye propuestas para la estimación dinámica de los anchos de banda de las funciones locales, actualización selectiva del modelo de fondo, actualización de la posición de las muestras de referencia del modelo de primer plano empleando un filtro de partículas multirregión y selección automática de regiones de interés para reducir el coste computacional. Los resultados, evaluados sobre diversas bases de datos y comparados con otros algoritmos del estado del arte, demuestran la gran versatilidad y calidad de la propuesta. Finalmente se propone un método para la aproximación de funciones arbitrarias empleando funciones continuas lineales a tramos, especialmente indicada para su implementación en una GPU mediante el uso de las unidades de filtraje de texturas, normalmente no utilizadas para cómputo numérico. La propuesta incluye un riguroso análisis matemático del error cometido en la aproximación en función del número de muestras empleadas, así como un método para la obtención de una partición cuasióptima del dominio de la función para minimizar el error. ABSTRACT The evolution of smartphones, all equipped with digital cameras, is driving a growing demand for ever more complex applications that need to rely on real-time computer vision algorithms. However, video signals are only increasing in size, whereas the performance of single-core processors has somewhat stagnated in the past few years. Consequently, new computer vision algorithms will need to be parallel to run on multiple processors and be computationally scalable. One of the most promising classes of processors nowadays can be found in graphics processing units (GPU). These are devices offering a high parallelism degree, excellent numerical performance and increasing versatility, which makes them interesting to run scientific computations. In this thesis, we explore two computer vision applications with a high computational complexity that precludes them from running in real time on traditional uniprocessors. However, we show that by parallelizing subtasks and implementing them on a GPU, both applications attain their goals of running at interactive frame rates. In addition, we propose a technique for fast evaluation of arbitrarily complex functions, specially designed for GPU implementation. First, we explore the application of depth-image–based rendering techniques to the unusual configuration of two convergent, wide baseline cameras, in contrast to the usual configuration used in 3D TV, which are narrow baseline, parallel cameras. By using a backward mapping approach with a depth inpainting scheme based on median filters, we show that these techniques are adequate for free viewpoint video applications. In addition, we show that referring depth information to a global reference system is ill-advised and should be avoided. Then, we propose a background subtraction system based on kernel density estimation techniques. These techniques are very adequate for modelling complex scenes featuring multimodal backgrounds, but have not been so popular due to their huge computational and memory complexity. The proposed system, implemented in real time on a GPU, features novel proposals for dynamic kernel bandwidth estimation for the background model, selective update of the background model, update of the position of reference samples of the foreground model using a multi-region particle filter, and automatic selection of regions of interest to reduce computational cost. The results, evaluated on several databases and compared to other state-of-the-art algorithms, demonstrate the high quality and versatility of our proposal. Finally, we propose a general method for the approximation of arbitrarily complex functions using continuous piecewise linear functions, specially formulated for GPU implementation by leveraging their texture filtering units, normally unused for numerical computation. Our proposal features a rigorous mathematical analysis of the approximation error in function of the number of samples, as well as a method to obtain a suboptimal partition of the domain of the function to minimize approximation error.

A Reliable Open-Source System Architecture for the Fast Designing and Prototyping of Autonomous Multi-UAV Systems: Simulation and Experimentation

During the process of design and development of an autonomous Multi-UAV System, two main problems appear. The first one is the difficulty of designing all the modules and behaviors of the aerial multi-robot system. The second one is the difficulty of having an autonomous prototype of the system for the developers that allows to test the performance of each module even in an early stage of the project. These two problems motivate this paper. A multipurpose system architecture for autonomous multi-UAV platforms is presented. This versatile system architecture can be used by the system designers as a template when developing their own systems. The proposed system architecture is general enough to be used in a wide range of applications, as demonstrated in the paper. This system architecture aims to be a reference for all designers. Additionally, to allow for the fast prototyping of autonomous multi-aerial systems, an Open Source framework based on the previously defined system architecture is introduced. It allows developers to have a flight proven multi-aerial system ready to use, so that they can test their algorithms even in an early stage of the project. The implementation of this framework, introduced in the paper with the name of “CVG Quadrotor Swarm”, which has also the advantages of being modular and compatible with different aerial platforms, can be found at https://​github.​com/​Vision4UAV/​cvg_​quadrotor_​swarm with a consistent catalog of available modules. The good performance of this framework is demonstrated in the paper by choosing a basic instance of it and carrying out simulation and experimental tests whose results are summarized and discussed in this paper.

Movements of truncated kinesin fragments with a short or an artificial flexible neck

To investigate the role of the neck domain of kinesin, we used optical trapping nanometry to perform high-resolution measurements of the movements and forces produced by recombinant kinesin fragments in which the neck domains were shortened or replaced by an artificial random coil. Truncated kinesin fragments (K351) that contain a motor domain consisting of ≈340 aa and a short neck domain consisting of ≈11 aa showed fast movement (800 nm/s) and 8-nm steps. Such behavior was similar to that of recombinant fragments containing the full-length neck domain (K411) and to that of native kinesin. Kinesin fragments lacking the short neck domain (K340), however, showed very slow movement (<50 nm/s), as previously reported. Joining an artificial 11-aa sequence that was expected to form a flexible random chain to the motor domain (K340–chain) produced normal fast (≈700 nm/s) and stepwise movement. The results suggest that the neck domain does not act as a rigid lever arm to magnify the structural change at the catalytic domain as has been believed for myosin, but it does act as a flexible joint to guarantee the mobility of the motor domain.

Unmasking the functions of the chromaffin cell α7 nicotinic receptor by using short pulses of acetylcholine and selective blockers

Methyllycaconitine (MLA), α-conotoxin ImI, and α-bungarotoxin inhibited the release of catecholamines triggered by brief pulses of acetylcholine (ACh) (100 μM, 5 s) applied to fast-superfused bovine adrenal chromaffin cells, with IC50s of 100 nM for MLA and 300 nM for α-conotoxin ImI and α-bungarotoxin. MLA (100 nM), α-conotoxin ImI (1 μM), and α-bungarotoxin (1 μM) halved the entry of 45Ca2+ stimulated by 5-s pulses of 300 μM ACh applied to incubated cells. These supramaximal concentrations of α7 nicotinic receptor blockers depressed by 30% (MLA), 25% (α-bungarotoxin), and 50% (α-conotoxin ImI) the inward current generated by 1-s pulses of 100 μM ACh, applied to voltage-clamped chromaffin cells. In Xenopus oocytes expressing rat brain α7 neuronal nicotinic receptor for acetylcholine nAChR, the current generated by 1-s pulses of ACh was blocked by MLA, α-conotoxin ImI, and α-bungarotoxin with IC50s of 0.1 nM, 100 nM, and 1.6 nM, respectively; the current through α3β4 nAChR was unaffected by α-conotoxin ImI and α-bungarotoxin, and weakly blocked by MLA (IC50 = 1 μM). The functions of controlling the electrical activity, the entry of Ca2+, and the ensuing exocytotic response of chromaffin cells were until now exclusively attributed to α3β4 nAChR; the present results constitute the first evidence to support a prominent role of α7 nAChR in controlling such functions, specially under the more physiological conditions used here to stimulate chromaffin cells with brief pulses of ACh.

A fast, high resolution, second-order central scheme for incompressible flows

A high resolution, second-order central difference method for incompressible flows is presented. The method is based on a recent second-order extension of the classic Lax–Friedrichs scheme introduced for hyperbolic conservation laws (Nessyahu H. & Tadmor E. (1990) J. Comp. Physics. 87, 408-463; Jiang G.-S. & Tadmor E. (1996) UCLA CAM Report 96-36, SIAM J. Sci. Comput., in press) and augmented by a new discrete Hodge projection. The projection is exact, yet the discrete Laplacian operator retains a compact stencil. The scheme is fast, easy to implement, and readily generalizable. Its performance was tested on the standard periodic double shear-layer problem; no spurious vorticity patterns appear when the flow is underresolved. A short discussion of numerical boundary conditions is also given, along with a numerical example.

Slow and fast dietary proteins differently modulate postprandial protein accretion

The speed of absorption of dietary amino acids by the gut varies according to the type of ingested dietary protein. This could affect postprandial protein synthesis, breakdown, and deposition. To test this hypothesis, two intrinsically 13C-leucine-labeled milk proteins, casein (CAS) and whey protein (WP), of different physicochemical properties were ingested as one single meal by healthy adults. Postprandial whole body leucine kinetics were assessed by using a dual tracer methodology. WP induced a dramatic but short increase of plasma amino acids. CAS induced a prolonged plateau of moderate hyperaminoacidemia, probably because of a slow gastric emptying. Whole body protein breakdown was inhibited by 34% after CAS ingestion but not after WP ingestion. Postprandial protein synthesis was stimulated by 68% with the WP meal and to a lesser extent (+31%) with the CAS meal. Postprandial whole body leucine oxidation over 7 h was lower with CAS (272 ± 91 μmol⋅kg−1) than with WP (373 ± 56 μmol⋅kg−1). Leucine intake was identical in both meals (380 μmol⋅kg−1). Therefore, net leucine balance over the 7 h after the meal was more positive with CAS than with WP (P < 0.05, WP vs. CAS). In conclusion, the speed of protein digestion and amino acid absorption from the gut has a major effect on whole body protein anabolism after one single meal. By analogy with carbohydrate metabolism, slow and fast proteins modulate the postprandial metabolic response, a concept to be applied to wasting situations.

Modeling magnetar outbursts: flux enhancements and the connection with short bursts and glitches

The availability of a large amount of observational data recently collected from magnetar outbursts is now calling for a complete theoretical study of outburst characteristics. In this Letter (the first of a series dedicated to modeling magnetar outbursts), we tackle the long-standing open issue of whether or not short bursts and glitches are always connected to long-term radiative outbursts. We show that the recent detection of short bursts and glitches seemingly unconnected to outbursts is only misleading our understanding of these events. We show that, in the framework of the starquake model, neutrino emission processes in the magnetar crust limit the temperature, and therefore the luminosity. This natural limit to the maximum luminosity makes outbursts associated with bright persistent magnetars barely detectable. These events are simply seen as a small luminosity increase over the already bright quiescent state, followed by a fast return to quiescence. In particular, this is the case for 1RXS J1708–4009, 1E 1841–045, SGR 1806–20, and other bright persistent magnetars. On the other hand, a similar event (with the same energetics) in a fainter source will drive a more extreme luminosity variation and longer cooling time, as for sources such as XTE J1810–197, 1E 1547–5408, and SGR 1627–41. We conclude that the non-detection of large radiative outbursts in connection with glitches and bursts from bright persistent magnetars is not surprising per se, nor does it need any revision of the glitches and burst mechanisms as explained by current theoretical models.

Methods and algorithms for video-based multi-point frequency measuring and mapping

Software for video-based multi-point frequency measuring and mapping: http://hdl.handle.net/10045/53429

Measuring the stellar wind parameters in IGR J17544-2619 and Vela X-1 constrains the accretion physics in supergiant fast X-ray transient and classical supergiant X-ray binaries

Context. Classical supergiant X-ray binaries (SGXBs) and supergiant fast X-ray transients (SFXTs) are two types of high-mass X-ray binaries (HMXBs) that present similar donors but, at the same time, show very different behavior in the X-rays. The reason for this dichotomy of wind-fed HMXBs is still a matter of debate. Among the several explanations that have been proposed, some of them invoke specific stellar wind properties of the donor stars. Only dedicated empiric analysis of the donors’ stellar wind can provide the required information to accomplish an adequate test of these theories. However, such analyses are scarce. Aims. To close this gap, we perform a comparative analysis of the optical companion in two important systems: IGR J17544-2619 (SFXT) and Vela X-1 (SGXB). We analyze the spectra of each star in detail and derive their stellar and wind properties. As a next step, we compare the wind parameters, giving us an excellent chance of recognizing key differences between donor winds in SFXTs and SGXBs. Methods. We use archival infrared, optical and ultraviolet observations, and analyze them with the non-local thermodynamic equilibrium (NLTE) Potsdam Wolf-Rayet model atmosphere code. We derive the physical properties of the stars and their stellar winds, accounting for the influence of X-rays on the stellar winds. Results. We find that the stellar parameters derived from the analysis generally agree well with the spectral types of the two donors: O9I (IGR J17544-2619) and B0.5Iae (Vela X-1). The distance to the sources have been revised and also agree well with the estimations already available in the literature. In IGR J17544-2619 we are able to narrow the uncertainty to d = 3.0 ± 0.2 kpc. From the stellar radius of the donor and its X-ray behavior, the eccentricity of IGR J17544-2619 is constrained to e< 0.25. The derived chemical abundances point to certain mixing during the lifetime of the donors. An important difference between the stellar winds of the two stars is their terminal velocities (ν∞ = 1500 km s-1 in IGR J17544-2619 and ν∞ = 700 km s-1 in Vela X-1), which have important consequences on the X-ray luminosity of these sources. Conclusions. The donors of IGR J17544-2619 and Vela X-1 have similar spectral types as well as similar parameters that physically characterize them and their spectra. In addition, the orbital parameters of the systems are similar too, with a nearly circular orbit and short orbital period. However, they show moderate differences in their stellar wind velocity and the spin period of their neutron star which has a strong impact on the X-ray luminosity of the sources. This specific combination of wind speed and pulsar spin favors an accretion regime with a persistently high luminosity in Vela X-1, while it favors an inhibiting accretion mechanism in IGR J17544-2619. Our study demonstrates that the relative wind velocity is critical in class determination for the HMXBs hosting a supergiant donor, given that it may shift the accretion mechanism from direct accretion to propeller regimes when combined with other parameters.

Readings in English history drawn from the original sources, intended to illustrate A short history of England,

Mode of access: Internet.

A catalogue raisonné of the works of the most eminent Dutch, Flemish, and French painters; in which is included a short biographical notice of the artists, with a copious description of their principal pictures; a statement of the prices at which such pictures have been sold at public sales on the continent and in England; a reference to the galleries and private collections, in which a large portion are at present; and the names of the artists by whom they have been engraved; to which is added, a brief notice of the scholars & imitators of the great masters of the above schools:

"Reprinted for Sands and company, London and Edinburgh: 1908."