Instantaneous Frequency Estimation via Ridge Detection in Polynomial Time and Space

Application of ridge detection algorithms to various transforms and problems in time-frequency (TF) analysis has become increasingly widespread with notable application in the instantaneous frequency (IF) estimation. Metaheuristic techniques, such as simulated annealing algorithms, are commonly empl...

Full description

Saved in:
Bibliographic Details
Published inIEEE signal processing letters Vol. 32; pp. 1975 - 1979
Main Author Djurovic, Igor
Format Journal Article
LanguageEnglish
Published New York IEEE 2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Algorithms
Estimation
Frequency estimation
Heuristic methods
Instantaneous frequency
Memory management
Metaheuristics
Polynomials
ridge detection
Signal processing algorithms
Simulated annealing
Time-frequency analysis
Transforms
Viterbi algorithm
Viterbi algorithm detectors
Online AccessGet full text
ISSN1070-9908
1558-2361
DOI10.1109/LSP.2025.3564882

Cover

More Information
Summary:Application of ridge detection algorithms to various transforms and problems in time-frequency (TF) analysis has become increasingly widespread with notable application in the instantaneous frequency (IF) estimation. Metaheuristic techniques, such as simulated annealing algorithms, are commonly employed for ridge detection. In this letter, we demonstrate that ridge detection can be achieved using an instance of the Viterbi algorithm (VA). This implementation ensures a global optimum with polynomial time and space complexity. The proposed ridge detection IF estimator is compared to an alternative approach based on the VA.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2025.3564882