249 resultados para H-line graphs
Resumo:
Rapid orientating movements of the eyes are believed to be controlled ballistically. The mechanism underlying this control is thought to involve a comparison between the desired displacement of the eye and an estimate of its actual position (obtained from the integration of the eye velocity signal). This study shows, however, that under certain circumstances fast gaze movements may be controlled quite differently and may involve mechanisms which use visual information to guide movements prospectively. Subjects were required to make large gaze shifts in yaw towards a target whose location and motion were unknown prior to movement onset. Six of those tested demonstrated remarkable accuracy when making gaze shifts towards a target that appeared during their ongoing movement. In fact their level of accuracy was not significantly different from that shown when they performed a 'remembered' gaze shift to a known stationary target (F-3,F-15 = 0.15, p > 0.05). The lack of a stereotypical relationship between the skew of the gaze velocity profile and movement duration indicates that on-line modifications were being made. It is suggested that a fast route from the retina to the superior colliculus could account for this behaviour and that models of oculomotor control need to be updated.
Resumo:
For many applications of emotion recognition, such as virtual agents, the system must select responses while the user is speaking. This requires reliable on-line recognition of the user’s affect. However most emotion recognition systems are based on turnwise processing. We present a novel approach to on-line emotion recognition from speech using Long Short-Term Memory Recurrent Neural Networks. Emotion is recognised frame-wise in a two-dimensional valence-activation continuum. In contrast to current state-of-the-art approaches, recognition is performed on low-level signal frames, similar to those used for speech recognition. No statistical functionals are applied to low-level feature contours. Framing at a higher level is therefore unnecessary and regression outputs can be produced in real-time for every low-level input frame. We also investigate the benefits of including linguistic features on the signal frame level obtained by a keyword spotter.
Resumo:
Hardware synthesis from dataflow graphs of signal processing systems is a growing research area as focus shifts to high level design methodologies. For data intensive systems, dataflow based synthesis can lead to an inefficient usage of memory due to the restrictive nature of synchronous dataflow and its inability to easily model data reuse. This paper explores how dataflow graph changes can be used to drive both the on-chip and off-chip memory organisation and how these memory architectures can be mapped to a hardware implementation. By exploiting the data reuse inherent to many image processing algorithms and by creating memory hierarchies, off-chip memory bandwidth can be reduced by a factor of a thousand from the original dataflow graph level specification of a motion estimation algorithm, with a minimal increase in memory size. This analysis is verified using results gathered from implementation of the motion estimation algorithm on a Xilinx Virtex-4 FPGA, where the delay between the memories and processing elements drops from 14.2 ns down to 1.878 ns through the refinement of the memory architecture. Care must be taken when modeling these algorithms however, as inefficiencies in these models can be easily translated into overuse of hardware resources.
Resumo:
The random displacement of magnetic field lines in the presence of magnetic turbulence in plasmas is investigated from first principles. A two-component (slab/two-dimensional composite) model for the turbulence spectrum is employes. An analytical investigation of the asymptotic behavior of the field-line mean square displacement (FL-MSD) is carried out. It is shown that the magnetic field lines behave superdifusively for every large values of the position variable z, since the FL-MSD sigma varies as sigma similar to z(4/3). An intermediate diffusive regime may also possible exist for finite values of z under conditions which are explicitly determined in terms of the intrinsic turbulent plasma parameters. The superdiffusie asymptotic result is confirmed numerically via an iterative algorithm. The relevance to previous resuslts is discussed.
Resumo:
The random walk of magnetic field lines in the presence of magnetic turbulence in plasmas is investigated from first principles. An isotropic model is employed for the magnetic turbulence spectrum. An analytical investigation of the asymptotic behavior of the field-line mean-square displacement is carried out. in terms of the position variable z. It is shown that varies as similar to z ln z for large distance z. This result corresponds to a superdiffusive behavior of field line wandering. This investigation complements previous work, which relied on a two-component model for the turbulence spectrum. Contrary to that model, quasilinear theory appears to provide an adequate description of the field line random walk for isotropic turbulence.