Computationally Efficient Adaptive Rate Sampling and Adaptive Resolution Analysis - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

Computationally Efficient Adaptive Rate Sampling and Adaptive Resolution Analysis

Résumé

Mostly the real life signals are time varying in nature. For proper characterization of such signals, time-frequency representation is required. The STFT (short-time Fourier transform) is a classical tool used for this purpose. The limitation of the STFT is its fixed time-frequency resolution. Thus, an enhanced version of the STFT, which is based on the cross-level sampling, is devised. It can adapt the sampling frequency and the window function length by following the input signal local variations. Therefore, it provides an adaptive resolution time-frequency representation of the input. The computational complexity of the proposed STFT is deduced and compared to the classical one. The results show a significant gain of the computational efficiency and hence of the processing power. The processing error of the proposed technique is also discussed.
Fichier non déposé

Dates et versions

hal-00323944 , version 1 (23-09-2008)

Identifiants

  • HAL Id : hal-00323944 , version 1

Citer

Saeed-Mian Qaisar, Laurent Fesquet, Marc Renaudin. Computationally Efficient Adaptive Rate Sampling and Adaptive Resolution Analysis. Fifth International Conference on Computer Vision, Image and Signal Processing (CVISP 2008), Jul 2008, Prague, Czech Republic. pp.85-90. ⟨hal-00323944⟩

Collections

UGA CNRS TIMA
118 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More