A unifying view of multiple kernel learning

Recent research on multiple kernel learning has lead to a number of approaches for combining kernels in regularized risk minimization. The proposed approaches include different formulations of objectives and varying regularization strategies. In this paper we present a unifying optimization criterion for multiple kernel learning and show how existing formulations are subsumed as special cases. We also derive the criterion’s dual representation, which is suitable for general smooth optimization algorithms. Finally, we evaluate multiple kernel learning in this framework analytically using a Rademacher complexity bound on the generalization error and empirically in a set of experiments.

A unifying view of multiple kernel learning

Recent research on multiple kernel learning has lead to a number of approaches for combining kernels in regularized risk minimization. The proposed approaches include different formulations of objectives and varying regularization strategies. In this paper we present a unifying general optimization criterion for multiple kernel learning and show how existing formulations are subsumed as special cases. We also derive the criterion's dual representation, which is suitable for general smooth optimization algorithms. Finally, we evaluate multiple kernel learning in this framework analytically using a Rademacher complexity bound on the generalization error and empirically in a set of experiments.

Learning the Kernel Matrix with Semi-Definite Programming

Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information is contained in the so-called kernel matrix, a symmetric and positive definite matrix that encodes the relative positions of all points. Specifying this matrix amounts to specifying the geometry of the embedding space and inducing a notion of similarity in the input space -- classical model selection problems in machine learning. In this paper we show how the kernel matrix can be learned from data via semi-definite programming (SDP) techniques. When applied to a kernel matrix associated with both training and test data this gives a powerful transductive algorithm -- using the labelled part of the data one can learn an embedding also for the unlabelled part. The similarity between test points is inferred from training points and their labels. Importantly, these learning problems are convex, so we obtain a method for learning both the model class and the function without local minima. Furthermore, this approach leads directly to a convex method to learn the 2-norm soft margin parameter in support vector machines, solving another important open problem. Finally, the novel approach presented in the paper is supported by positive empirical results.

The rademacher complexity of coregularized kernel classes

In the multi-view approach to semisupervised learning, we choose one predictor from each of multiple hypothesis classes, and we co-regularize our choices by penalizing disagreement among the predictors on the unlabeled data. We examine the co-regularization method used in the co-regularized least squares (CoRLS) algorithm, in which the views are reproducing kernel Hilbert spaces (RKHS's), and the disagreement penalty is the average squared difference in predictions. The final predictor is the pointwise average of the predictors from each view. We call the set of predictors that can result from this procedure the co-regularized hypothesis class. Our main result is a tight bound on the Rademacher complexity of the co-regularized hypothesis class in terms of the kernel matrices of each RKHS. We find that the co-regularization reduces the Rademacher complexity by an amount that depends on the distance between the two views, as measured by a data dependent metric. We then use standard techniques to bound the gap between training error and test error for the CoRLS algorithm. Experimentally, we find that the amount of reduction in complexity introduced by co regularization correlates with the amount of improvement that co-regularization gives in the CoRLS algorithm.

The undirected feedback vertex set problem has a Poly(k) Kernel

Resolving a noted open problem, we show that the Undirected Feedback Vertex Set problem, parameterized by the size of the solution set of vertices, is in the parameterized complexity class Poly(k), that is, polynomial-time pre-processing is sufficient to reduce an initial problem instance (G, k) to a decision-equivalent simplified instance (G', k') where k' � k, and the number of vertices of G' is bounded by a polynomial function of k. Our main result shows an O(k11) kernelization bound.

Using Fiber Bragg Grating (FBG) sensors for vertical displacement measurement of bridges

In many bridges, vertical displacements are one of the most relevant parameters for structural health monitoring in both the short and long terms. Bridge managers around the globe are always looking for a simple way to measure vertical displacements of bridges. However, it is difficult to carry out such measurements. On the other hand, in recent years, with the advancement of fiber-optic technologies, fiber Bragg grating (FBG) sensors are more commonly used in structural health monitoring due to their outstanding advantages including multiplexing capability, immunity of electromagnetic interference as well as high resolution and accuracy. For these reasons, using FBG sensors is proposed to develop a simple, inexpensive and practical method to measure vertical displacements of bridges. A curvature approach for vertical displacement measurement using curvature measurements is proposed. In addition, with the successful development of a FBG tilt sensors, an inclination approach is also proposed using inclination measurements. A series of simulation tests of a full-scale bridge was conducted. It shows that both the approaches can be implemented to determine vertical displacements for bridges with various support conditions, varying stiffness (EI) along the spans and without any prior known loading. These approaches can thus measure vertical displacements for most of slab-on-girder and box-girder bridges. Moreover, with the advantages of FBG sensors, they can be implemented to monitor bridge behavior remotely and in real time. Further recommendations of these approaches for developments will also be discussed at the end of the paper.

Fiber Bragg Grating sensors for railway systems

Fiber Bragg grating (FBG) sensor technology has been attracting substantial industrial interests for the last decade. FBG sensors have seen increasing acceptance and widespread use for structural sensing and health monitoring applications in composites, civil engineering, aerospace, marine, oil & gas, and smart structures. One transportation system that has been benefitted tremendously from this technology is railways, where it is of the utmost importance to understand the structural and operating conditions of rails as well as that of freight and passenger service cars to ensure safe and reliable operation. Fiberoptic sensors, mostly in the form of FBGs, offer various important characteristics, such as EMI/RFI immunity, multiplexing capability, and very long-range interrogation (up to 230 km between FBGs and measurement unit), over the conventional electrical sensors for the distinctive operational conditions in railways. FBG sensors are unique from other types of fiber-optic sensors as the measured information is wavelength-encoded, which provides self-referencing and renders their signals less susceptible to intensity fluctuations. In addition, FBGs are reflective sensors that can be interrogated from either end, providing redundancy to FBG sensing networks. These two unique features are particularly important for the railway industry where safe and reliable operations are the major concerns. Furthermore, FBGs are very versatile and transducers based on FBGs can be designed to measure a wide range of parameters such as acceleration and inclination. Consequently, a single interrogator can deal with a large number of FBG sensors to measure a multitude of parameters at different locations that spans over a large area.

A high sensitive fiber Bragg grating strain sensor with automatic temperature compensation

A high sensitive fiber Bragg grating (FBG) strain sensor with automatic temperature compensation is demonstrated. FBG is axially linked with a stick and their free ends are fixed to the measured object. When the measured strain changes, the stick does not change in length, but the FBG does. When the temperature changes, the stick changes in length to pull the FBG to realize temperature compensation. In experiments, 1.45 times strain sensitivity of bare FBG with temperature compensation of less than 0.1 nm Bragg wavelength drift over 100 ◦C shift is achieved.

A high sensitive fiber Bragg grating cryogenic temperature sensor

At cryogenic temperature, a fiber Bragg grating (FBG) temperature sensor with controllable sensitivity and variable measurement range is demonstrated by using bimetal configuration. In experiments, sensitivities of -51.2, -86.4, and -520 pm/K are achieved by varying the lengths of the metals. Measurement ranges of 293-290.5, 283-280.5, and 259-256.5 K are achieved by shortening the distance of the gap among the metals.

Using fiber Bragg grating in geothermal monitoring

Earthquake precursor monitoring is the foundation of earthquake prediction and geothermal monitoring is one of the basic methods of earthquake precursor monitoring. High temperature well contains more information and therefore its monitoring is more important. However, electric sensors are hard to meet the monitoring requirements of high sensitivity and long lifetime. For a better observation of the earthquake precursor, a high sensitive fiber Bragg grating (FBG) temperature sensor is designed to monitoring a well at 87.5±1◦C. The performance of the FBG sensor demonstrates that it’s quite possible that applying FBG to high-sensitivity temperature-monitoring fields, such as geothermal monitoring. As far as we known, it is the first time that trying a high sensitive FBG temperature sensor in a practical application, let alone in the field of geothermal monitoring.

Fiber Bragg grating strain modulation based on nonlinear string transverse force amplifier

The only effective method of Fiber Bragg Grating (FBG) strain modulation has been by changing the distance between its two fixed ends. We demonstrate an alternative being more sensitive to force based on the nonlinear amplification relationship between a transverse force applied to a stretched string and its induced axial force. It may improve the sensitivity and size of an FBG force sensor, reduce the number of FBGs needed for multi-axial force monitoring, and control the resonant frequency of an FBG accelerometer.

Static vertical displacement measurement of bridges using Fiber Bragg Grating (FBG) sensors

Vertical displacements are one of the most relevant parameters for structural health monitoring of bridges in both the short and long terms. Bridge managers around the globe are always looking for a simple way to measure vertical displacements of bridges. However, it is difficult to carry out such measurements. On the other hand, in recent years, with the advancement of fiber-optic technologies, fiber Bragg grating (FBG) sensors are more commonly used in structural health monitoring due to their outstanding advantages including multiplexing capability, immunity of electromagnetic interference as well as high resolution and accuracy. For these reasons, using FBG sensors is proposed to develop a simple, inexpensive and practical method to measure vertical displacements of bridges. A curvature approach for vertical displacement measurements using curvature measurements is proposed. In addition, with the successful development of FBG tilt sensors, an inclination approach is also proposed using inclination measurements. A series of simulation tests of a full- scale bridge was conducted. It shows that both of the approaches can be implemented to determine vertical displacements for bridges with various support conditions, varying stiffness (EI) along the spans and without any prior known loading. These approaches can thus measure vertical displacements for most of slab-on-girder and box-girder bridges. Besides, the approaches are feasible to implement for bridges under various loading. Moreover, with the advantages of FBG sensors, they can be implemented to monitor bridge behavior remotely and in real time. A beam loading test was conducted to determine vertical displacements using FBG strain sensors and tilt sensors. The discrepancies as compared with dial gauges reading using the curvature and inclination approaches are 0.14mm (1.1%) and 0.41mm (3.2%), respectively. Further recommendations of these approaches for developments will also be discussed at the end of the paper.

Kernel analysis on Grassmann manifolds for action recognition

Modelling video sequences by subspaces has recently shown promise for recognising human actions. Subspaces are able to accommodate the effects of various image variations and can capture the dynamic properties of actions. Subspaces form a non-Euclidean and curved Riemannian manifold known as a Grassmann manifold. Inference on manifold spaces usually is achieved by embedding the manifolds in higher dimensional Euclidean spaces. In this paper, we instead propose to embed the Grassmann manifolds into reproducing kernel Hilbert spaces and then tackle the problem of discriminant analysis on such manifolds. To achieve efficient machinery, we propose graph-based local discriminant analysis that utilises within-class and between-class similarity graphs to characterise intra-class compactness and inter-class separability, respectively. Experiments on KTH, UCF Sports, and Ballet datasets show that the proposed approach obtains marked improvements in discrimination accuracy in comparison to several state-of-the-art methods, such as the kernel version of affine hull image-set distance, tensor canonical correlation analysis, spatial-temporal words and hierarchy of discriminative space-time neighbourhood features.