arXiv subjects

Michel Verhaegen

Publications and source records attributed to Michel Verhaegen.

41 records · Page 3Linked to original sources

arXiv2014

Subspace identification of large-scale interconnected systems

We propose a decentralized subspace algorithm for identification of large-scale, interconnected systems that are described by sparse (multi) banded state-space matrices. First, we prove that the state of a local subsystem can be approximated by a linear combination of inputs and outputs of the local subsystems that are in its neighborhood. Furthermore, we prove that for interconnected systems with well-conditioned, finite-time observability Gramians (or observability matrices), the size of this neighborhood is relatively small. On the basis of these results, we develop a subspace identification algorithm that identifies a state-space model of a local subsystem from the local input-output data. Consequently, the developed algorithm is computationally feasible for interconnected systems with a large number of local subsystems. Numerical results confirm the effectiveness of the new identification algorithm.

eess.SY↗

arXiv2014

Nuclear Norm Subspace Identification (N2SID) for short data batches

Subspace identification is revisited in the scope of nuclear norm minimization methods. It is shown that essential structural knowledge about the unknown data matrices in the data equation that relates Hankel matrices constructed from input and output data can be used in the first step of the numerical solution presented. The structural knowledge comprises the low rank property of a matrix that is the product of the extended observability matrix and the state sequence and the Toeplitz structure of the matrix of Markov parameters (of the system in innovation form). The new subspace identification method is referred to as the N2SID (twice the N of Nuclear Norm and SID for Subspace IDentification) method. In addition to include key structural knowledge in the solution it integrates the subspace calculation with minimization of a classical prediction error cost function. The nuclear norm relaxation enables us to perform such integration while preserving convexity. The advantages of N2SID are demonstrated in a numerical open- and closed-loop simulation study. Here a comparison is made with another widely used SID method, i.e. N4SID. The comparison focusses on the identification with short data batches, i.e. where the number of measurements is a small multiple of the system order.

eess.SY↗

arXiv2013

Nonlinear Compressive Particle Filtering

Many systems for which compressive sensing is used today are dynamical. The common approach is to neglect the dynamics and see the problem as a sequence of independent problems. This approach has two disadvantages. Firstly, the temporal dependency in the state could be used to improve the accuracy of the state estimates. Secondly, having an estimate for the state and its support could be used to reduce the computational load of the subsequent step. In the linear Gaussian setting, compressive sensing was recently combined with the Kalman filter to mitigate above disadvantages. In the nonlinear dynamical case, compressive sensing can not be used and, if the state dimension is high, the particle filter would perform poorly. In this paper we combine one of the most novel developments in compressive sensing, nonlinear compressive sensing, with the particle filter. We show that the marriage of the two is essential and that neither the particle filter or nonlinear compressive sensing alone gives a satisfying solution.

eess.SY↗

arXiv2013

Quadratic Basis Pursuit

In many compressive sensing problems today, the relationship between the measurements and the unknowns could be nonlinear. Traditional treatment of such nonlinear relationships have been to approximate the nonlinearity via a linear model and the subsequent un-modeled dynamics as noise. The ability to more accurately characterize nonlinear models has the potential to improve the results in both existing compressive sensing applications and those where a linear approximation does not suffice, e.g., phase retrieval. In this paper, we extend the classical compressive sensing framework to a second-order Taylor expansion of the nonlinearity. Using a lifting technique and a method we call quadratic basis pursuit, we show that the sparse signal can be recovered exactly when the sampling rate is sufficiently high. We further present efficient numerical algorithms to recover sparse signals in second-order nonlinear systems, which are considerably more difficult to solve than their linear counterparts in sparse optimization.

cs.IT↗

arXiv2012

Extremely fast focal-plane wavefront sensing for extreme adaptive optics

We present a promising approach to the extremely fast sensing and correction of small wavefront errors in adaptive optics systems. As our algorithm's computational complexity is roughly proportional to the number of actuators, it is particularly suitable to systems with 10,000 to 100,000 actuators. Our approach is based on sequential phase diversity and simple relations between the point-spread function and the wavefront error in the case of small aberrations. The particular choice of phase diversity, introduced by the deformable mirror itself, minimizes the wavefront error as well as the computational complexity. The method is well suited for high-contrast astronomical imaging of point sources such as the direct detection and characterization of exoplanets around stars, and it works even in the presence of a coronagraph that suppresses the diffraction pattern. The accompanying paper in these proceedings by Korkiakoski et al. describes the performance of the algorithm using numerical simulations and laboratory tests.

astro-ph.IM↗