2017
DOI: 10.1109/lsp.2017.2750802
|View full text |Cite
|
Sign up to set email alerts
|

An Adaptive Computation of Contour Representations for Mode Decomposition

Abstract: Abstract-This letter addresses the problem of the detection and estimation of the modes of a multicomponent signal using the reassignment framework. More precisely, we propose a new algorithm to estimate the ridges representing the time-frequency (TF) signatures of the modes based on the local orientation of the reassignment vector (RV), and use them to define the socalled "basins of attraction" enabling modes' retrieval. Compared with previous approaches, this new technique not only enables reconstruction of … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 17 publications
(23 reference statements)
0
5
0
Order By: Relevance
“…Similar to quantum computers which are expected to solve a defined class of mathematical problems on very short time-scales, [1][2][3] a novel adaptive computation technology can be estimated to calculate different problems similar to the human brain and thus in a much more flexible and efficient way than common technology. [4][5][6] Besides developing hard-and software architecture further, however, only few attempts have been made to create completely new approaches for a new generation of computers.…”
Section: Introductionmentioning
confidence: 99%
“…Similar to quantum computers which are expected to solve a defined class of mathematical problems on very short time-scales, [1][2][3] a novel adaptive computation technology can be estimated to calculate different problems similar to the human brain and thus in a much more flexible and efficient way than common technology. [4][5][6] Besides developing hard-and software architecture further, however, only few attempts have been made to create completely new approaches for a new generation of computers.…”
Section: Introductionmentioning
confidence: 99%
“…We compared the performance of the denoising strategy proposed in Sec. 7.2 with the DT method [19], an approach [7,37] based on synchrosqueezing and ridge detection (SST+RD), a simple hard thresholding (HT) [30] of the STFT based on the spectrogram, and a contoursbased reconstruction [29,34] (denoted "Contours").…”
Section: Examples With Synthetic Signalsmentioning
confidence: 99%
“…The ACRC introduced in [16], [17] is computed on a lowpass filtered (LPF) version ofŝ 1 with a cutoff frequency 80Hz to enable not only the elimination of high-frequency noises but also a significant reduction of the computational cost of ACRC. From now on, we denoteŝ 1,LP F such a signal.…”
Section: B Acrc-denoising: Components Estimation and Signal Retrievalmentioning
confidence: 99%
“…CPs are then linked to form so-called contours. To avoid both the issue of choosing θ and numerical instabilities, an adaptive technique, proposed in [17], defined CPs as the zeros of the projection of RV in a direction corresponding to the average of the orientation of RV over a squared neighborhood centered at the point of study. This resulted in a robust estimation of TF signatures for a wide class of MCSs.…”
Section: B Acrc-denoising: Components Estimation and Signal Retrievalmentioning
confidence: 99%
See 1 more Smart Citation