arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1604.06589cs.ITmath.ITmath.OC
收藏

优化均值滤波中一类保持整体凸性的非凸惩罚

A Class of Nonconvex Penalties Preserving Overall Convexity in Optimization-Based Mean Filtering

Mohammadreza Malek-Mohammadi, Cristian R. Rojas, Bo Wahlberg

摘要:

$\ell_1$均值滤波是一种传统的基于优化的方法,用于估计受加性噪声扰动的分段恒定信号中的跳跃位置。在该方法中,$\ell_1$范数惩罚信号的一阶导数的稀疏性。然而,理论结果表明,在某些情况下,这可能经常发生在实践中,即使当跳跃幅度趋向于$\infty$,传统的方法识别虚假的变化点。这个问题被称为阶梯问题,并限制了$\ell_1$均值滤波的实际意义。在本文中,稀疏性惩罚更严格的$\ell_1$规范,通过利用一定的非凸函数类,而严格的凸性随之而来的优化问题被保留。这导致检测变化点的更高性能。为了从理论上证明性能改善$\ell_1$均值滤波,确定性和随机性的充分条件,精确的变点恢复。特别是,理论结果表明,在阶梯套管问题,我们的方法可能能够排除假的变化点,而$\ell_1$均值滤波可能会失败。大量数值模拟有助于证明我们的方法优于$\ell_1$均值滤波和另一种最先进的算法,该算法比$\ell_1$规范更能提高稀疏性。具体而言,它表明,我们的方法可以始终检测到变化点时,跳跃幅度变得足够大,而其他两个竞争对手不能。

英文摘要:

$\ell_1$ mean filtering is a conventional, optimization-based method to estimate the positions of jumps in a piecewise constant signal perturbed by additive noise. In this method, the $\ell_1$ norm penalizes sparsity of the first-order derivative of the signal. Theoretical results, however, show that in some situations, which can occur frequently in practice, even when the jump amplitudes tend to $\infty$, the conventional method identifies false change points. This issue is referred to as stair-casing problem and restricts practical importance of $\ell_1$ mean filtering. In this paper, sparsity is penalized more tightly than the $\ell_1$ norm by exploiting a certain class of nonconvex functions, while the strict convexity of the consequent optimization problem is preserved. This results in a higher performance in detecting change points. To theoretically justify the performance improvements over $\ell_1$ mean filtering, deterministic and stochastic sufficient conditions for exact change point recovery are derived. In particular, theoretical results show that in the stair-casing problem, our approach might be able to exclude the false change points, while $\ell_1$ mean filtering may fail. A number of numerical simulations assist to show superiority of our method over $\ell_1$ mean filtering and another state-of-the-art algorithm that promotes sparsity tighter than the $\ell_1$ norm. Specifically, it is shown that our approach can consistently detect change points when the jump amplitudes become sufficiently large, while the two other competitors cannot.

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

↑