AN ADAPTIVE OPTIMAL-KERNEL TIME-FREQUENCY REPRESENTATION
AN ADAPTIVE OPTIMAL-KERNEL TIME-FREQUENCY REPRESENTATION
复制标题
DOI:
10.1109/78.469854
复制
发表时间:
1995-10-01
影响因子:
5.4
通讯作者:
BARANIUK, RG
中科院分区:
文献类型:
--
作者:
JONES, DL;BARANIUK, RG
Time-frequency representations with fixed windows or kernels figure prominently in many applications, but perform well only for limited classes of signals, Representations with signal-dependent kernels can overcome this limitation, However, while they often perform well, most existing schemes are block-oriented techniques unsuitable for on-line implementation or for tracking signal components with characteristics that change with time, The time-frequency representation developed here, based on a signal-dependent radially Gaussian kernel that adapts over time, surmounts these difficulties, The method employs a short-time ambiguity function both for kernel optimization and as an intermediate step in computing constant-time slices of the representation, Careful algorithm design provides reasonably efficient computation and allows on-line implementation, Certain enhancements, such as cane-kernel constraints and approximate retention of marginals, are easily incorporated with little additional computation. While somewhat more expensive than fixed-kernel representations, this new technique often provides much better performance, Several examples illustrate its behavior on synthetic and real-world signals.