期刊
IEEE SIGNAL PROCESSING LETTERS
卷 24, 期 12, 页码 1827-1831出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/LSP.2017.2752261
关键词
Convex optimization; disparity map estimation; proximal algorithms; proximity operator; splitting; support function
资金
- DEFI Imag'In - Project SIROCCO
Proximal splitting algorithms for convex optimization are largely used in signal and image processing. They make possible to call the individual proximity operators of an arbitrary number of functions, whose sum is to be minimized. But the larger this number, the slower the convergence. In this letter, we show how to compute the proximity operator of a sum of two functions, for a certain type of functions operating on objects having a graph structure. The gain provided by avoiding unnecessary splitting is illustrated by an application to depth map estimation.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据