Parametric B-Spline Snakes on Distance Maps—Application to Segmentation of Histology Images

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

BackgroundTinnitus is a heterogeneous condition which may be associated with moderate to severe disability, but the reasons why only a subset of individuals is burdened by the condition are not fully clear. Ecological momentary assessment (EMA) allows a be ...

There has been a recent surge of interest in the study of asymptotic reconstruction performance in various cases of generalized linear estimation problems in the teacher-student setting, especially for the case of i.i.d standard normal matrices. Here, we g ...

We describe the first gradient methods on Riemannian manifolds to achieve accelerated rates in the non-convex case. Under Lipschitz assumptions on the Riemannian gradient and Hessian of the cost function, these methods find approximate first-order critical ...

A class of deep Boltzmann machines is considered in the simplified framework of a quenched system with Gaussian noise and independent entries. The quenched pressure of a K-layers spin glass model is studied allowing interactions only among consecutive laye ...

We characterize the solution of a broad class of convex optimization problems that address the reconstruction of a function from a finite number of linear measurements. The underlying hypothesis is that the solution is decomposable as a finite sum of compo ...

We consider distributed optimization over several devices, each sending incremental model updates to a central server. This setting is considered, for instance, in federated learning. Various schemes have been designed to compress the model updates in orde ...

Years of globalization, outsourcing and cost cutting have increased supply chain vulnerability calling for more effective risk mitigation strategies. In our research, we analyze supply chain disruptions in a production setting. Using a bilevel optimization ...

Background: Functional connectomes (FCs) have been shown to provide a reproducible individual fingerprint, which has opened the possibility of personalized medicine for neuro/psychiatric disorders. Thus, developing accurate ways to compare FCs is essential ...

This paper examines the minimization of the cost for an expected random production output, given an assembly of finished goods from two random inputs, matched in two categories. We describe the optimal input portfolio, first using the standard normal appro ...

This paper develops a methodology for regret minimization with stochastic first-order oracle feedback in online, constrained, non-smooth, non-convex problems. In this setting, the minimization of external regret is beyond reach for first-order methods, and ...

Parametric B-Spline Snakes on Distance Maps—Application to Segmentation of Histology Images

Chat with Graph Search

Daily Contributors of Tinnitus Loudness and Distress: An Ecological Momentary Assessment Study

Asymptotic Errors for Teacher-Student Convex Generalized Linear Models (Or: How to Prove Kabashima’s Replica Formula)

An Accelerated First-Order Method for Non-convex Optimization on Manifolds

Deep Boltzmann Machines: Rigorous Results at Arbitrary Depth

Convex optimization in sums of Banach spaces

Stochastic distributed learning with gradient quantization and double-variance reduction

Modeling and mitigating supply chain disruptions as a bilevel network flow problem

Geodesic Distance on Optimally Regularized Functional Connectomes Uncovers Individual Fingerprints

Optimal Matching of Random Parts

Regret Minimization in Stochastic Non-Convex Learning via a Proximal-Gradient Approach