图全变差正则化非光滑泛函的割追踪算法
Cut-Pursuit Algorithm for Regularizing Nonsmooth Functionals with Graph Total Variation
摘要:
我们提出了Landrieu和Obozinski(2017)引入的截追踪算法的扩展,用于具有可分离不可微部分的函数的图全变差正则化。我们提出了一个修改后的算法方案,以及适应的收敛性证明。我们还提出了一个启发式的方法来处理的情况下,与图的每个顶点是多维的值。我们的算法,我们证明困难,病态的大规模逆和学习问题的性能,是这样的,它可能在实践中扩展的总变差正则化的应用范围。
英文摘要:
We present an extension of the cut-pursuit algorithm, introduced by Landrieu and Obozinski (2017), to the graph total-variation regularization of functions with a separable nondifferentiable part. We propose a modified algorithmic scheme as well as adapted proofs of convergence. We also present a heuristic approach for handling the cases in which the values associated to each vertex of the graph are multidimensional. The performance of our algorithm, which we demonstrate on difficult, ill-conditioned large-scale inverse and learning problems, is such that it may in practice extend the scope of application of the total-variation regularization.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。