Detailseite
Projekt Druckansicht

Schnelle Algorithmen für Free-Discontinuity-Probleme im Zusammenhang mit hochdimensionalen biomedizinischen Daten

Fachliche Zuordnung Mathematik
Förderung Förderung von 2016 bis 2020
Projektkennung Deutsche Forschungsgemeinschaft (DFG) - Projektnummer 318064553
 
Erstellungsjahr 2020

Zusammenfassung der Projektergebnisse

The discontinuities in almost all types of biomedical data – such as the boundaries of cellular structures in microscopic images and tissue layers in tomographic images – encode signi cant information. Since classical methods for image enhancement destroy this important information, discontinuity preserving models, and in particular models based on free-discontinuity problems have been developed. Free-discontinuity models lead to algorithmically challenging nonsmooth and nonconvex problems which are computationally demanding even for low-dimensional data. However, processing higher dimensional data is important since the dimensionality of the acquired data increases tremendously. Further, it is important to deal with indirect data terms, since many applications involve imaging operator; examples are computed tomography (where frequently the Radon transform models the imaging operator) or microscopy (where the point-spread function of the microscope has to be considered). It is also important to deal with nonlinear data. Such data arise in modern imaging modalities such as Interferometric Synthetic Aperture Radar (InSAR) or Di usion Weighted Magnet Resonance Imaging (DWMRI), and in connection with color spaces and with registration problems, for instance. Based on previous work of the applicants, new algorithmic approaches to free-discontinuity problems – including Potts problems, Mumford-Shah problems, and their higher-order variants – were proposed. A strategy was to split the free-discontinuity problems into subproblems which can be solved non-iteratively, e ciently, and exactly. A particularly important design criterion was that the methods scale well with high-dimensional data. Scalability to high-dimensional codomains was achieved by using subproblem solvers that have linear computational complexity in the dimension of the codomain. Therefore it was possible to process multispectral images and images holding large feature vectors in reasonable times. To deal with high-dimensional image domains, solving the subproblems in parallel turned out to be key. Parallelization on GPU allowed to process even volumetric images in reasonable time. Most of the proposed new approaches could be extended in a way to deal with indirectly measured data such as multispectral computed tomography and confocal microscopic images, thus addressing the inverse problem setup. For non-linear data spaces, where many tools of vector spaces are not available, new types of algorithm were developed to deal with the discrete inverse problem setup. Further interpolatory multiscale transforms were studied and a fast, exact, and non-iterative algorithm for the Potts problem with circle-valued data was found. A software toolbox is provided to the scienti c community. The developed methods were evaluated on various types of biomedical data such data from confocal microscopy, DWMRI, and computed tomography. Practitioners from the life sciences already use the corresponding implementations to analyze their data.

Projektbezogene Publikationen (Auswahl)

 
 

Zusatzinformationen

Textvergrößerung und Kontrastanpassung