Guillaume Mercère

Bio: Guillaume Mercère is an academic researcher from University of Poitiers. The author has contributed to research in topics: System identification & Subspace topology. The author has an hindex of 18, co-authored 88 publications receiving 1198 citations. Previous affiliations of Guillaume Mercère include École Normale Supérieure.

Identification for gain-scheduling: a balanced subspace approach

Abstract: The problem of deriving MIMO parameter- dependent models for gain-scheduling control design from data generated by local identification experiments is considered and a numerically sound approach is proposed, based on subspace identification ideas combined with the use of suitable properties of balanced state space realisations. Simulation examples are used to demonstrate the performance of the proposed approach.

Recursive subspace identification based on instrumental variable unconstrained quadratic optimization

Abstract: The problem of the recursive formulation of the MOESP class of subspace identification algorithms is considered and two novel instrumental variable approaches are introduced. The first one leads to an RLS-like implementation, the second to a gradient type iteration. The relative merits of both approaches are analysed and discussed, while simulation results are used to compare their performance with one of the existing techniques. Copyright © 2004 John Wiley & Sons, Ltd.

On-line structured subspace identification with application to switched linear systems

Abstract: This article is concerned with the identification of switched linear multiple-inputs–multiple-outputs state-space systems in a recursive way. First, a structured subspace identification scheme for linear systems is presented which turns out to have many attractive features. More precisely, it does not require any singular value decomposition but is derived using orthogonal projection techniques; it allows a computationally appealing implementation and it is closely related to input–output models identification. Second, it is shown that this method can be implemented on-line to track both the range space of the extended observability matrix and its dimension and thereby, the system matrices. Third, by making use of an on-line switching times detection strategy, this method is applied to blindly identify switched systems and to label the obtained submodels. Simulation results on noisy data illustrate the abilities and the benefits of the proposed approach.

Linear systems

Abstract: 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:

Digital wavefront measuring interferometer for testing optical surfaces and lenses

Abstract: A self-scanned 1024 element photodiode array and minicomputer are used to measure the phase (wavefront) in the interference pattern of an interferometer to lambda/100. The photodiode array samples intensities over a 32 x 32 matrix in the interference pattern as the length of the reference arm is varied piezoelectrically. Using these data the minicomputer synchronously detects the phase at each of the 1024 points by a Fourier series method and displays the wavefront in contour and perspective plot on a storage oscilloscope in less than 1 min (Bruning et al. Paper WE16, OSA Annual Meeting, Oct. 1972). The array of intensities is sampled and averaged many times in a random fashion so that the effects of air turbulence, vibrations, and thermal drifts are minimized. Very significant is the fact that wavefront errors in the interferometer are easily determined and may be automatically subtracted from current or subsequent wavefrots. Various programs supporting the measurement system include software for determining the aperture boundary, sum and difference of wavefronts, removal or insertion of tilt and focus errors, and routines for spatial manipulation of wavefronts. FFT programs transform wavefront data into point spread function and modulus and phase of the optical transfer function of lenses. Display programs plot these functions in contour and perspective. The system has been designed to optimize the collection of data to give higher than usual accuracy in measuring the individual elements and final performance of assembled diffraction limited optical systems, and furthermore, the short loop time of a few minutes makes the system an attractive alternative to constraints imposed by test glasses in the optical shop.

Linear System Theory

Abstract: Chapter 8 establishes the relationship between the input and output power spectral densities of a linear system. Limitations on results are carefully detailed and the case of oscillator noise is considered. The theory is extended to multiple input-multiple output systems.