ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1509.02811
110
37
v1v2v3 (latest)

Convex Fused Lasso Denoising with Non-Convex Regularization and its use for Pulse Detection

9 September 2015
Ankit Parekh
I. Selesnick
ArXiv (abs)PDFHTML
Abstract

We propose a convex formulation of the fused lasso signal approximation problem consisting of non-convex penalty functions. The fused lasso signal model aims to estimate a sparse piecewise constant signal from a noisy observation. Originally, the ℓ1\ell_1ℓ1​ norm was used as a sparsity-inducing convex penalty function for the fused lasso signal approximation problem. However, the ℓ1\ell_1ℓ1​ norm underestimates signal values. Non-convex sparsity-inducing penalty functions better estimate signal values. In this paper, we show how to ensure the convexity of the fused lasso signal approximation problem with non-convex penalty functions. We further derive a computationally efficient algorithm using the majorization-minimization technique. We apply the proposed fused lasso method for the detection of pulses.

View on arXiv
Comments on this paper