The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Time-Frequency Representation Based on an Adaptive Short-Time Fourier Transform
Abstract
In this paper, a new concise algorithm about time-frequency representation (TFR) based on an adaptive short-time Fourier transform (ASTFT) is presented. In this algorithm, the analysis window width is equal to the local stationary length which is measured by the instantaneous frequency gradient (IFG) of the signal. And the instantaneous frequency (IF) of the signal is obtained by detecting the ridge of wavelet transform (WT). The ASTFT provides much better performance than conventional TFR algorithms. Furthermore, the algorithm is simpler and more computational efficient than some of other adaptive TFR algorithms proposed previously. Several examples are presented to illustrate its behavior on different kinds of signals and demonstrate its validity.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Multiridge detection and time-frequency reconstruction
Carmona, R. A., Hwang, W. L., & Torresani, B. (1999) · IEEE Transactions on Signal Processing · doi:10.1109/78.740131 · Cited by 269 · cited 1×
“In the case of multiridge detection, the modulus maxima algorithm is disabled even in a higher SNR of 20 dB. To detect the ridge of WT at a low SNR, the Crazy Climber algorithm [ 20 ] should be taken to the procedure.”
Method
Cited by
A Review of Fault Detection and Diagnosis for the Traction System in High-Speed Trains
Chen, H., & Jiang, B. (2020) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2019.2897583 · Cited by 413
Yağ, İ., & Altan, A. (2022) · Biology · doi:10.3390/biology11121732 · Cited by 281
General linear chirplet transform
Yu, G., & Zhou, Y. (2016) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2015.09.004 · Cited by 254
Metadata
- Authors
- Zhong, J., & Huang, Y.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2010-10
- Volume
- 58
- Issue
- 10
- Pages
- 5118-5128
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2134922590
- Cited by
- 168
- References
- 1
- FWCI
- 7.88
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.