http://www.ai.mit.edu/courses/6.891-f00/text/DHSAppendix.pdf

Pattern Classification (2nd ed.)

http://web.aeromech.usyd.edu.au/AMME4500/mpc_survey.pdf

A survey of industrial model predictive control technology

We introduce flat systems, which are equivalent to linear ones via a special type of feedback called endogenous. Their physical properties are subsumed by a linearizing output and they might be regarded as providing another nonlinear extension of Kalman's controllability. The distance to flatness is measured by a non-negative integer, the defect. We utilize differential algebra where flatness- and defect are best defined without distinguishing between input, state, output and other variables. Many realistic classes of examples are flat. We treat two popular ones: the crane and the car with n trailers, the motion planning of which is obtained via elementary properties of plane curves. The three non-flat examples, the simple, double and variable length pendulums, are borrowed from non-linear physics. A high frequency control strategy is proposed such that the averaged systems become flat.

/pdf/flatness-and-defect-of-non-linear-systems-introductory-42ot9eoqmh.pdf

Flatness and defect of non-linear systems: introductory theory and examples

First published in 1995, Wavelets and Subband Coding offered a unified view of the exciting field of wavelets and their discrete-time cousins, filter banks, or subband coding. The book developed the theory in both continuous and discrete time, and presented important applications. During the past decade, it filled a useful need in explaining a new view of signal processing based on flexible time-frequency analysis and its applications. Since 2007, the authors now retain the copyright and allow open access to the book.

Wavelets and Subband Coding

N4SID: subspace algorithms for the identification of combined deterministic-stochastic systems

Most of the signal processing that we will study in this course involves local operations on a signal, namely transforming the signal by applying linear combinations of values in the neighborhood of each sample point. You are familiar with such operations from Calculus, namely, taking derivatives and you are also familiar with this from optics namely blurring a signal. We will be looking at sampled signals only. Let's start with a few basic examples. Local difference Suppose we have a 1D image and we take the local difference of intensities, DI(x) = 1 2 (I(x + 1) − I(x − 1)) which give a discrete approximation to a partial derivative. (We compute this for each x in the image.) What is the effect of such a transformation? One key idea is that such a derivative would be useful for marking positions where the intensity changes. Such a change is called an edge. It is important to detect edges in images because they often mark locations at which object properties change. These can include changes in illumination along a surface due to a shadow boundary, or a material (pigment) change, or a change in depth as when one object ends and another begins. The computational problem of finding intensity edges in images is called edge detection. We could look for positions at which DI(x) has a large negative or positive value. Large positive values indicate an edge that goes from low to high intensity, and large negative values indicate an edge that goes from high to low intensity. Example Suppose the image consists of a single (slightly sloped) edge:

http://ieeexplore.ieee.org/iel5/5/31307/01456462.pdf

S.R. Liberty

Papers

Linear systems