Local polynomial modeling of time-varying autoregressive models with application to time-frequency analysis of event-related EEG

This paper proposes a new local polynomial modeling (LPM) method for identification of time-varying autoregressive (TVAR) models and applies it to time-frequency analysis (TFA) of event-related electroencephalogram (ER-EEG). The LPM method models the TVAR coefficients locally by polynomials and estimates the polynomial coefficients using weighted least-squares with a window having a certain bandwidth. A data-driven variable bandwidth selection method is developed to determine the optimal bandwidth that minimizes the mean squared error. The resultant time-varying power spectral density estimation of the signal is capable of achieving both high time resolution and high frequency resolution in the time-frequency domain, making it a powerful TFA technique for nonstationary biomedical signals like ER-EEG. Experimental results on synthesized signals and real EEG data show that the LPM method can achieve a more accurate and complete time-frequency representation of the signal. © 2006 IEEE.published_or_final_versio

A New Regularized Adaptive Windowed Lomb Periodogram for Time-Frequency Analysis of Nonstationary Signals With Impulsive Components

This paper proposes a new class of windowed Lomb periodogram (WLP) for time-frequency analysis of nonstationary signals, which may contain impulsive components and may be nonuniformly sampled. The proposed methods significantly extend the conventional Lomb periodogram in two aspects: 1) The nonstationarity problem is addressed by employing the weighted least squares (WLS) to estimate locally the time-varying periodogram and an intersection of confidence interval technique to adaptively select the window sizes of WLS in the time-frequency domain. This yields an adaptive WLP (AWLP) having a better tradeoff between time resolution and frequency resolution. 2) A more general regularized maximum-likelihood-type (M-) estimator is used instead of the LS estimator in estimating the AWLP. This yields a novel M-estimation-based regularized AWLP method which is capable of reducing estimation variance, accentuating predominant time-frequency components, restraining adverse influence of impulsive components, and separating impulsive components. Simulation results were conducted to illustrate the advantages of the proposed method over the conventional Lomb periodogram in adaptive time-frequency resolution, sparse representation for sinusoids, robustness to impulsive components, and applicability to nonuniformly sampled data. Moreover, as the computation of the proposed method at each time sample and frequency is independent of others, parallel computing can be conveniently employed without much difficulty to significantly reduce the computational time of our proposed method for real-time applications. The proposed method is expected to find a wide range of applications in instrumentation and measurement and related areas. Its potential applications to power quality analysis and speech signal analysis are also discussed and demonstrated.published_or_final_versio

Local polynomial modeling and variable bandwidth selection for time-varying linear systems

This paper proposes a local polynomial modeling (LPM) approach and variable bandwidth selection (VBS) algorithm for identifying time-varying linear systems (TVLSs). The proposed method models the time-varying coefficients of a TVLS locally by polynomials, which can be estimated by least squares estimation with a kernel having a certain bandwidth. The asymptotic behavior of the proposed LPM estimator is studied, and the existence of an optimal local bandwidth which minimizes the local mean-square error is established. A new data-driven VBS algorithm is then proposed to estimate this optimal variable bandwidth adaptively and locally. An individual bandwidth is assigned for each coefficient instead of the whole coefficient vector so as to improve the accuracy in fast-varying systems encountered in fault detection and other applications. Important practical issues such as online implementation are also discussed. Simulation results show that the LPM-VBS method outperforms conventional TVLS identification methods, such as the recursive least squares algorithm and generalized random walk Kalman filter/smoother, in a wide variety of testing conditions, in particular, at moderate to high signal-to-noise ratio. Using local linearization, the LPM method is further extended to identify time-varying systems with mild nonlinearities. Simulation results show that the proposed LPM-VBS method can achieve a satisfactory performance for mildly nonlinear systems based on appropriate linearization. Finally, the proposed method is applied to a practical problem of voltage-flicker-tracking problem in power systems. The usefulness of the proposed approach is demonstrated by its improved performance over other conventional methods. © 2006 IEEE.published_or_final_versio

Testing Conditional Factor Models

Using nonparametric techniques, we develop a methodology for estimating conditional alphas and betas and long-run alphas and betas, which are the averages of conditional alphas and betas, respectively, across time. The tests can be performed for a single asset or jointly across portfolios. The traditional Gibbons, Ross, and Shanken (1989) test arises as a special case of no time variation in the alphas and factor loadings and homoskedasticity. As applications of the methodology, we estimate conditional CAPM and multifactor models on book-to-market and momentum decile portfolios. We reject the null that long-run alphas are equal to zero even though there is substantial variation in the conditional factor loadings of these portfolios.

Stochastic Behavior Analysis of the Gaussian Kernel Least-Mean-Square Algorithm

The kernel least-mean-square (KLMS) algorithm is a popular algorithm in nonlinear adaptive filtering due to its simplicity and robustness. In kernel adaptive filters, the statistics of the input to the linear filter depends on the parameters of the kernel employed. Moreover, practical implementations require a finite nonlinearity model order. A Gaussian KLMS has two design parameters, the step size and the Gaussian kernel bandwidth. Thus, its design requires analytical models for the algorithm behavior as a function of these two parameters. This paper studies the steady-state behavior and the transient behavior of the Gaussian KLMS algorithm for Gaussian inputs and a finite order nonlinearity model. In particular, we derive recursive expressions for the mean-weight-error vector and the mean-square-error. The model predictions show excellent agreement with Monte Carlo simulations in transient and steady state. This allows the explicit analytical determination of stability limits, and gives opportunity to choose the algorithm parameters a priori in order to achieve prescribed convergence speed and quality of the estimate. Design examples are presented which validate the theoretical analysis and illustrates its application

A Hierarchical Scheduling Model for Dynamic Soft-Realtime System

We present a new hierarchical approximation and scheduling approach for applications and tasks with multiple modes on a single processor. Our model allows for a temporal and spatial distribution of the feasibility problem for a variable set of tasks with non-deterministic and fluctuating costs at runtime. In case of overloads an optimal degradation strategy selects one of several application modes or even temporarily deactivates applications. Hence, transient and permanent bottlenecks can be overcome with an optimal system quality, which is dynamically decided. This paper gives the first comprehensive and complete overview of all aspects of our research, including a novel CBS concept to confine entire applications, an evaluation of our system by using a video-on-demand application, an outline for adding further resource dimension, and aspects of our protoype implementation based on RTSJ