BEGIN:VCALENDAR
VERSION:2.0
METHOD:PUBLISH
CALSCALE:GREGORIAN
PRODID:-//WordPress - MECv6.5.6//EN
X-ORIGINAL-URL:https://cmc.deusto.eus/
X-WR-CALNAME:cmc.deusto.eus
X-WR-CALDESC:DeustoCCM - Chair of Computational Mathematics at University of Deusto
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-PUBLISHED-TTL:PT1H
X-MS-OLK-FORCEINSPECTOROPEN:TRUE
BEGIN:VEVENT
CLASS:PUBLIC
UID:MEC-f874601f91ab162335b5856b05987b7d@cmc.deusto.eus
DTSTART:20210331T103000Z
DTEND:20210331T113000Z
DTSTAMP:20251031T213900Z
CREATED:20251031
LAST-MODIFIED:20251031
PRIORITY:5
TRANSP:OPAQUE
SUMMARY:Adaptive Computation of Sparse Solutions
DESCRIPTION:Speaker: Prof. Dr. Martin Burger\nAffiliation: FAU Erlangen-Nürnberg, Germany\nZoom meeting link\nMeeting ID: 618 3161 7110 | PIN code: 442549\nAbstract. In this talk we will discuss approaches of adaptivity to the computation of sparse solutions in an underlying continuum setting. A canonical application of interest and the guiding is the deconvolution problem in superresolution microscopy, but there are several other relevant applications, e.g. the efficient design of imaging techniques for exploration robots or the training of compact neural networks. Our approach is based on convexified variational formulations of sparsity, which allows for a rigorous mathematical analysis. A key idea we discuss is the adaptive refinement on grids based on a-posteriori error estimation, a second one the superresolved estimation of peak locations from multiple nonzero entries in adjacent grid points.\n
URL:https://cmc.deusto.eus/events-calendar/adaptive-computation-of-sparse-solutions/
CATEGORIES:FAU CAA Seminar
ATTACH;FMTTYPE=image/png:https://cmc.deusto.eus/wp-content/uploads/FAUcaa-seminars-31mar2021.png
END:VEVENT
END:VCALENDAR