Abstract-We present a new family of snakes that satisfy the property of multiresolution by exploiting subdivision schemes. We show in a generic way how to construct such snakes based on an admissible subdivision mask. We derive the necessary energy formulations and provide the formulas for their efficient computation. Depending on the choice of the mask, such models have the ability to reproduce trigonometric or polynomial curves. They can also be designed to be interpolating, a property that is useful in user-interactive applications. We provide explicit examples of subdivision snakes and illustrate their use for the segmentation of bioimages. We show that they are robust in the presence of noise and provide a multiresolution algorithm to enlarge their basin of attraction, which decreases their dependence on initialization compared to singleresolution snakes. We show the advantages of the proposed model in terms of computation and segmentation of structures with different sizes.

This paper deals with the resolution of inverse problems in a periodic setting or, in other terms, the reconstruction of periodic continuous-domain signals from their noisy measurements. We focus on two reconstruction paradigms: variational and statistical. In the variational approach, the reconstructed signal is solution to an optimization problem that establishes a tradeoff between fidelity to the data and smoothness conditions via a quadratic regularization associated to a linear operator. In the statistical approach, the signal is modeled as a stationary random process defined from a Gaussian white noise and a whitening operator; one then looks for the optimal estimator in the mean-square sense. We give a generic form of the reconstructed signals for both approaches, allowing for a rigorous comparison of the two. We fully characterize the conditions under which the two formulations yield the same solution, which is a periodic spline in the case of sampling measurements. We also show that this equivalence between the two approaches remains valid on simulations for a broad class of problems. This extends the practical range of applicability of the variational method.

In this review article, we present the major insights from and challenges faced in the acquisition, analysis and modeling of astrocyte calcium activity, aiming at bridging the gap between those fields to crack the complex astrocyte \enquote{Calcium Code}. We then propose strategies to reinforce interdisciplinary collaborative projects to unravel astrocyte function in health and disease.

No abstract

Our motivation is the design of efficient algorithms to process closed curves represented by basis functions or wavelets. To that end, we introduce an inner-product calculus to evaluate correlations and L2 distances between such curves. In particular, we present formulas for the direct and exact evaluation of correlation matrices in the case of closed (i.e., periodic) parametric curves and periodic signals. We give simplifications for practical cases that involve B-splines. To illustrate this approach, we also propose a least-squares approximation scheme that is able to resample curves while minimizing aliasing artifacts. Another application is the exact calculation of the enclosed area.

Astrocytes regulate neuronal information processing through a variety of spatio-temporal calcium signals. Recent advances in calcium imaging have started to shine light on astrocytic activity, but the complexity and size of the recorded data strongly call for more advanced computational analysis tools. Their development is currently hindered by the lack of reliable, labeled annotations that are essential for the evaluation of algorithms and the training of learning-based methods. To solve this labeling problem, we have designed a generator of 2D/3D lattice light sheet microscopy (LLSM) sequences which realistically depict the calcium dynamics of astrocytes. By closely modeling calcium kinetics in real astrocytic ramifications, the generated datasets open the door for the deployment of convolutional neural networks in LLSM.

Shape segmentation is an active field of research in biomedical imaging. In this context, we present a new parameterization of a snake that is locally refinable. We introduce the possibility of locally increasing the approximation power of the parametric model by inserting basis functions at a specific location. This is controlled by a user-interface that permits the refinement of an initial segmentation around an anchor position selected by a user. Our approach relies on scaling functions that satisfy the refinement relation and are related to wavelets. We also derive explicit formulas for the energy functions associated to our new parameterization. We demonstrate the accuracy of our snake and its robustness under noisy conditions on phantom data. We also present segmentation results on real cell images, which are our main target. The algorithm is made freely available as a plugin for the open source platform Icy.

A B S T R A C TIn applications that involve interactive curve and surface modeling, the intuitive manipulation of shapes is crucial. For instance, user interaction is facilitated if a geometrical object can be manipulated through control points that interpolate the shape itself. Additionally, models for shape representation often need to provide local shape control and they need to be able to reproduce common shape primitives such as ellipsoids, spheres, cylinders, or tori. We present a general framework to construct families of compactly-supported interpolators that are piecewise-exponential polynomial. They can be designed to satisfy regularity constraints of any order and they enable one to build parametric deformable shape models by suitable linear combinations of interpolators. They allow to change the resolution of shapes based on the refinability of B-splines. We illustrate their use on examples to construct shape models that involve curves and surfaces with applications to interactive modeling and character design.