Schmitzer, Bernhard

[["dc.bibliographiccitation.issue","3"],["dc.bibliographiccitation.journal","Applied Mathematics & Optimization"],["dc.bibliographiccitation.volume","86"],["dc.contributor.author","Lohmann, Julius"],["dc.contributor.author","Schmitzer, Bernhard"],["dc.contributor.author","Wirth, Benedikt"],["dc.date.accessioned","2022-11-01T10:17:35Z"],["dc.date.available","2022-11-01T10:17:35Z"],["dc.date.issued","2022"],["dc.description.abstract","Abstract\n \n In recent work (Lohmann et al. in J Math Pures Appl, 2022,\n https://doi.org/10.1016/j.matpur.2022.05.021\n , Theorem 1.3.4) we have shown the equivalence of the widely used nonconvex (generalized) branched transport problem with a shape optimization problem of a street or railroad network, known as (generalized) urban planning problem. The argument was solely based on an explicit construction and characterization of competitors. In the current article we instead analyse the dual perspective associated with both problems. In more detail, the shape optimization problem involves the Wasserstein distance between two measures with respect to a metric depending on the street network. We show a Kantorovich–Rubinstein formula for Wasserstein distances on such street networks under mild assumptions. Further, we provide a Beckmann formulation for such Wasserstein distances under assumptions which generalize our previous result in [16]. As an application we then give an alternative, duality-based proof of the equivalence of both problems under a growth condition on the transportation cost, which reveals that urban planning and branched transport can both be viewed as two bilinearly coupled convex optimization problems."],["dc.description.sponsorship"," Deutsche Forschungsgemeinschaft http://dx.doi.org/10.13039/501100001659"],["dc.description.sponsorship"," Deutsche Forschungsgemeinschaft http://dx.doi.org/10.13039/501100001659"],["dc.description.sponsorship"," Deutsche Forschungsgemeinschaft http://dx.doi.org/10.13039/501100001659"],["dc.description.sponsorship"," Alfried Krupp von Bohlen und Halbach-Stiftung http://dx.doi.org/10.13039/501100005306"],["dc.identifier.doi","10.1007/s00245-022-09927-3"],["dc.identifier.pii","9927"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/116847"],["dc.language.iso","en"],["dc.notes.intern","DOI-Import GROB-605"],["dc.relation.eissn","1432-0606"],["dc.relation.issn","0095-4616"],["dc.rights.uri","https://creativecommons.org/licenses/by/4.0"],["dc.title","Duality in Branched Transport and Urban Planning"],["dc.type","journal_article"],["dc.type.internalPublication","yes"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","23"],["dc.bibliographiccitation.journal","European Series in Applied and Industrial Mathematics. Proceedings and Surveys"],["dc.bibliographiccitation.volume","25"],["dc.contributor.author","Schmitzer, Bernhard"],["dc.contributor.author","Wirth, Benedikt"],["dc.date.accessioned","2020-07-09T11:56:02Z"],["dc.date.available","2020-07-09T11:56:02Z"],["dc.date.issued","2019"],["dc.identifier.doi","10.1051/cocv/2018017"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/66918"],["dc.relation.issn","1292-8119"],["dc.relation.issn","1262-3377"],["dc.title","Dynamic models of Wasserstein-1-type unbalanced transport"],["dc.type","journal_article"],["dc.type.internalPublication","unknown"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.journal","Journal of Convex Analysis"],["dc.bibliographiccitation.volume","26"],["dc.contributor.author","Schmitzer, Bernhard"],["dc.contributor.author","Wirth, Benedikt"],["dc.date.accessioned","2020-07-06T14:40:56Z"],["dc.date.available","2020-07-06T14:40:56Z"],["dc.date.issued","2017"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/66873"],["dc.title","A Framework for Wasserstein-1-Type Metrics"],["dc.type","journal_article"],["dc.type.internalPublication","unknown"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","739"],["dc.bibliographiccitation.journal","Journal de Mathématiques Pures et Appliquées"],["dc.bibliographiccitation.lastpage","779"],["dc.bibliographiccitation.volume","163"],["dc.contributor.author","Lohmann, Julius"],["dc.contributor.author","Schmitzer, Bernhard"],["dc.contributor.author","Wirth, Benedikt"],["dc.date.accessioned","2022-09-01T09:49:44Z"],["dc.date.available","2022-09-01T09:49:44Z"],["dc.date.issued","2022"],["dc.identifier.doi","10.1016/j.matpur.2022.05.021"],["dc.identifier.pii","S0021782422000745"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/113512"],["dc.language.iso","en"],["dc.notes.intern","DOI-Import GROB-597"],["dc.relation.issn","0021-7824"],["dc.rights.uri","https://www.elsevier.com/tdm/userlicense/1.0/"],["dc.title","Formulation of branched transport as geometry optimization"],["dc.type","journal_article"],["dc.type.internalPublication","yes"],["dspace.entity.type","Publication"]]

[["dc.contributor.author","Bourne, David"],["dc.contributor.author","Schmitzer, Bernhard"],["dc.contributor.author","Wirth, Benedikt"],["dc.date.accessioned","2020-07-06T14:41:08Z"],["dc.date.available","2020-07-06T14:41:08Z"],["dc.date.issued","2018"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/66876"],["dc.title","Semi-discrete unbalanced optimal transport and quantization"],["dc.type","preprint"],["dc.type.internalPublication","unknown"],["dspace.entity.type","Publication"]]

[["dc.bibliographiccitation.firstpage","1626"],["dc.bibliographiccitation.issue","5"],["dc.bibliographiccitation.journal","IEEE Transactions on Medical Imaging"],["dc.bibliographiccitation.lastpage","1635"],["dc.bibliographiccitation.volume","39"],["dc.contributor.author","Schmitzer, Bernhard"],["dc.contributor.author","Wirth, Benedikt"],["dc.contributor.author","Schäfers, Klaus"],["dc.date.accessioned","2020-07-09T11:22:05Z"],["dc.date.available","2020-07-09T11:22:05Z"],["dc.date.issued","2020-05"],["dc.description.abstract","We propose a novel dynamic image reconstruction method from PET listmode data that could be particularly suited to tracking single or small numbers of cells. In contrast to conventional PET reconstruction our method combines the information from all detected events not only to reconstruct the dynamic evolution of the radionuclide distribution, but also to improve the reconstruction at each single time point by enforcing temporal consistency. This is achieved via optimal transport regularization where in principle, among all possible temporally evolving radionuclide distributions consistent with the PET measurement, the one is chosen with least kinetic motion energy. The reconstruction is found by convex optimization so that there is no dependence on the initialization of the method. We study its behaviour on simulated data of a human PET system and demonstrate its robustness even in settings with very low radioactivity. In contrast to previously reported cell tracking algorithms, our technique is oblivious to the number of tracked cells. Without any additional complexity one or multiple cells can be reconstructed, and the model automatically determines the number of particles. For instance, four radiolabelled cells moving at a velocity of 3.1 mm/s and a PET recorded count rate of 1.1 cps (for each cell) could be simultaneously tracked with a tracking accuracy of 5.3 mm inside a simulated human body."],["dc.identifier.arxiv","1902.07521v2"],["dc.identifier.doi","10.1109/TMI.2019.2953773"],["dc.identifier.pmid","31751230"],["dc.identifier.uri","https://resolver.sub.uni-goettingen.de/purl?gro-2/66915"],["dc.language.iso","en"],["dc.relation.eissn","1558-254X"],["dc.relation.issn","0278-0062"],["dc.title","Dynamic Cell Imaging in PET With Optimal Transport Regularization"],["dc.type","journal_article"],["dc.type.internalPublication","unknown"],["dspace.entity.type","Publication"]]