A Linear Shift Invariant Multiscale Transform

10/02/1998
by   Andreas Siebert, et al.
0

This paper presents a multiscale decomposition algorithm. Unlike standard wavelet transforms, the proposed operator is both linear and shift invariant. The central idea is to obtain shift invariance by averaging the aligned wavelet transform projections over all circular shifts of the signal. It is shown how the same transform can be obtained by a linear filter bank.

READ FULL TEXT
research
08/24/2009

On the Shiftability of Dual-Tree Complex Wavelet Transforms

The dual-tree complex wavelet transform (DT-CWT) is known to exhibit bet...
research
12/18/2014

Data Representation using the Weyl Transform

The Weyl transform is introduced as a rich framework for data representa...
research
03/03/2021

Shift Invariance Can Reduce Adversarial Robustness

Shift invariance is a critical property of CNNs that improves performanc...
research
05/20/2017

Phase-Shifting Separable Haar Wavelets and Applications

This paper presents a new approach for tackling the shift-invariance pro...
research
02/10/2016

Gabor Wavelets in Image Processing

This work shows the use of a two-dimensional Gabor wavelets in image pro...
research
06/07/2023

Multiscale Flow for Robust and Optimal Cosmological Analysis

We propose Multiscale Flow, a generative Normalizing Flow that creates s...
research
05/04/2023

Translation invariant diagonal frame decomposition for the Radon transform

In this article, we address the challenge of solving the ill-posed recon...

Please sign up or login with your details

Forgot password? Click here to reset