返回
Wavelet shrinkage using adaptive structured sparsity constraints
DOI:10.1016/j.sigpro.2014.07.001.png)
摘要
En 中文
Structured sparsity approaches have recently received much attention in the statistics, machine learning, and signal processing communities. A common strategy is to exploit or assume prior information about structural dependencies inherent in the data; the solution is encouraged to behave as such by the inclusion of an appropriate regularisation term which enforces structured sparsity constraints over sub-groups of data. An important variant of this idea considers the tree-like dependency structures often apparent in wavelet decompositions. However, both the constituent groups and their associated weights in the regularisation term are typically defined a priori. We here introduce an adaptive wavelet denoising framework whereby a sparsity-inducing regulariser is modified based on information extracted from the signal itself. In particular, we use the same wavelet decomposition to detect the location of salient features in the signal, such as jumps or sharp bumps. Given these locations, the weights in the regulariser associated to the groups of coefficients that cover these time locations are modified in order to favour retention of those coefficients. Denoising experiments show that, not only does the adaptive method preserve the salient features better than the non-adaptive constraints, but it also delivers significantly better shrinkage over the signal as a whole. (C) 2014 The Authors. Published by Elsevier B.V.
Keyword:
Structured sparsity
Regularised regression
Denoising
Dual-tree complex wavelet transform
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
10.0K
被引数:
1.7W
机构
引用论文
Some sharp performance bounds for least squares regression with L1 regularization具有L1正则化的最小二乘回归的一些尖锐的性能界限
ANNALS OF STATISTICS
IF3.7
A Unified Framework for High-Dimensional Analysis of M-Estimators with Decomposable Regularizers
STATISTICAL SCIENCE
IF3.4


