On a nonlocal spectrogram for denoising one-dimensional signals

Abstract

In previous works, we investigated the use of local filters based on partial differential equations (PDE) to denoise one-dimensional signals through the image processing of timefrequency representations, such as the spectrogram. In this image denoising algorithms, the particularity of the image was hardly taken into account. We turn, in this paper, to study the performance of non-local filters, like Neighborhood or Yaroslavsky filters, in the same problem. We show that, for certain iterative schemes involving the Neighborhood filter, the computational time is drastically reduced with respect to Yaroslavsky or nonlinear PDE based filters, while the outputs of the filtering processes are similar. This is heuristically justified by the connection between the (fast) Neighborhood filter applied to a spectrogram and the corresponding Nonlocal Means filter (accurate) applied to the Wigner-Ville distribution of the signal. This correspondence holds only for time-frequency representations of one-dimensional signals, not to usual images, and in this sense the particularity of the image is exploited. We compare though a series of experiments on synthetic and biomedical signals the performance of local and non-local filters.

Study on Optimal Selection of Wavelet Vanishing Moments for ECG Denoising

“…According to the current literature, under the premise of not considering the computational complexity of wavelet transform, it is generally thought that the higher vanishing moment of the wavelet can produce a better effect 8 . Some other articles contend that the effect of high-pass component thinning and the shape of the wavelet scale function are related to the similarity of the shape of the signal 9, 10 . This paper provides an in-depth study on this issue and offers an answer.…”

On a Fast Bilateral Filtering Formulation Using Functional Rearrangements

“…In the discretization of the pixel-based filter, for each pixel x we compute u in the square neighborhood, N (x), centered at x of radius 2h, containing (4h + 1) 2 pixels (close to the border, the image is extended by zero). Then, we approximate (22) as…”

Convex Optimization approach to signals with fast varying instantaneous frequency

“…The sparsity approach [28,26,27,47] and iterative convolution-filtering [36,29,12,13] are another algorithms proposed to capture the flavor of the EMD, which have solid mathematical supports. The problem could also be discussed via other approaches, like the optimized window approach [44], nonstationary Gabor frame [3], ridge approach [44], the approximation theory approach [11], non-local mean approach [23] and time-varying autoregression and moving average approach [18], to name but a few. Among these approaches, the reassignment technique [33,2,8,1] and the synchrosqueezing transform (SST) [16,15,9] have attracted more and more attention in the past few years.…”