1,720,990 research outputs found
Effective models and predictability of chaotic multiscale systems via machine learning
Full text linkUnderstanding and modeling the dynamics of multiscale systems is a problem of considerable interest both for theory and applications. For unavoidable practical reasons, in multiscale systems, there is the need to eliminate from the description the fast and small-scale degrees of freedom and thus build effective models for only the slow and large-scale degrees of freedom. When there is a wide scale separation between the degrees of freedom, asymptotic techniques, such as the adiabatic approximation, can be used for devising such effective models, while away from this limit there exist no systematic techniques. Here, we scrutinize the use of machine learning, based on reservoir computing, to build data-driven effective models of multiscale chaotic systems. We show that, for a wide scale separation, machine learning generates effective models akin to those obtained using multiscale asymptotic techniques and, remarkably, remains effective in predictability also when the scale separation is reduced. We also show that predictability can be improved by hybridizing the reservoir with an imperfect model
Optimal collision avoidance in swarms of active Brownian particles
Full text linkThe effectiveness of collective navigation of biological or artificial agents requires to accommodate for contrasting requirements, such as staying in a group while avoiding close encounters and at the same time limiting the energy expenditure for maneuvering. Here, we address this problem by considering a system of active Brownian particles in a finite two-dimensional domain and ask what is the control that realizes the optimal tradeoff between collision avoidance and control expenditure. We couch this problem in the language of optimal stochastic control theory and by means of a mean-field game approach we derive an analytic mean-field solution, characterized by a second-order phase transition in the alignment order parameter. We find that a mean-field version of a classical model for collective motion based on alignment interactions (Vicsek model) performs remarkably close to the optimal control. Our results substantiate the view that observed group behaviors may be explained as the result of optimizing multiple objectives and offer a theoretical ground for biomimetic algorithms used for artificial agents
A Parametric Approach to Virtual Miking for Sources of Arbitrary Directivity
Full text linkIn this article we propose a methodology for the reconstruction of sound fields in arbitrary locations based on the signals acquired by a spatial distribution of compact microphone arrays (virtual miking). The proposed method is suitable for operating in reverberant environments, thanks to a two-stage analysis process, the former of which aims at separating the direct and the diffuse components of the sound field. The method that we propose is inherently parametric, as the sources of the acoustic scene are characterized by parameters describing location and directivity (spherical harmonics expansion), which are extracted from the exterior model of the direct component of the sound field. Once the parameters of the sources are extracted, the direct sound field at an arbitrary location is reconstructed. The diffuse component is reconstructed from the joint knowledge of the diffuse component at the locations of the distributed microphone arrays, under the assumption of isotropic behavior. Results show that the proposed technique is able to analyze the sound field and reconstruct the parameters of the sources that are active in the scene. In addition, the synthesis of the signals at the virtual microphone locations turns out to accurately match (in terms of spatial cues) the actual sound field, as measured by a microphone places in the desired location
Generalization from correlated sets of patterns in the perceptron
Full text linkGeneralization is a central aspect of learning theory. Here, we propose a framework that explores an auxiliary task-dependent notion of generalization, and attempts to quantitatively answer the following question: given two sets of patterns with a given degree of dissimilarity, how easily will a network be able to 'unify' their interpretation? This is quantified by the volume of the configurations of synaptic weights that classify the two sets in a similar manner. To show the applicability of our idea in a concrete setting, we compute this quantity for the perceptron, a simple binary classifier, using the classical statistical physics approach in the replica-symmetric ansatz. In this case, we show how an analytical expression measures the 'distance-based capacity', the maximum load of patterns sustainable by the network, at fixed dissimilarity between patterns and fixed allowed number of errors. This curve indicates that generalization is possible at any distance, but with decreasing capacity. We propose that a distance-based definition of generalization may be useful in numerical experiments with real-world neural networks, and to explore computationally sub-dominant sets of synaptic solutions
Arrays of first-order steerable differential microphones
Full text linkThe literature is rich with techniques for the design of small-size Differential Microphone Arrays (DMAs), known for their almost frequency-invariant beampatterns and low computational cost. Few works, instead, discuss the properties of beamformers based on multiple DMA units. In this paper, we consider arbitrarily shaped planar arrays of DMA units. In turn, each DMA unit is a first-order continuously-steerable differential microphone characterized by an arbitrary configuration of omnidirectional sensors and a symmetric beampattern. We present a beamforming technique that, assumed all the DMA units to steer identical beams in the same direction, allows us to approach the behavior of a Delay-And-Sum beamformer or Super-Directive beamformer by solely varying a single scalar parameter. Efficient implementations of the proposed beamformers can be developed by taking into account that, for a wide range of frequencies, the values of such a parameter are practically invariant with respect to the geometry of the array
Two-Stage Beamforming With Arbitrary Planar Arrays of Differential Microphone Array Units
Full text linkDifferential Microphone Arrays (DMAs) are of great interest in the literature on small-sized microphone arrays, due to their good directivity properties and nearly frequency-invariant spatial responses. Recently developed beamforming techniques combine multiple DMA units to form flexible two-stage spatial filtering systems, where the output of each DMA is fed into a higher-level filter, called virtual filter, for further processing. In this manuscript, we analyze and discuss some properties of a broad class of two-stage beamformers with arbitrary planar geometry. In this context, the DMA units are all assumed to have the same directivity pattern of arbitrary order and can be characterized by a variable number of omnidirectional sensors organized in an arbitrary geometry. For any given choice of the virtual array filter, we introduce a closed-form optimization procedure to design DMA filters that maximize the White Noise Gain (WNG) or the Directivity Factor (DF) of the resulting two-stage beamformer at any frequency. Based on this frequency-dependent design, we propose a frequency-invariant design of the two-stage beamformer and we compare the performance of the two approaches. Finally, we propose two possible computational schemes for the proposed generic two-stage spatial filtering system and discuss their efficiency in performing filtering, steering, and changing beampattern
Efficient Implementations of First-Order Steerable Differential Microphone Arrays with Arbitrary Planar Geometry
Full text linkWe present a spatial filtering approach to first-order steerable Differential Microphone Arrays (DMAs) with arbitrary planar geometry. In particular, the design of the spatial filter is based on a recently proposed frequency-domain design methodology that approximates, in a least-square sense, a target beampattern using the Jacobi-Anger expansion involving Bessel functions. Despite the generality of that approach, however, its computational cost turns out to be excessive when working with limited processing resources. The beamforming technique proposed in this manuscript overcomes this issue by exploiting the fact that in DMAs the spacing between sensors is typically smaller than the smallest wavelength of audio signals of interest. This allows us to substitute zero- and first-order Bessel functions with their Taylor series approximation truncated to the first order. Moreover, we show that this approximation allows us to derive an efficient discrete-time-domain implementation of first-order steerable differential beamformers based on arrays with arbitrary geometries
A pilot study about the upper limb kinematics of a pit crew of a F1 Racing Team during the pit stop
No full textUniform linear arrays of first-order steerable differential microphones
Full text linkWe propose a spatial filtering method for linear arrays of First-Order Steerable Differential Microphones FOSDMs, which operates in two layers. In the former, signals acquired by individual microphones are locally filtered to produce the outputs of the FOSDMs. In the latter, the outputs of the FOSDMs are processed by another filter. We analyse different design methodologies and study the conditions under which the two filtering layers can be decoupled. The proposed two-layer spatial filter can be flexibly controlled with a single scalar parameter, which can be chosen, for example, to maximize the White Noise Gain like in a Delay-and-Sum beamformer; or to maximize the Directivity Factor like in a Super-Directive beamformer; without needing any matrix inversion. The effectiveness of the proposed beamforming method is compared with traditional spatial filtering techniques using different metrics
Soundfield Reconstruction in Reverberant Rooms Based on Compressive Sensing and Image-Source Models of Early Reflections
No full textThe estimation of the soundfield in locations different from the measurement points in a room is a complex problem widely discussed in the literature. One of the key challenges in virtual acoustics is soundfield reconstruction in environments characterized by nearfield sources and strong reverberation. Most of the existing solutions are computationally expensive and they often just achieve the reconstruction of the direct soundfield. Considering a sparse distribution of acoustic sources in a room and a compressive sensing framework, in this work, we propose a method that targets the reconstruction of both the direct and the reverberant soundfield by explicitly modeling early reflections as near-field sources. We show how, by exploiting some loose prior knowledge on the position of the source and the geometry of the environment, the computational complexity can be reduced, while ensuring robustness to errors in the prior knowledge. The proposed method is validated through simulations
- …
