Decoupling method for vector control of the brushless doubly-fed machine

The brushless doubly-fed machine exhibits rotor-speed-dependent, cross-coupling effects between inputs and outputs when vector control is implemented. Manipulation of the model equations shows that these effects are represented by rotation angles. A parameter-independent decoupling method is presented which reduces these cross-coupling disturbances by estimating the rotation angle and applying it back to the controller. © 2013 IEEE.

SLP: A zero-contact non-invasive method for pulmonary function testing

Structured Light Plethysmography (SLP) is a novel non-invasive method that uses structured light to perform pulmonary function testing that does not require physical contact with a patient. The technique produces an estimate of chest wall volume changes over time. A patient is observed continuously by two cameras and a known pattern of light (i.e. structured light) is projected onto the chest using an off-the-shelf projector. Corner features from the projected light pattern are extracted, tracked and brought into correspondence for both camera views over successive frames. A novel self calibration algorithm recovers the intrinsic and extrinsic camera parameters from these point correspondences. This information is used to reconstruct a surface approximation of the chest wall and several novel ideas for 'cleaning up' the reconstruction are used. The resulting volume and derived statistics (e.g. FVC, FEV) agree very well with data taken with a spirometer. © 2010. The copyright of this document resides with its authors.

Fixed-rank matrix factorizations and Riemannian low-rank optimization

Motivated by the problem of learning a linear regression model whose parameter is a large fixed-rank non-symmetric matrix, we consider the optimization of a smooth cost function defined on the set of fixed-rank matrices. We adopt the geometric framework of optimization on Riemannian quotient manifolds. We study the underlying geometries of several well-known fixed-rank matrix factorizations and then exploit the Riemannian quotient geometry of the search space in the design of a class of gradient descent and trust-region algorithms. The proposed algorithms generalize our previous results on fixed-rank symmetric positive semidefinite matrices, apply to a broad range of applications, scale to high-dimensional problems, and confer a geometric basis to recent contributions on the learning of fixed-rank non-symmetric matrices. We make connections with existing algorithms in the context of low-rank matrix completion and discuss the usefulness of the proposed framework. Numerical experiments suggest that the proposed algorithms compete with state-of-the-art algorithms and that manifold optimization offers an effective and versatile framework for the design of machine learning algorithms that learn a fixed-rank matrix. © 2013 Springer-Verlag Berlin Heidelberg.