๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Algorithm for adaptively smoothing the log-periodogram

โœ Scribed by Radu Neagu; Igor Zurbenko


Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
413 KB
Volume
340
Category
Article
ISSN
0016-0032

No coin nor oath required. For personal study only.

โœฆ Synopsis


We use the principle of minimum cross entropy (MCE) to build a non-parametric adaptive algorithm for smoothing the log-transformed periodogram, and construct an optimal estimate for the spectral density function of a process. We show that this estimate minimizes the crossentropy with the log-transformed spectral density function of the process. The method is nonparametric and performs very well for the case of processes having rapidly changing spectra that exhibits a variable order of smoothness. The algorithm is locally based on linearly approximating the information present in the process, and uses this approximation to allow the bandwidth of the spectral window in the smoothed log-periodogram to vary. We extend the algorithm empirically for better application to processes having mixed, narrow-band spectra. Comparisons with other currently used procedures are performed through the means of simulated examples.


๐Ÿ“œ SIMILAR VOLUMES


A Smoothness Indicator for Adaptive Algo
โœ Smadar Karni; Alexander Kurganov; Guergana Petrova ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 242 KB

The formation of shock waves in solutions of hyperbolic conservation laws calls for locally adaptive numerical solution algorithms and requires a practical tool for identifying where adaption is needed. In this paper, a new smoothness indicator (SI) is used to identify "rough" solution regions and i

A Packet Selection Algorithm for Adaptiv
โœ Zhimei Jiang; Leonard Kleinrock ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 279 KB

This paper discusses techniques for transmitting smoothed video more efficiently over a wireless network. The fluctuation of wireless channel conditions can add a significant amount of delay to video packets and cause them to miss their play-out time. If a video is smoothed, it is possible to select

AnO(log*n) Approximation Algorithm for t
โœ Rina Panigrahy; Sundar Vishwanathan ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 130 KB

The input to the asymmetric p-center problem consists of an integer p and an n = n distance matrix D defined on a vertex set V of size n, where d gives the i j distance from i to j. The distances are assumed to obey the triangle inequality. For a subset S : V the radius of S is the minimum distance