arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1601.07402math.CAmath.APmath.OC
收藏

二维传输网络中的最优微模式及其与图像修复的关系

Optimal micropatterns in 2D transport networks and their relation to image inpainting

Alessio Brancolini, Carolin Rossmanith, Benedikt Wirth

摘要:

我们考虑两种不同的变分模型的交通网络,所谓的分支运输问题和城市规划问题。基于一种新的关系,芒福德-沙阿图像修复和技术开发在该领域,我们表明,两个高度非凸网络优化任务可以转化为一个凸变分问题,这可能是非常有用的分析和数值的角度来看,一个二维的情况。作为凸公式的应用,我们用它来进行数值模拟(据我们所知,这是第一个数值处理的城市规划),我们证明了能量标度律的下界,这有助于更好地理解最优网络和它们的最小能量。

英文摘要:

We consider two different variational models of transport networks, the so-called branched transport problem and the urban planning problem. Based on a novel relation to Mumford-Shah image inpainting and techniques developed in that field, we show for a two-dimensional situation that both highly non-convex network optimization tasks can be transformed into a convex variational problem, which may be very useful from analytical and numerical perspectives. As applications of the convex formulation, we use it to perform numerical simulations (to our knowledge this is the first numerical treatment of urban planning), and we prove the lower bound of an energy scaling law which helps better understand optimal networks and their minimal energies.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑