arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2011.14814cs.CVcs.LG

无监督光流中的代价函数展开

Cost Function Unrolling in Unsupervised Optical Flow

Tel Aviv University(特拉维夫大学)

Gal Lifshitz, Dan Raviv

AI总结:

本文提出代价展开(Cost Unrolling)方法,为无监督光流中的L1平滑约束推导可微代理,以改进梯度计算,在不增加计算复杂度的情况下提升模型收敛性和预测精度,在MPI Sintel和KITTI 2015上EPE降低达15.82%。

摘要:

最速下降算法是深度学习中常用的优化方法,其以梯度作为下降方向,或直接使用梯度,或通过预处理进行方向变换。在许多场景中,由于代价函数复杂或不可微,尤其是在奇异点附近,计算梯度在数值上非常困难。本文聚焦于无监督代价函数中常用的全变分半范数的推导。具体而言,我们提出了一种新颖的迭代方案,推导出对硬L1平滑约束的可微代理,我们称之为代价展开(Cost Unrolling)。该方法在训练过程中产生更精确的梯度,通过改进收敛性,使给定的深度神经网络模型能够做出更精细的预测,而无需修改其架构或增加计算复杂度。我们在无监督光流任务中验证了我们的方法。在训练一个已知基线模型时,用我们展开的代价替换L1平滑约束,我们在MPI Sintel和KITTI 2015无监督光流基准上报告了改进的结果。特别是,在遮挡像素上,EPE降低了高达15.82%,而平滑约束在这些像素上占主导地位,从而能够检测出更清晰的运动边缘。

英文摘要:

Steepest descent algorithms, which are commonly used in deep learning, use the gradient as the descent direction, either as-is or after a direction shift using preconditioning. In many scenarios calculating the gradient is numerically hard due to complex or non-differentiable cost functions, specifically next to singular points. In this work we focus on the derivation of the Total Variation semi-norm commonly used in unsupervised cost functions. Specifically, we derive a differentiable proxy to the hard L1 smoothness constraint in a novel iterative scheme which we refer to as Cost Unrolling. Producing more accurate gradients during training, our method enables finer predictions of a given DNN model through improved convergence, without modifying its architecture or increasing computational complexity. We demonstrate our method in the unsupervised optical flow task. Replacing the L1 smoothness constraint with our unrolled cost during the training of a well known baseline, we report improved results on both MPI Sintel and KITTI 2015 unsupervised optical flow benchmarks. Particularly, we report EPE reduced by up to 15.82% on occluded pixels, where the smoothness constraint is dominant, enabling the detection of much sharper motion edges.

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

↑