Classification of settlement areas in remote sensing imagery using conditional random fields

Land cover classification plays a key role for various geo-based applications. Numerous approaches for the classification of settlements in remote sensing imagery have been developed. Most of them assume the features of neighbouring image sites to be conditionally independent. Using spatial context information may enhance classification accuracy, because dependencies of neighbouring areas are taken into account. Conditional Random Fields (CRF) have become popular in the field of pattern recognition for incorporating contextual information because of their ability to model dependencies not only between the class labels of neighbouring image sites, but also between the labels and the image features. In this work we investigate the potential of CRF for the classification of settlements in high resolution satellite imagery. To highlight the power of CRF, tests were carried out using only a minimum set of features and a simple model of context. Experiments were performed on an Ikonos scene of a rural area in Germany. In our experiments, completeness and correctness values of 90% and better could be achieved, the CRF approach was clearly outperforming a standard Maximum-Likelihood-classification based on the same set of features

Joint Bayesian Hierarchical Inversion-Classification and Application in Proteomics

nb de pages: 4International audienceIn this paper, we combine inverse problem and classification for LC-MS data in a joint Bayesian context, given a set of biomarkers and the statistical characteristics of the biological classes. The data acquisition is modelled in a hierarchical way, including random decomposition of proteins into peptides and peptides into ions associated to peaks on the LC-MS measurement. A Bayesian global inversion, based on the hierarchical model for the direct problem, enables to take into account the biological and technological variabilities from those random processes and to estimate the parameters efficiently. We describe the statistical theoretical framework including the hierarchical direct model, the prior and posterior distributions and the estimators for the involved parameters. We resort to the MCMC algorithm and give preliminary results on a simulated data set

Discriminative methods for classification of asynchronous imaginary motor tasks from EEG data

In this work, two methods based on statistical models that take into account the temporal changes in the electroencephalographic (EEG) signal are proposed for asynchronous brain-computer interfaces (BCI) based on imaginary motor tasks. Unlike the current approaches to asynchronous BCI systems that make use of windowed versions of the EEG data combined with static classifiers, the methods proposed here are based on discriminative models that allow sequential labeling of data. In particular, the two methods we propose for asynchronous BCI are based on conditional random fields (CRFs) and latent dynamic CRFs (LDCRFs), respectively. We describe how the asynchronous BCI problem can be posed as a classification problem based on CRFs or LDCRFs, by defining appropriate random variables and their relationships. CRF allows modeling the extrinsic dynamics of data, making it possible to model the transitions between classes, which in this context correspond to distinct tasks in an asynchronous BCI system. On the other hand, LDCRF goes beyond this approach by incorporating latent variables that permit modeling the intrinsic structure for each class and at the same time allows modeling extrinsic dynamics. We apply our proposed methods on the publicly available BCI competition III dataset V as well as a data set recorded in our laboratory. Results obtained are compared to the top algorithm in the BCI competition as well as to methods based on hierarchical hidden Markov models (HHMMs), hierarchical hidden CRF (HHCRF), neural networks based on particle swarm optimization (IPSONN) and to a recently proposed approach based on neural networks and fuzzy theory, the S-dFasArt. Our experimental analysis demonstrates the improvements provided by our proposed methods in terms of classification accuracy

Exploiting Contextual Information for Prosodic Event Detection Using Auto-Context

Prosody and prosodic boundaries carry significant information regarding linguistics and paralinguistics and are important aspects of speech. In the field of prosodic event detection, many local acoustic features have been investigated; however, contextual information has not yet been thoroughly exploited. The most difficult aspect of this lies in learning the long-distance contextual dependencies effectively and efficiently. To address this problem, we introduce the use of an algorithm called auto-context. In this algorithm, a classifier is first trained based on a set of local acoustic features, after which the generated probabilities are used along with the local features as contextual information to train new classifiers. By iteratively using updated probabilities as the contextual information, the algorithm can accurately model contextual dependencies and improve classification ability. The advantages of this method include its flexible structure and the ability of capturing contextual relationships. When using the auto-context algorithm based on support vector machine, we can improve the detection accuracy by about 3% and F-score by more than 7% on both two-way and four-way pitch accent detections in combination with the acoustic context. For boundary detection, the accuracy improvement is about 1% and the F-score improvement reaches 12%. The new algorithm outperforms conditional random fields, especially on boundary detection in terms of F-score. It also outperforms an n-gram language model on the task of pitch accent detection

3D classification of crossroads from multiple aerial images using markov random fields

The precise classification and reconstruction of crossroads from multiple aerial images is a challenging problem in remote sensing. We apply the Markov Random Fields (MRF) approach to this problem, a probabilistic model that can be used to consider context in classification. A simple appearance-based model is combined with a probabilistic model of the co-occurrence of class label at neighbouring image sites to distinguish up to 14 different classes that are relevant for scenes containing crossroads. The parameters of these models are learnt from training data. We use multiple overlap aerial images to derive a digital surface model (DSM) and a true orthophoto without moving cars. From the DSM and the orthophoto we derive feature vectors that are used in the classification. One of the features is a car confidence value that is supposed to support the classification when the road surface is occluded by static cars. Our approach is evaluated on a dataset of airborne photos of an urban area by a comparison of the results to reference data. Whereas the method has problems in distinguishing classes having a similar appearance, it is shown to produce promising results if a reduced set of classes is considered, yielding an overall classification accuracy of 74.8%

Estimation of the normalized coherency matrix through the SIRV model. Application to high resolution POLSAR data

8 pagesInternational audienceIn the context of non-Gaussian polarimetric clutter models, this paper presents an application of the recent advances in the field of Spherically Invariant Random Vectors (SIRV) modelling for coherency matrix estimation in heterogeneous clutter. The complete description of the POLSAR data set is achieved by estimating the span and the normalized coherency independently. The normalized coherency describes the polarimetric diversity, while the span indicates the total received power. The main advantages of the proposed Fixed Point estimator are that it does not require any "a priori" information about the probability density function of the texture (or span) and it can be directly applied on adaptive neighbourhoods. Interesting results are obtained when coupling this Fixed Point estimator with an adaptive spatial support based on the scalar span information. Based on the SIRV model, a new maximum likelihood distance measure is introduced for unsupervised POLSAR classification. The proposed method is tested with airborne POLSAR images provided by the RAMSES system. Results of entropy/alpha/anisotropy decomposition, followed by unsupervised classification, allow discussing the use of the normalized coherency and the span as two separate descriptors of POLSAR data sets

Return of the features. Efficient feature selection and interpretation for photometric redshifts

The explosion of data in recent years has generated an increasing need for new analysis techniques in order to extract knowledge from massive datasets. Machine learning has proved particularly useful to perform this task. Fully automatized methods have recently gathered great popularity, even though those methods often lack physical interpretability. In contrast, feature based approaches can provide both well-performing models and understandable causalities with respect to the correlations found between features and physical processes. Efficient feature selection is an essential tool to boost the performance of machine learning models. In this work, we propose a forward selection method in order to compute, evaluate, and characterize better performing features for regression and classification problems. Given the importance of photometric redshift estimation, we adopt it as our case study. We synthetically created 4,520 features by combining magnitudes, errors, radii, and ellipticities of quasars, taken from the SDSS. We apply a forward selection process, a recursive method in which a huge number of feature sets is tested through a kNN algorithm, leading to a tree of feature sets. The branches of the tree are then used to perform experiments with the random forest, in order to validate the best set with an alternative model. We demonstrate that the sets of features determined with our approach improve the performances of the regression models significantly when compared to the performance of the classic features from the literature. The found features are unexpected and surprising, being very different from the classic features. Therefore, a method to interpret some of the found features in a physical context is presented. The methodology described here is very general and can be used to improve the performance of machine learning models for any regression or classification task.Comment: 21 pages, 11 figures, accepted for publication on A&A, final version after language revisio

Radar discrimination of small airborne targets through kinematic features and machine learning

This work studies binary classification problem for small airborne targets (drones vs other) by means of their trajectory analysis. For this purpose a set of the kinematic features extracted from drone trajectories using radar detections with a classification scheme that utilises Random Forests is proposed. The development is based on experimental data acquired from the Holographic radar from Aveillant Ltd. An approach for real-time classification is proposed, where an adaptive sliding window procedure is employed to make predictions over time from trajectories. Several models utilising different kinematic features (angle, slope, velocity, and their combination) are studied. The best model achieves an accuracy of more than 95%. In addition, fundamental issues with imbalanced datasets in the context of this topic are raised and illustrated using the collected data