Toward omnidirectional and automated imaging system for measuring oceanic whitecap coverage.

Accurate measurements of the oceanic whitecap coverage from whitecap images are required for better understanding the air-gas transfer and aerosol production processes. However, this is a challenging task because the whitecap patches are formed immediately after the wave breaks and are spread over a wide area. The main challenges in designing a whitecap-imaging instrument are the small field of view of the camera lens, processing large numbers of images, recording data over long time periods, and deployment difficulties in stormy conditions. This paper describes the design of a novel high-resolution optical instrument for imaging oceanic whitecaps and the automated algorithm processing the collected images. The instrument was successfully deployed in 2013 as part of the HiWINGS campaign in the North Atlantic Ocean. The instrument uses a fish-eye camera lens to image the whitecaps in wide angle of view (180°).

Efficient sparse kernel feature extraction based on partial least squares.

The presence of irrelevant features in training data is a significant obstacle for many machine learning tasks. One approach to this problem is to extract appropriate features and, often, one selects a feature extraction method based on the inference algorithm. Here, we formalize a general framework for feature extraction, based on Partial Least Squares, in which one can select a user-defined criterion to compute projection directions. The framework draws together a number of existing results and provides additional insights into several popular feature extraction methods. Two new sparse kernel feature extraction methods are derived under the framework, called Sparse Maximal Alignment (SMA) and Sparse Maximal Covariance (SMC), respectively. Key advantages of these approaches include simple implementation and a training time which scales linearly in the number of examples. Furthermore, one can project a new test example using only k kernel evaluations, where k is the output dimensionality. Computational results on several real-world data sets show that SMA and SMC extract features which are as predictive as those found using other popular feature extraction methods. Additionally, on large text retrieval and face detection data sets, they produce features which match the performance of the original ones in conjunction with a Support Vector Machine.

A signal theory approach to support vector classification: the sinc kernel.

Fourier-based regularisation is considered for the support vector machine classification problem over absolutely integrable loss functions. By invoking the modest assumption that the decision function belongs to a Paley-Wiener space, it is shown that the classification problem can be developed in the context of signal theory. Furthermore, by employing the Paley-Wiener reproducing kernel, namely the sinc function, it is shown that a principled and finite kernel hyper-parameter search space can be discerned, a priori. Subsequent simulations performed on a commonly-available hyperspectral image data set reveal that the approach yields results that surpass state-of-the-art benchmarks.

Customizing kernel functions for SVM-based hyperspectral image classification.

Previous research applying kernel methods such as support vector machines (SVMs) to hyperspectral image classification has achieved performance competitive with the best available algorithms. However, few efforts have been made to extend SVMs to cover the specific requirements of hyperspectral image classification, for example, by building tailor-made kernels. Observation of real-life spectral imagery from the AVIRIS hyperspectral sensor shows that the useful information for classification is not equally distributed across bands, which provides potential to enhance the SVM's performance through exploring different kernel functions. Spectrally weighted kernels are, therefore, proposed, and a set of particular weights is chosen by either optimizing an estimate of generalization error or evaluating each band's utility level. To assess the effectiveness of the proposed method, experiments are carried out on the publicly available 92AV3C dataset collected from the 220-dimensional AVIRIS hyperspectral sensor. Results indicate that the method is generally effective in improving performance: spectral weighting based on learning weights by gradient descent is found to be slightly better than an alternative method based on estimating "relevance" between band information and ground truth.

Machine learning can improve prediction of severity in acute pancreatitis using admission values of APACHE II score and C-reactive protein.

BACKGROUND: Acute pancreatitis (AP) has a variable course. Accurate early prediction of severity is essential to direct clinical care. Current assessment tools are inaccurate, and unable to adapt to new parameters. None of the current systems uses C-reactive protein (CRP). Modern machine-learning tools can address these issues. METHODS: 370 patients admitted with AP in a 5-year period were retrospectively assessed; after exclusions, 265 patients were studied. First recorded values for physical examination and blood tests, aetiology, severity and complications were recorded. A kernel logistic regression model was used to remove redundant features, and identify the relationships between relevant features and outcome. Bootstrapping was used to make the best use of data and obtain confidence estimates on the parameters of the model. RESULTS: A model containing 8 variables (age, CRP, respiratory rate, pO2 on air, arterial pH, serum creatinine, white cell count and GCS) predicted a severe attack with an area under the receiver-operating characteristic curve (AUC) of 0.82 (SD 0.01). The optimum cut-off value for predicting severity gave sensitivity and specificity of 0.87 and 0.71 respectively. The predictions were significantly better (p = 0.0036) than admission APACHE II scores in the same patients (AUC 0.74) and better than historical admission APACHE II data (AUC 0.68-0.75). CONCLUSIONS: This system for the first time combines admission values of selected components of APACHE II and CRP for prediction of severe AP. The score is simple to use, and is more accurate than admission APACHE II alone. It is adaptable and would allow incorporation of new predictive factors.

Rank-shaping regularization of exponential spectral analysis for application to functional parametric mapping.

Compartmental models are widely used for the mathematical modelling of dynamic studies acquired with positron emission tomography (PET). The numerical problem involves the estimation of a sum of decaying real exponentials convolved with an input function. In exponential spectral analysis (SA), the nonlinear estimation of the exponential functions is replaced by the linear estimation of the coefficients of a predefined set of exponential basis functions. This set-up guarantees fast estimation and attainment of the global optimum. SA, however, is hampered by high sensitivity to noise and, because of the positivity constraints implemented in the algorithm, cannot be extended to reference region modelling. In this paper, SA limitations are addressed by a new rank-shaping (RS) estimator that defines an appropriate regularization over an unconstrained least-squares solution obtained through singular value decomposition of the exponential base. Shrinkage parameters are conditioned on the expected signal-to-noise ratio. Through application to simulated and real datasets, it is shown that RS ameliorates and extends SA properties in the case of the production of functional parametric maps from PET studies.

Positron emission tomography compartmental models: a basis pursuit strategy for kinetic modeling.

A kinetic modeling approach for the quantification of in vivo tracer studies with dynamic positron emission tomography (PET) is presented. The approach is based on a general compartmental description of the tracer's fate in vivo and determines a parsimonious model consistent with the measured data. The technique involves the determination of a sparse selection of kinetic basis functions from an overcomplete dictionary using the method of basis pursuit denoising. This enables the characterization of the systems impulse response function from which values of the systems macro parameters can be estimated. These parameter estimates can be obtained from a region of interest analysis or as parametric images from a voxel-based analysis. In addition, model order estimates are returned that correspond to the number of compartments in the estimated compartmental model. Validation studies evaluate the methods performance against two preexisting data led techniques, namely, graphical analysis and spectral analysis. Application of this technique to measured PET data is demonstrated using [11C]diprenorphine (opiate receptor) and [11C]WAY-100635 (5-HT1A receptor). Although the method is presented in the context of PET neuroreceptor binding studies, it has general applicability to the quantification of PET/SPECT radiotracer studies in neurology, oncology, and cardiology.