3,724 research outputs found
ATLAS Jet Energy Scale
Jets originating from the fragmentation of quarks and gluons are the most
common, and complicated, final state objects produced at hadron colliders. A
precise knowledge of their energy calibration is therefore of great importance
at experiments at the Large Hadron Collider at CERN, while is very difficult to
ascertain. We present in-situ techniques and results for the jet energy scale
at ATLAS using recent collision data. ATLAS has demonstrated an understanding
of the necessary jet energy corrections to within \approx 4% in the central
region of the calorimeter.Comment: Proceedings from XXXI Physics in Collisio
Recursive Compressed Sensing
We introduce a recursive algorithm for performing compressed sensing on
streaming data. The approach consists of a) recursive encoding, where we sample
the input stream via overlapping windowing and make use of the previous
measurement in obtaining the next one, and b) recursive decoding, where the
signal estimate from the previous window is utilized in order to achieve faster
convergence in an iterative optimization scheme applied to decode the new one.
To remove estimation bias, a two-step estimation procedure is proposed
comprising support set detection and signal amplitude estimation. Estimation
accuracy is enhanced by a non-linear voting method and averaging estimates over
multiple windows. We analyze the computational complexity and estimation error,
and show that the normalized error variance asymptotically goes to zero for
sublinear sparsity. Our simulation results show speed up of an order of
magnitude over traditional CS, while obtaining significantly lower
reconstruction error under mild conditions on the signal magnitudes and the
noise level.Comment: Submitted to IEEE Transactions on Information Theor
Unscheduled consultations: a cross- sectional study of patients using walk-in emergency clinics
Questions under study/principles
Switzerland experiences a strong increase of the unscheduled medical consultations which participates to the congestion of the hospital emergency departments. In this context, many walk-in emergency clinics have been established but less is known about the characteristics of the patients who visit these structures.
Methods
First, retrospective data about frequentation between 2011 and 2014 of three walk-in emergency clinics in Lausanne were analysed. Secondly, a questionnaire about sociodemographic data, access to care, patient's usual health status, and their global resources to solve their health problem was submitted during one week in the waiting room of each clinic from 1-20 September 2014, to patients aged 16 or older.
Results
The overall number of consultations increased globally by 6.9%, whereas Lausanne's population only increased by 2.9%. 305 (87%) patients were included for the questionnaire. The mean age of participants was 40.6 years old, 50% were women and 65% were Swiss. 76% of patients had a primary care physician (PCP), 38.7% of them said they had try to contact him in the last 24h for their problem. Among them, 81% did not get an appointment on the same day.
Conclusions
Our study shows that many patients suffering from a non-life-threatening health problem use walk-in emergency clinics as their PCP. Walk-in emergency clinics seem to respond to patient's needs and to the change in the way that care is consumed
Phase Retrieval for Sparse Signals: Uniqueness Conditions
In a variety of fields, in particular those involving imaging and optics, we
often measure signals whose phase is missing or has been irremediably
distorted. Phase retrieval attempts the recovery of the phase information of a
signal from the magnitude of its Fourier transform to enable the reconstruction
of the original signal. A fundamental question then is: "Under which conditions
can we uniquely recover the signal of interest from its measured magnitudes?"
In this paper, we assume the measured signal to be sparse. This is a natural
assumption in many applications, such as X-ray crystallography, speckle imaging
and blind channel estimation. In this work, we derive a sufficient condition
for the uniqueness of the solution of the phase retrieval (PR) problem for both
discrete and continuous domains, and for one and multi-dimensional domains.
More precisely, we show that there is a strong connection between PR and the
turnpike problem, a classic combinatorial problem. We also prove that the
existence of collisions in the autocorrelation function of the signal may
preclude the uniqueness of the solution of PR. Then, assuming the absence of
collisions, we prove that the solution is almost surely unique on 1-dimensional
domains. Finally, we extend this result to multi-dimensional signals by solving
a set of 1-dimensional problems. We show that the solution of the
multi-dimensional problem is unique when the autocorrelation function has no
collisions, significantly improving upon a previously known result.Comment: submitted to IEEE TI
Bits from Photons: Oversampled Image Acquisition Using Binary Poisson Statistics
We study a new image sensor that is reminiscent of traditional photographic
film. Each pixel in the sensor has a binary response, giving only a one-bit
quantized measurement of the local light intensity. To analyze its performance,
we formulate the oversampled binary sensing scheme as a parameter estimation
problem based on quantized Poisson statistics. We show that, with a
single-photon quantization threshold and large oversampling factors, the
Cram\'er-Rao lower bound (CRLB) of the estimation variance approaches that of
an ideal unquantized sensor, that is, as if there were no quantization in the
sensor measurements. Furthermore, the CRLB is shown to be asymptotically
achievable by the maximum likelihood estimator (MLE). By showing that the
log-likelihood function of our problem is concave, we guarantee the global
optimality of iterative algorithms in finding the MLE. Numerical results on
both synthetic data and images taken by a prototype sensor verify our
theoretical analysis and demonstrate the effectiveness of our image
reconstruction algorithm. They also suggest the potential application of the
oversampled binary sensing scheme in high dynamic range photography
Fast and Robust Parametric Estimation of Jointly Sparse Channels
We consider the joint estimation of multipath channels obtained with a set of
receiving antennas and uniformly probed in the frequency domain. This scenario
fits most of the modern outdoor communication protocols for mobile access or
digital broadcasting among others.
Such channels verify a Sparse Common Support property (SCS) which was used in
a previous paper to propose a Finite Rate of Innovation (FRI) based sampling
and estimation algorithm. In this contribution we improve the robustness and
computational complexity aspects of this algorithm. The method is based on
projection in Krylov subspaces to improve complexity and a new criterion called
the Partial Effective Rank (PER) to estimate the level of sparsity to gain
robustness.
If P antennas measure a K-multipath channel with N uniformly sampled
measurements per channel, the algorithm possesses an O(KPNlogN) complexity and
an O(KPN) memory footprint instead of O(PN^3) and O(PN^2) for the direct
implementation, making it suitable for K << N. The sparsity is estimated online
based on the PER, and the algorithm therefore has a sense of introspection
being able to relinquish sparsity if it is lacking. The estimation performances
are tested on field measurements with synthetic AWGN, and the proposed
algorithm outperforms non-sparse reconstruction in the medium to low SNR range
(< 0dB), increasing the rate of successful symbol decodings by 1/10th in
average, and 1/3rd in the best case. The experiments also show that the
algorithm does not perform worse than a non-sparse estimation algorithm in
non-sparse operating conditions, since it may fall-back to it if the PER
criterion does not detect a sufficient level of sparsity.
The algorithm is also tested against a method assuming a "discrete" sparsity
model as in Compressed Sensing (CS). The conducted test indicates a trade-off
between speed and accuracy.Comment: 11 pages, 9 figures, submitted to IEEE JETCAS special issue on
Compressed Sensing, Sep. 201
A Multiresolution Census Algorithm for Calculating Vortex Statistics in Turbulent Flows
The fundamental equations that model turbulent flow do not provide much
insight into the size and shape of observed turbulent structures. We
investigate the efficient and accurate representation of structures in
two-dimensional turbulence by applying statistical models directly to the
simulated vorticity field. Rather than extract the coherent portion of the
image from the background variation, as in the classical signal-plus-noise
model, we present a model for individual vortices using the non-decimated
discrete wavelet transform. A template image, supplied by the user, provides
the features to be extracted from the vorticity field. By transforming the
vortex template into the wavelet domain, specific characteristics present in
the template, such as size and symmetry, are broken down into components
associated with spatial frequencies. Multivariate multiple linear regression is
used to fit the vortex template to the vorticity field in the wavelet domain.
Since all levels of the template decomposition may be used to model each level
in the field decomposition, the resulting model need not be identical to the
template. Application to a vortex census algorithm that records quantities of
interest (such as size, peak amplitude, circulation, etc.) as the vorticity
field evolves is given. The multiresolution census algorithm extracts coherent
structures of all shapes and sizes in simulated vorticity fields and is able to
reproduce known physical scaling laws when processing a set of voriticity
fields that evolve over time
Locating the Source of Diffusion in Large-Scale Networks
How can we localize the source of diffusion in a complex network? Due to the
tremendous size of many real networks--such as the Internet or the human social
graph--it is usually infeasible to observe the state of all nodes in a network.
We show that it is fundamentally possible to estimate the location of the
source from measurements collected by sparsely-placed observers. We present a
strategy that is optimal for arbitrary trees, achieving maximum probability of
correct localization. We describe efficient implementations with complexity
O(N^{\alpha}), where \alpha=1 for arbitrary trees, and \alpha=3 for arbitrary
graphs. In the context of several case studies, we determine how localization
accuracy is affected by various system parameters, including the structure of
the network, the density of observers, and the number of observed cascades.Comment: To appear in Physical Review Letters. Includes pre-print of main
paper, and supplementary materia
Sparse sampling of signal innovations
Sparse sampling of continuous-time sparse signals is addressed. In particular, it is shown that sampling at the rate of innovation is possible, in some sense applying Occam's razor to the sampling of sparse signals. The noisy case is analyzed and solved, proposing methods reaching the optimal performance given by the Cramer-Rao bounds. Finally, a number of applications have been discussed where sparsity can be taken advantage of. The comprehensive coverage given in this article should lead to further research in sparse sampling, as well as new applications. One main application to use the theory presented in this article is ultra-wide band (UWB) communications
- âŠ