4,154 research outputs found

    Uncovering elements of style

    Get PDF
    This paper relates the style of 16th century Flemish paintings by Goossen van der Weyden (GvdW) to the style of preliminary sketches or underpaintings made prior to executing the painting. Van der Weyden made underpaintings in markedly different styles for reasons as yet not understood by art historians. The analysis presented here starts from a classification of the underpaintings into four distinct styles by experts in art history. Analysis of the painted surfaces by a combination of wavelet analysis, hidden Markov trees and boosting algorithms can distinguish the four underpainting styles with greater than 90% cross-validation accuracy. On a subsequent blind test this classifier provided insight into the hypothesis by art historians that different patches of the finished painting were executed by different hands

    Improving fusion of surveillance images in sensor networks using independent component analysis

    Get PDF

    Adaptive Markov random fields for joint unmixing and segmentation of hyperspectral image

    Get PDF
    Linear spectral unmixing is a challenging problem in hyperspectral imaging that consists of decomposing an observed pixel into a linear combination of pure spectra (or endmembers) with their corresponding proportions (or abundances). Endmember extraction algorithms can be employed for recovering the spectral signatures while abundances are estimated using an inversion step. Recent works have shown that exploiting spatial dependencies between image pixels can improve spectral unmixing. Markov random fields (MRF) are classically used to model these spatial correlations and partition the image into multiple classes with homogeneous abundances. This paper proposes to define the MRF sites using similarity regions. These regions are built using a self-complementary area filter that stems from the morphological theory. This kind of filter divides the original image into flat zones where the underlying pixels have the same spectral values. Once the MRF has been clearly established, a hierarchical Bayesian algorithm is proposed to estimate the abundances, the class labels, the noise variance, and the corresponding hyperparameters. A hybrid Gibbs sampler is constructed to generate samples according to the corresponding posterior distribution of the unknown parameters and hyperparameters. Simulations conducted on synthetic and real AVIRIS data demonstrate the good performance of the algorithm

    Thirty years of land cover and fraction cover changes over the Sudano-Sahel using landsat time series

    Get PDF
    Historical land cover maps are of high importance for scientists and policy makers studying the dynamic character of land cover change in the Sudano-Sahel, including anthropogenic and climatological drivers. Despite its relevance, an accurate high resolution record of historical land cover maps is currently lacking over the Sudano-Sahel. In this study, 30 m resolution historically consistent land cover and cover fraction maps are provided over the Sudano-Sahel for the period 1986–2015. These land cover/cover fraction maps are achieved based on the Landsat archive preprocessed on Google Earth Engine and a random forest classification/regression model, while historical consistency is achieved using the hidden Markov model. Using these historical maps, a multitude of variability in the dynamic Sudano-Sahel region over the past 30 years is revealed. On the one hand, Sahel-wide cropland expansion and the re-greening of the Sahel is observed in the discrete land cover classification. On the other hand, subtle changes such as forest degradation are detected based on the cover fraction maps. Additionally, exploiting the 30 m spatial resolution, fine-scale changes, such as smallholder or subsistence farming, can be detected. The historical land cover/cover fraction maps presented in this study are made available via an open-access platform

    Bidirectional-Convolutional LSTM Based Spectral-Spatial Feature Learning for Hyperspectral Image Classification

    Full text link
    This paper proposes a novel deep learning framework named bidirectional-convolutional long short term memory (Bi-CLSTM) network to automatically learn the spectral-spatial feature from hyperspectral images (HSIs). In the network, the issue of spectral feature extraction is considered as a sequence learning problem, and a recurrent connection operator across the spectral domain is used to address it. Meanwhile, inspired from the widely used convolutional neural network (CNN), a convolution operator across the spatial domain is incorporated into the network to extract the spatial feature. Besides, to sufficiently capture the spectral information, a bidirectional recurrent connection is proposed. In the classification phase, the learned features are concatenated into a vector and fed to a softmax classifier via a fully-connected operator. To validate the effectiveness of the proposed Bi-CLSTM framework, we compare it with several state-of-the-art methods, including the CNN framework, on three widely used HSIs. The obtained results show that Bi-CLSTM can improve the classification performance as compared to other methods
    corecore