Multi-dimensional sparse structured signal approximation using split Bregman iterations

03/21/2013
by   Yoann Isaac, et al.
0

The paper focuses on the sparse approximation of signals using overcomplete representations, such that it preserves the (prior) structure of multi-dimensional signals. The underlying optimization problem is tackled using a multi-dimensional split Bregman optimization approach. An extensive empirical evaluation shows how the proposed approach compares to the state of the art depending on the signal features.

READ FULL TEXT
research
09/29/2016

Multi-dimensional signal approximation with sparse structured priors using split Bregman iterations

This paper addresses the structurally-constrained sparse decomposition o...
research
09/14/2022

Multi-Dimensional Unlimited Sampling and Robust Reconstruction

In this paper we introduce a new sampling and reconstruction approach fo...
research
02/15/2022

Normalized K-Means for Noise-Insensitive Multi-Dimensional Feature Learning

Many measurement modalities which perform imaging by probing an object p...
research
05/20/2022

Multi-Dimensional self exciting NBD process and Default portfolios

In this article we apply the multi dimensional self exciting negative bi...
research
08/22/2023

Data Assimilation for Sign-indefinite Priors: A generalization of Sinkhorn's algorithm

The purpose of this work is to develop a framework to calibrate signed d...
research
03/20/2021

Simple sufficient condition for inadmissibility of Moran's single-split test

Suppose that a statistician observes two independent variates X_1 and X_...
research
12/18/2007

A Class of LULU Operators on Multi-Dimensional Arrays

The LULU operators for sequences are extended to multi-dimensional array...

Please sign up or login with your details

Forgot password? Click here to reset