On-line learning of mutually orthogonal subspaces for face recognition by image sets.

We address the problem of face recognition by matching image sets. Each set of face images is represented by a subspace (or linear manifold) and recognition is carried out by subspace-to-subspace matching. In this paper, 1) a new discriminative method that maximises orthogonality between subspaces is proposed. The method improves the discrimination power of the subspace angle based face recognition method by maximizing the angles between different classes. 2) We propose a method for on-line updating the discriminative subspaces as a mechanism for continuously improving recognition accuracy. 3) A further enhancement called locally orthogonal subspace method is presented to maximise the orthogonality between competing classes. Experiments using 700 face image sets have shown that the proposed method outperforms relevant prior art and effectively boosts its accuracy by online learning. It is shown that the method for online learning delivers the same solution as the batch computation at far lower computational cost and the locally orthogonal method exhibits improved accuracy. We also demonstrate the merit of the proposed face recognition method on portal scenarios of multiple biometric grand challenge.

On-line topographic analysis in the SEM

A novel method for on-line topographic analysis of rough surfaces in the SEM has been investigated. It utilises a digital minicomputer configured to act as a programmable scan generator and automatic focusing unit. The computer is coupled to the microscope through digital-to-analogue converters which enable it to generate ramp waveforms allowing the beam to be scanned over a small sub-region of the field under program control. A further digital-to-analogue converter regulates the current supply to the objective lens of the microscope. The video signal is sampled by means of an analogue-to-digital converter and the resultant binary code stored in the computer's memory as an array of numbers describing relative image intensity. Computations based on the intensity gradient of the image allow the objective lens current to be found for the in-focus condition, which may be related to the working distance through a previous calibration experiment. The sensitivity of the method for detecting small height changes is theoretically of the order of 1 μm. In practice the operator specifies features of interest by means of a mobile spot cursor injected into the SEM display screen, or he may scan the specimen at sub-regions corresponding to pre-determined points on a regular grid defined by him. The operation then proceeds under program control. | A novel method for on-line topographic analysis of rough surfaces in the SEM has been investigated. It utilizes a digital minicomputer configured to act as a programmable scan generator and automatic focusing unit. A further digital-to-analog converter regulates the current supply to the objective lens of the microscope. The video signal is sampled by means of an analog-to-digital converter and the resultant binary code stored in the computer's memory as an array of numbers describing relative image intensity. The sensitivity of the method for detecting small height changes is theroretically of the order of 1 mu m.

ON-LINE STEREO PROCESSING FOR THE SEM.

A convenient system for the rapid extraction of three dimensional information from pairs of SEM images has been constructed, eliminating the need for time-consuming photography. Results are produced in a digestable form. Distortions inherent in the SEM record display and in the photographic system are not relevant to the system described; only those arising within the column and stage need be considered.

On-line policy optimisation of spoken dialogue systems via live interaction with human subjects

Statistical dialogue models have required a large number of dialogues to optimise the dialogue policy, relying on the use of a simulated user. This results in a mismatch between training and live conditions, and significant development costs for the simulator thereby mitigating many of the claimed benefits of such models. Recent work on Gaussian process reinforcement learning, has shown that learning can be substantially accelerated. This paper reports on an experiment to learn a policy for a real-world task directly from human interaction using rewards provided by users. It shows that a usable policy can be learnt in just a few hundred dialogues without needing a user simulator and, using a learning strategy that reduces the risk of taking bad actions. The paper also investigates adaptation behaviour when the system continues learning for several thousand dialogues and highlights the need for robustness to noisy rewards. © 2011 IEEE.

Uncertainty management for on-line optimisation of a POMDP-based large-scale spoken dialogue system

The optimization of dialogue policies using reinforcement learning (RL) is now an accepted part of the state of the art in spoken dialogue systems (SDS). Yet, it is still the case that the commonly used training algorithms for SDS require a large number of dialogues and hence most systems still rely on artificial data generated by a user simulator. Optimization is therefore performed off-line before releasing the system to real users. Gaussian Processes (GP) for RL have recently been applied to dialogue systems. One advantage of GP is that they compute an explicit measure of uncertainty in the value function estimates computed during learning. In this paper, a class of novel learning strategies is described which use uncertainty to control exploration on-line. Comparisons between several exploration schemes show that significant improvements to learning speed can be obtained and that rapid and safe online optimisation is possible, even on a complex task. Copyright © 2011 ISCA.

On-line policy optimisation of Bayesian spoken dialogue systems via human interaction

A partially observable Markov decision process has been proposed as a dialogue model that enables robustness to speech recognition errors and automatic policy optimisation using reinforcement learning (RL). However, conventional RL algorithms require a very large number of dialogues, necessitating a user simulator. Recently, Gaussian processes have been shown to substantially speed up the optimisation, making it possible to learn directly from interaction with human users. However, early studies have been limited to very low dimensional spaces and the learning has exhibited convergence problems. Here we investigate learning from human interaction using the Bayesian Update of Dialogue State system. This dynamic Bayesian network based system has an optimisation space covering more than one hundred features, allowing a wide range of behaviours to be learned. Using an improved policy model and a more robust reward function, we show that stable learning can be achieved that significantly outperforms a simulator trained policy. © 2013 IEEE.

Application of ICA in on-line verification of the phase difference of the current sensor

The performance of the current sensor in power equipment may become worse affected by the environment. In this paper, based on ICA, we propose a method for on-line verification of the phase difference of the current sensor. However, not all source components are mutually independent in our application. In order to get an exact result, we have proposed a relative likelihood index to choose an optimal result from different runs. The index is based on the maximum likelihood evaluation theory and the independent subspace analysis. The feasibility of our method has been confirmed by experimental results.

Application of ICA in on-line verification of the phase difference of the current sensor

The performance of the current sensor in power equipment may become worse affected by the environment. In this paper, based on ICA, we propose a method for on-line verification of the phase difference of the current sensor. However, not all source components are mutually independent in our application. In order to get an exact result, we have proposed a relative likelihood index to choose an optimal result from different runs. The index is based on the maximum likelihood evaluation theory and the independent subspace analysis. The feasibility of our method has been confirmed by experimental results.