45,856 research outputs found

    Robust filtering for a class of stochastic uncertain nonlinear time-delay systems via exponential state estimation

    Get PDF
    Copyright [2001] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.We investigate the robust filter design problem for a class of nonlinear time-delay stochastic systems. The system under study involves stochastics, unknown state time-delay, parameter uncertainties, and unknown nonlinear disturbances, which are all often encountered in practice and the sources of instability. The aim of this problem is to design a linear, delayless, uncertainty-independent state estimator such that for all admissible uncertainties as well as nonlinear disturbances, the dynamics of the estimation error is stochastically exponentially stable in the mean square, independent of the time delay. Sufficient conditions are proposed to guarantee the existence of desired robust exponential filters, which are derived in terms of the solutions to algebraic Riccati inequalities. The developed theory is illustrated by numerical simulatio

    2D Face Recognition System Based on Selected Gabor Filters and Linear Discriminant Analysis LDA

    Full text link
    We present a new approach for face recognition system. The method is based on 2D face image features using subset of non-correlated and Orthogonal Gabor Filters instead of using the whole Gabor Filter Bank, then compressing the output feature vector using Linear Discriminant Analysis (LDA). The face image has been enhanced using multi stage image processing technique to normalize it and compensate for illumination variation. Experimental results show that the proposed system is effective for both dimension reduction and good recognition performance when compared to the complete Gabor filter bank. The system has been tested using CASIA, ORL and Cropped YaleB 2D face images Databases and achieved average recognition rate of 98.9 %

    Projections and Dyadic Parseval Frame MRA Wavelets

    Full text link
    A classical theorem attributed to Naimark states that, given a Parseval frame B\mathcal{B} in a Hilbert space H\mathcal{H}, one can embed H\mathcal{H} in a larger Hilbert space K\mathcal{K} so that the image of B\mathcal{B} is the projection of an orthonormal basis for K\mathcal{K}. In the present work, we revisit the notion of Parseval frame MRA wavelets from two papers of Paluszy\'nski, \v{S}iki\'c, Weiss, and Xiao (PSWX) and produce an analog of Naimark's theorem for these wavelets at the level of their scaling functions. We aim to make this discussion as self-contained as possible and provide a different point of view on Parseval frame MRA wavelets than that of PSWX.Comment: 19 page

    Filter Bank Fusion Frames

    Get PDF
    In this paper we characterize and construct novel oversampled filter banks implementing fusion frames. A fusion frame is a sequence of orthogonal projection operators whose sum can be inverted in a numerically stable way. When properly designed, fusion frames can provide redundant encodings of signals which are optimally robust against certain types of noise and erasures. However, up to this point, few implementable constructions of such frames were known; we show how to construct them using oversampled filter banks. In this work, we first provide polyphase domain characterizations of filter bank fusion frames. We then use these characterizations to construct filter bank fusion frame versions of discrete wavelet and Gabor transforms, emphasizing those specific finite impulse response filters whose frequency responses are well-behaved.Comment: keywords: filter banks, frames, tight, fusion, erasures, polyphas

    Robust Kalman tracking and smoothing with propagating and non-propagating outliers

    Full text link
    A common situation in filtering where classical Kalman filtering does not perform particularly well is tracking in the presence of propagating outliers. This calls for robustness understood in a distributional sense, i.e.; we enlarge the distribution assumptions made in the ideal model by suitable neighborhoods. Based on optimality results for distributional-robust Kalman filtering from Ruckdeschel[01,10], we propose new robust recursive filters and smoothers designed for this purpose as well as specialized versions for non-propagating outliers. We apply these procedures in the context of a GPS problem arising in the car industry. To better understand these filters, we study their behavior at stylized outlier patterns (for which they are not designed) and compare them to other approaches for the tracking problem. Finally, in a simulation study we discuss efficiency of our procedures in comparison to competitors.Comment: 27 pages, 12 figures, 2 table
    • …
    corecore