Publications associées à Iterative Potts and Blake-Zisserman minimization for the recovery of functions with discontinuities from indirect measurements

Publications associées (27)

Modeling friction and wear using an adaptive discrete-continuum coupling

When two objects slide against each other, wear and friction occur at their interface. The accumulation of wear forms what is commonly referred to as a ``third-body''. Understanding third-body evolution has significant applications in industry, where contr ...

EPFL2024

Functional data analysis with rough sample paths?

Victor Panaretos, Neda Mohammadi Jouzdani

Functional data are typically modeled as sample paths of smooth stochastic processes in order to mitigate the fact that they are often observed discretely and noisily, occasionally irregularly and sparsely. The smoothness assumption is imposed to allow for ...

TAYLOR & FRANCIS LTD2024

Traversing Time Dependent Light Fields for Daylight Glare Evaluation

Stephen William Wasilewski

To understand how daylight gives shape and life to architectural spaces, whether existing or imagined, requires quantifying its dynamism and energy. Maintaining these details presents a challenge to simulation and analysis methods that flatten data into di ...

EPFL2023

Lattice Green's function method for Atomistic/Continuum coupling

Ankit Gupta

Metal plasticity is an inherently multiscale phenomenon due to the complex long-range field of atomistic dislocations that are the primary mechanism for plastic deformation in metals. Atomistic/Continuum (A/C) coupling methods are computationally efficient ...

EPFL2023

pyFFS: A Python Library for Fast Fourier Series Computation and Interpolation with GPU Acceleration

Martin Vetterli, Paul Hurley, Matthieu Martin Jean-André Simeoni, Eric Bezzam, Sepand Kashani

Fourier transforms are an often necessary component in many computational tasks, and can be computed efficiently through the fast Fourier transform (FFT) algorithm. However, many applications involve an underlying continuous signal, and a more natural choi ...

SIAM2022

Efficient lattice Green's function method for bounded domain problems

William Curtin, Max Ludwig Hodapp, Ankit Gupta

The lattice Green's function method (LGFM) is the discrete counterpart of the continuum boundary element method and is a natural approach for solving intrinsically discrete solid mechanics problems that arise in atomistic-continuum coupling methods. Here, ...

Wiley2022

Efficient Meso-Scale Modeling of Alkali-Silica-Reaction Damage in Concrete

Ali Falsafi

The alkali-silica reaction (ASR), also known as concrete cancer, is one of the most prevalent causes of concrete degradation. In this chemical reaction, amorphous silica in the aggregates reacts with alkalis in the pore solution. By absorbing water, hydrop ...

EPFL2022

Finite element method–discrete element method bridging coupling for the modeling of gouge

Jean-François Molinari, Guillaume Anciaux, Antonio Joaquin Garcia Suarez, Manon Eugénie Voisin--Leprince

We discuss the multiscale modeling of a granular material trapped between continuum elastic domains. The amorphous granular region, usually termed “gouge,” is under high confinement pressure, to represent the loading of faults at depth. We model the granul ...

Wiley2023

Numerical Methods for First and Second Order Fully Nonlinear Partial Differential Equations

Dimitrios Gourzoulidis

This thesis focuses on the numerical analysis of partial differential equations (PDEs) with an emphasis on first and second-order fully nonlinear PDEs. The main goal is the design of numerical methods to solve a variety of equations such as orthogonal maps ...

EPFL2021

On the nonlinear Dirichlet-Neumann method and preconditioner for Newton's method

Tommaso Vanzan

The Dirichlet-Neumann (DN) method has been extensively studied for linear partial differential equations, while little attention has been devoted to the nonlinear case. In this paper, we analyze the DN method both as a nonlinear iterative method and as a p ...

Springer-Verlag2023

A first-order primal-dual method with adaptivity to local smoothness

Volkan Cevher, Maria-Luiza Vladarean

We consider the problem of finding a saddle point for the convex-concave objective

\min_x \max_y f(x) + \langle Ax, y\rangle - g^*(y)

, where

f

is a convex function with locally Lipschitz gradient and

g

is convex and possibly non-smooth. We propose an ...

2021

Immersed boundary-conformal isogeometric method for linear elliptic problems

Annalisa Buffa, Pablo Antolin Sanchez, Xiaodong Wei

We present a novel isogeometric method, namely the Immersed Boundary-Conformal Method (IBCM), that features a layer of discretization conformal to the boundary while employing a simple background mesh for the remaining domain. In this manner, we leverage t ...

2021

A Computational Comparison Between Isogeometric Analysis and Spectral Element Methods: Accuracy and Spectral Properties

Alfio Quarteroni, Ondine Gabrielle Chanon

In this paper, we carry out a systematic comparison between the theoretical properties of Spectral Element Methods and NURBS-based Isogeometric Analysis in its basic form, that is in the framework of the Galerkin method, for the approximation of the Poisso ...

SPRINGER/PLENUM PUBLISHERS2020

Functional Inverse Problems on Spheres: Theory, Algorithms and Applications

Matthieu Martin Jean-André Simeoni

Many scientific inquiries in natural sciences involve approximating a spherical field -namely a scalar quantity defined over a continuum of directions- from generalised samples of the latter (e.g. directional samples, local averages, etc). Such an approxim ...

EPFL2020

Discrete Time Analysis of Phase Detector Linear Range Extension in Sub-Sampling PLL

Yusuf Leblebici, Duygu Kostak

The discrete time analysis of the phase detector linear range extension in the first and the second order sub sampling phase-locked loop (SSPLL) is presented. The aim is to understand how much the stability and the pull-in range are affected by the linear ...

IEEE2020

Adaptive Gradient Descent without Descent

We present a strikingly simple proof that two rules are sufficient to automate gradient descent: 1) don’t increase the stepsize too fast and 2) don’t overstep the local curvature. No need for functional values, no line search, no information about the func ...

2020

Discrete Time Analysis of Phase Detector Timing Nonidealities in Type-I Sub-Sampling PLL

Yusuf Leblebici, Duygu Kostak

The analysis of the effect of sub-sampling phase detector (SSPD) timing nonidealities on Type-I sub-sampling phase-locked loop (SSPLL) is presented. The nonidealities considered are the delay between the complementary sampling clocks and the propagation de ...

IEEE2020

On the Almost Sure Convergence of Stochastic Gradient Descent in Non-Convex Problems

Volkan Cevher, Ali Kavis, Shaul Nadav Hallak

This paper analyzes the trajectories of stochastic gradient descent (SGD) to help understand the algorithm’s convergence properties in non-convex problems. We first show that the sequence of iterates generated by SGD remains bounded and converges with prob ...

2020

Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimization

Ali H. Sayed, Kun Yuan

This paper introduces a new algorithm for consensus optimization in a multi-agent network, where all agents collaboratively find a minimizer for the sum of their private functions. All decentralized algorithms rely on communications between adjacent nodes. ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Novel corrector problems with exponential decay of the resonance error for numerical homogenization

Edoardo Paganoni

Multiscale problems, such as modelling flows through porous media or predicting the mechanical properties of composite materials, are of great interest in many scientific areas. Analytical models describing these phenomena are rarely available, and one mus ...

EPFL2020