Convex optimization for binary tree-based transport networks

التفاصيل البيبلوغرافية
العنوان: Convex optimization for binary tree-based transport networks
المؤلفون: Sallé de Chou, Raoul, Srir, Mohamed Ali, Najman, Laurent, Passat, Nicolas, Talbot, Hugues, Vignon-Clementel, Irene
المساهمون: SImulations en Médecine, BIOtechnologie et ToXicologie de systèmes multicellulaires (SIMBIOTX ), Inria Saclay - Ile de France, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), CentraleSupélec, Laboratoire d'Informatique Gaspard-Monge (LIGM), École des Ponts ParisTech (ENPC)-Centre National de la Recherche Scientifique (CNRS)-Université Gustave Eiffel, Centre de Recherche en Sciences et Technologies de l'Information et de la Communication - EA 3804 (CRESTIC), Université de Reims Champagne-Ardenne (URCA), OPtimisation Imagerie et Santé (OPIS), Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre de vision numérique (CVN), Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Université Paris-Saclay-CentraleSupélec-Université Paris-Saclay
المصدر: Lecture Notes in Computer Science ; International Conference on Discrete Geometry and Mathematical Morphology (DGMM) ; https://inria.hal.science/hal-04359833Test ; International Conference on Discrete Geometry and Mathematical Morphology (DGMM), 2024, Florence, Italy. pp.217-228, ⟨10.1007/978-3-031-57793-2_17⟩
بيانات النشر: HAL CCSD
سنة النشر: 2024
المجموعة: Université de Reims Champagne-Ardenne: Archives Ouvertes (HAL)
مصطلحات موضوعية: Constrained Constructive Optimization, Discrete optimal transport, Binary trees, Numerical twin, Convex optimization, [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC], [SPI.MECA.BIOM]Engineering Sciences [physics]/Mechanics [physics.med-ph]/Biomechanics [physics.med-ph]
جغرافية الموضوع: Florence, Italy
الوقت: Florence, Italy
الوصف: International audience ; Optimizing transport networks is a well-known class of problems that have been extensively studied, with application in many domains. Here we are interested in a generalization of the Steiner problem,which entails finding a graph minimizing a cost function associated withconnecting a given set of points. In this paper, we concentrate on a specific formulation of this problem which is applied to the generation ofsynthetic vascular trees. More precisely, we focus on the ConstrainedConstructive Optimization (CCO) tree algorithm, which constructs avascular network iteratively, optimizing a blood transport energy efficiency. We show that the classical incremental construction method often leads to sub-optimal results, and that a better global solution can bereached.
نوع الوثيقة: conference object
اللغة: English
العلاقة: hal-04359833; https://inria.hal.science/hal-04359833Test; https://inria.hal.science/hal-04359833/documentTest; https://inria.hal.science/hal-04359833/file/DGMM2024_paper_23.pdfTest
DOI: 10.1007/978-3-031-57793-2_17
الإتاحة: https://doi.org/10.1007/978-3-031-57793-2_17Test
https://inria.hal.science/hal-04359833Test
https://inria.hal.science/hal-04359833/documentTest
https://inria.hal.science/hal-04359833/file/DGMM2024_paper_23.pdfTest
حقوق: http://creativecommons.org/licenses/byTest/ ; info:eu-repo/semantics/OpenAccess
رقم الانضمام: edsbas.EEB6CAD3
قاعدة البيانات: BASE