scispace - formally typeset
Open AccessProceedings ArticleDOI

Sparse signal representations using the tunable Q-factor wavelet transform

Ivan Selesnick
- 08 Sep 2011 - 
- Vol. 8138, pp 477-491
TLDR
The tunable Q-factor wavelet transform (TQWT) is a fully-discrete wavelet Transform for which the Q-Factor, Q, of the underlying wavelet and the asymptotic redundancy, r, ofThe transform are easily and independently specified, and the specified parameters Q and r can be real-valued.
Abstract
The tunable Q-factor wavelet transform (TQWT) is a fully-discrete wavelet transform for which the Q-factor, Q, of the underlying wavelet and the asymptotic redundancy (over-sampling rate), r, of the transform are easily and independently specified. In particular, the specified parameters Q and r can be real-valued. Therefore, by tuning Q, the oscillatory behavior of the wavelet can be chosen to match the oscillatory behavior of the signal of interest, so as to enhance the sparsity of a sparse signal representation. The TQWT is well suited to fast algorithms for sparsity-based inverse problems because it is a Parseval frame, easily invertible, and can be efficiently implemented using radix-2 FFTs. The TQWT can also be used as an easily-invertible discrete approximation of the continuous wavelet transform.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

Automatic fault feature extraction of mechanical anomaly on induction motor bearing using ensemble super-wavelet transform

TL;DR: In this paper, an ensemble super-wavelet transform (ESW) is proposed for investigating vibration features of motor bearing faults, which is based on the combination of tunable Q-factor wavelet transform and Hilbert transform.
Journal ArticleDOI

Symplectic geometry mode decomposition and its application to rotating machinery compound fault diagnosis

TL;DR: The analysis results of simulation signals and experimental signals indicate that the proposed time-series decomposition approach can decompose the analyzed signals accurately and effectively.
Journal ArticleDOI

Early fault feature extraction of rolling bearing based on ICD and tunable Q-factor wavelet transform

TL;DR: In this paper, a combination of intrinsic characteristic-scale decomposition (ICD) and TQWT is proposed to diagnose the early fault of rolling bearings, which has significant advantages on computation efficiency and alleviation of mode mixing.
Journal ArticleDOI

Exponential Wavelet Iterative Shrinkage Thresholding Algorithm for compressed sensing magnetic resonance imaging

TL;DR: Experiments indicated that the proposed EWISTA showed better reconstruction performance than the state-of-the-art algorithms such as FCSA, ISTA, FISTA, SisTA, and EWT-ISTA.
References
More filters
Journal ArticleDOI

Atomic Decomposition by Basis Pursuit

TL;DR: Basis Pursuit (BP) is a principle for decomposing a signal into an "optimal" superposition of dictionary elements, where optimal means having the smallest l1 norm of coefficients among all such decompositions.
Journal ArticleDOI

Fast Image Recovery Using Variable Splitting and Constrained Optimization

TL;DR: A new fast algorithm for solving one of the standard formulations of image restoration and reconstruction which consists of an unconstrained optimization problem where the objective includes an l2 data-fidelity term and a nonsmooth regularizer is proposed.
Journal ArticleDOI

Image decomposition via the combination of sparse representations and a variational approach

TL;DR: A novel method for separating images into texture and piecewise smooth (cartoon) parts, exploiting both the variational and the sparsity mechanisms is presented, combining the basis pursuit denoising (BPDN) algorithm and the total-variation (TV) regularization scheme.
Journal ArticleDOI

Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)

TL;DR: A novel inpainting algorithm that is capable of filling in holes in overlapping texture and cartoon image layers using a direct extension of a recently developed sparse-representation-based image decomposition method called MCA (morphological component analysis).
Journal ArticleDOI

Split Bregman Methods and Frame Based Image Restoration

TL;DR: It is proved the convergence of the split Bregman iterations, where the number of inner iterations is fixed to be one, which gives a set of new frame based image restoration algorithms that cover several topics in image restorations.
Related Papers (5)