Publication

SHAPE PRIOR BASED ON STATISTICAL MAP FOR ACTIVE CONTOUR SEGMENTATION

Publications associées (38)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

The Impact of Changes in Resolution on the Persistent Homology of Images

Adélie Eliane Garin

Digital images enable quantitative analysis of material properties at micro and macro length scales, but choosing an appropriate resolution when acquiring the image is challenging. A high resolution means longer image acquisition and larger data requiremen ...

IEEE2021

Bayesian regression explains how human participants handle parameter uncertainty

Michael Herzog, Jean-Pascal Théodor Pfister, Maya Anna Jastrzebowska, Mattew Pachai

Author summary How do humans make prediction when the critical factor that influences the quality of the prediction is hidden? Here, we address this question by conducting a simple psychophysical experiment in which participants had to extrapolate a parabo ...

2020

On Vacuous and Non-Vacuous Generalization Bounds for Deep Neural Networks.

Konstantinos Pitas

Deep neural networks have been empirically successful in a variety of tasks, however their theoretical understanding is still poor. In particular, modern deep neural networks have many more parameters than training data. Thus, in principle they should over ...

EPFL2020

An Inertial Parallel and Asynchronous Forward-Backward Iteration for Distributed Convex Optimization

Colin Neil Jones, Georgios Stathopoulos

Two characteristics that make convex decomposition algorithms attractive are simplicity of operations and generation of parallelizable structures. In principle, these schemes require that all coordinates update at the same time, i.e., they are synchronous ...

SPRINGER/PLENUM PUBLISHERS2019

A novel approach is presented for constructing polynomial chaos representations of scalar quantities of interest (QoI) that extends previously developed methods for adaptation in Homogeneous Chaos spaces. In this work, we develop a Bayesian formulation of ...

ROYAL SOC2018

, ,

The currently adopted practice for uncertainty quantification of thermal-hydraulics code predictions is done through statistical sampling where the code is evaluated multiple times using different values of input parameters that are randomly generated acco ...

2016

, , ,

Differential privacy (DP) has become widely accepted as a rigorous definition of data privacy, with stronger privacy guarantees than traditional statistical methods. However, recent studies have shown that for reasonable privacy budgets, differential priva ...

2015

A Modulated Closed Form solution for Quantitative Susceptibility Mapping - A thorough evaluation and comparison to iterative methods based on edge prior knowledge

Rolf Gruetter, Yves Wiaux, José Pedro Rebelo Ferreira Marques, Diana Khabipova

The aim of this study is to perform a thorough comparison of quantitative susceptibility mapping (QSM) techniques and their dependence on the assumptions made. The compared methodologies were: two iterative single orientation methodologies minimizing the l ...

Elsevier2015

, , , , ,

Ultrasound segmentation is a challenging problem due to the inherent speckle and some artifacts like shadows, attenuation and signal dropout. Existing methods need to include strong priors like shape priors or analytical intensity models to succeed in the ...

Public Library Science2014

ABC Reinforcement Learning

Christos Dimitrakakis, Nikolaos Tziortziotis

This paper introduces a simple, general framework for likelihood-free Bayesian reinforcement learning, through Approximate Bayesian Computation (ABC). The main advantage is that we only require a prior distribution on a class of simulators (generative mode ...

2013