Concept

Partition de l'unité

Publications associées (10)

MATHICSE Technical Report: THU-Splines - Highly Localized Refinement on Smooth Unstructured Splines

We present a novel method named truncated hierarchical unstructured splines (THU-splines) that supports both local h-refinement and unstructured quadrilateral meshes. In a THU-spline construction, an unstructured quadrilateral mesh is taken as the input co ...

MATHICSE2021

Efficient Greedy Coordinate Descent for Composite Problems

Martin Jaggi, Sebastian Urban Stich, Anastasiia Koloskova, Sai Praneeth Reddy Karimireddy

Coordinate descent with random coordinate selection is the current state of the art for many large scale optimization problems. However, greedy selection of the steepest coordinate on smooth problems can yield convergence rates independent of the dimension ...

MICROTOME PUBLISHING2019

Efficient Greedy Coordinate Descent for Composite Problems

Martin Jaggi, Sebastian Urban Stich, Anastasiia Koloskova, Sai Praneeth Reddy Karimireddy

2019

Mumford-Shah and Potts Regularization for Manifold-Valued Data

Martin Kurt Storath

Mumford-Shah and Potts functionals are powerful variational models for regularization which are widely used in signal and image processing; typical applications are edge-preserving denoising and segmentation. Being both non-smooth and non-convex, they are ...

Springer2016

Numerical characterization of bump formation in the runaway electron tail

Joan Decker

Runaway electrons are generated in a magnetized plasma when the parallel electric field exceeds a critical value. For such electrons with energies typically reaching tens of MeV, the AbrahamâLorentzâDirac (ALD) radiation force, in reaction to the synch ...

Iop Publishing Ltd2016

Optimized Kaiser-Bessel Window Functions for Computed Tomography

Michaël Unser, Cédric René Jean Vonesch, John Paul Ward, Masih Nilchian

Kaiser-Bessel window functions are frequently used to discretize tomographic problems because they have two desirable properties: 1) their short support leads to a low computational cost and 2) their rotational symmetry makes their imaging transform indepe ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Approximation Properties Of Sobolev Splines And The Construction Of Compactly Supported Equivalents

Michaël Unser, John Paul Ward

In this paper, we construct compactly supported radial basis functions that satisfy optimal approximation properties. Error estimates are determined by relating these basis functions to the class of Sobolev splines. Furthermore, we derive new rates for app ...

Siam Publications2014

L (p) error estimates for approximation by Sobolev splines and Wendland functions on a"e (d)

John Paul Ward

It is known that a Green's function-type condition may be used to derive rates for approximation by radial basis functions (RBFs). In this paper, we introduce a method for obtaining rates for approximation by functions which can be convolved with a finite ...

Springer US2013

Analysis-suitable T-splines of arbitrary degree: definition, linear independence and approximation properties

Annalisa Buffa, Rafael Vazquez Hernandez

T-splines are an important tool in IGA since they allow local refinement. In this paper we define analysis-suitable T-splines of arbitrary degree and prove fundamental properties: Linear independence of the blending functions and optimal approximation prop ...

2013

Distance-Based Discretization of Parametric Signal Manifolds

Pascal Frossard, Elif Vural

The characterization of signals and images in manifolds often lead to efficient dimensionality reduction algorithms based on manifold distance computation for analysis or classification tasks. We propose in this paper a method for the discretization of sig ...

2010

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