2,603 research outputs found
Operation of a 1-Liter-Volume Gaseous Argon Scintillation Counter
We have built a gas-phase argon ionization detector to measure small nuclear
recoil energies (< 10 keVee). In this paper, we describe the detector response
to X-ray and gamma calibration sources, including analysis of pulse shapes,
software triggers, optimization of gas content, and energy- and
position-dependence of the signal. We compare our experimental results against
simulation using a 5.9-keV X-ray source, as well as higher-energy gamma sources
up to 1332 keV. We conclude with a description of the detector, DAQ, and
software settings optimized for a measurement of the low-energy nuclear
quenching factor in gaseous argon. This work was performed under the auspices
of the U.S. Department of Energy by Lawrence Livermore National Laboratory in
part under Contract W-7405-Eng-48 and in part under Contract DE-AC52-07NA27344.
Funded by Lab-wide LDRD. LLNL-JRNL-415990-DRAFT.Comment: 29 pages, single-column, double-spaced, 21 figure
3D time series analysis of cell shape using Laplacian approaches
Background:
Fundamental cellular processes such as cell movement, division or food uptake critically depend on cells being able to change shape. Fast acquisition of three-dimensional image time series has now become possible, but we lack efficient tools for analysing shape deformations in order to understand the real three-dimensional nature of shape changes.
Results:
We present a framework for 3D+time cell shape analysis. The main contribution is three-fold: First, we develop a fast, automatic random walker method for cell segmentation. Second, a novel topology fixing method is proposed to fix segmented binary volumes without spherical topology. Third, we show that algorithms used for each individual step of the analysis pipeline (cell segmentation, topology fixing, spherical parameterization, and shape representation) are closely related to the Laplacian operator. The framework is applied to the shape analysis of neutrophil cells.
Conclusions:
The method we propose for cell segmentation is faster than the traditional random walker method or the level set method, and performs better on 3D time-series of neutrophil cells, which are comparatively noisy as stacks have to be acquired fast enough to account for cell motion. Our method for topology fixing outperforms the tools provided by SPHARM-MAT and SPHARM-PDM in terms of their successful fixing rates. The different tasks in the presented pipeline for 3D+time shape analysis of cells can be solved using Laplacian approaches, opening the possibility of eventually combining individual steps in order to speed up computations
Event-triggered Learning
The efficient exchange of information is an essential aspect of intelligent
collective behavior. Event-triggered control and estimation achieve some
efficiency by replacing continuous data exchange between agents with
intermittent, or event-triggered communication. Typically, model-based
predictions are used at times of no data transmission, and updates are sent
only when the prediction error grows too large. The effectiveness in reducing
communication thus strongly depends on the quality of the prediction model. In
this article, we propose event-triggered learning as a novel concept to reduce
communication even further and to also adapt to changing dynamics. By
monitoring the actual communication rate and comparing it to the one that is
induced by the model, we detect a mismatch between model and reality and
trigger model learning when needed. Specifically, for linear Gaussian dynamics,
we derive different classes of learning triggers solely based on a statistical
analysis of inter-communication times and formally prove their effectiveness
with the aid of concentration inequalities
Optimising Spatial and Tonal Data for PDE-based Inpainting
Some recent methods for lossy signal and image compression store only a few
selected pixels and fill in the missing structures by inpainting with a partial
differential equation (PDE). Suitable operators include the Laplacian, the
biharmonic operator, and edge-enhancing anisotropic diffusion (EED). The
quality of such approaches depends substantially on the selection of the data
that is kept. Optimising this data in the domain and codomain gives rise to
challenging mathematical problems that shall be addressed in our work.
In the 1D case, we prove results that provide insights into the difficulty of
this problem, and we give evidence that a splitting into spatial and tonal
(i.e. function value) optimisation does hardly deteriorate the results. In the
2D setting, we present generic algorithms that achieve a high reconstruction
quality even if the specified data is very sparse. To optimise the spatial
data, we use a probabilistic sparsification, followed by a nonlocal pixel
exchange that avoids getting trapped in bad local optima. After this spatial
optimisation we perform a tonal optimisation that modifies the function values
in order to reduce the global reconstruction error. For homogeneous diffusion
inpainting, this comes down to a least squares problem for which we prove that
it has a unique solution. We demonstrate that it can be found efficiently with
a gradient descent approach that is accelerated with fast explicit diffusion
(FED) cycles. Our framework allows to specify the desired density of the
inpainting mask a priori. Moreover, is more generic than other data
optimisation approaches for the sparse inpainting problem, since it can also be
extended to nonlinear inpainting operators such as EED. This is exploited to
achieve reconstructions with state-of-the-art quality.
We also give an extensive literature survey on PDE-based image compression
methods
- …