62 research outputs found
Leveraging colour-based pseudo-labels to supervise saliency detection in hyperspectral image datasets
Saliency detection mimics the natural visual attention mechanism that identifies an imagery region to be salient when it attracts visual attention more than the background. This image analysis task covers many important applications in several fields such as military science, ocean research, resources exploration, disaster and land-use monitoring tasks. Despite hundreds of models have been proposed for saliency detection in colour images, there is still a large room for improving saliency detection performances in hyperspectral imaging analysis. In the present study, an ensemble learning methodology for saliency detection in hyperspectral imagery datasets is presented. It enhances saliency assignments yielded through a robust colour-based technique with new saliency information extracted by taking advantage of the abundance of spectral information on multiple hyperspectral images. The experiments performed with the proposed methodology provide encouraging results, also compared to several competitors
Novel Reconstruction Errors for Saliency Detection in Hyperspectral Images
When hyperspectral images are analyzed, a big amount of data, representing the reflectance at hundreds of wavelengths, needs to be processed. Hence, dimensionality reduction techniques are used to discard unnecessary information. In order to detect the so called “saliency”, i.e., the relevant pixels, we propose a bottom-up approach based on three main ingredients: sparse non negative matrix factorization (SNMF), spatial and spectral functions to measure the reconstruction error between the input image and the reconstructed one and a final clustering technique. We introduce novel error functions and show some useful mathematical properties. The method is validated on hyperspectral images and compared with state-of-the-art different approaches
A study on spline quasi-interpolation based quadrature rules for the isogeometric Galerkin BEM
Two recently introduced quadrature schemes for weakly singular integrals
[Calabr\`o et al. J. Comput. Appl. Math. 2018] are investigated in the context
of boundary integral equations arising in the isogeometric formulation of
Galerkin Boundary Element Method (BEM). In the first scheme, the regular part
of the integrand is approximated by a suitable quasi--interpolation spline. In
the second scheme the regular part is approximated by a product of two spline
functions. The two schemes are tested and compared against other standard and
novel methods available in literature to evaluate different types of integrals
arising in the Galerkin formulation. Numerical tests reveal that under
reasonable assumptions the second scheme convergences with the optimal order in
the Galerkin method, when performing -refinement, even with a small amount
of quadrature nodes. The quadrature schemes are validated also in numerical
examples to solve 2D Laplace problems with Dirichlet boundary conditions
A global method for coupling transport with chemistry in heterogeneous porous media
Modeling reactive transport in porous media, using a local chemical
equilibrium assumption, leads to a system of advection-diffusion PDE's coupled
with algebraic equations. When solving this coupled system, the algebraic
equations have to be solved at each grid point for each chemical species and at
each time step. This leads to a coupled non-linear system. In this paper a
global solution approach that enables to keep the software codes for transport
and chemistry distinct is proposed. The method applies the Newton-Krylov
framework to the formulation for reactive transport used in operator splitting.
The method is formulated in terms of total mobile and total fixed
concentrations and uses the chemical solver as a black box, as it only requires
that on be able to solve chemical equilibrium problems (and compute
derivatives), without having to know the solution method. An additional
advantage of the Newton-Krylov method is that the Jacobian is only needed as an
operator in a Jacobian matrix times vector product. The proposed method is
tested on the MoMaS reactive transport benchmark.Comment: Computational Geosciences (2009)
http://www.springerlink.com/content/933p55085742m203/?p=db14bb8c399b49979ba8389a3cae1b0f&pi=1
The spatial structure of lithic landscapes : the late holocene record of east-central Argentina as a case study
Fil: Barrientos, Gustavo. División Antropología. Facultad de Ciencias Naturales y Museo. Universidad Nacional de La Plata; ArgentinaFil: Catella, Luciana. División Arqueología. Facultad de Ciencias Naturales y Museo. Universidad Nacional de La Plata; ArgentinaFil: Oliva, Fernando. Centro Estudios Arqueológicos Regionales. Facultad de Humanidades y Artes. Universidad Nacional de Rosario; Argentin
Classification of hyperspectral images with copulas
In the last decade, supervised learning methods for the classification of remotely sensed images (RSI) have grown significantly, especially for hyper-spectral (HS) images. Recently, deep learning-based approaches have produced encouraging results for the land cover classification of HS images. In particular, the Convolutional Neural Networks (CNN) and Recurrent Neural Networks (RNN) have shown good performance. However, these methods suffer for the problem of the hyperparameter optimization or tuning that requires a high computational cost; moreover, they are sensitive to the number of observations in the learning phase. In this work we propose a novel supervised learning algorithm based on the use of copula functions for the classification of hyperspectral images called CopSCHI (Copula Supervised Classification of Hyperspectral Images). In particular, we start with a dimensionality reduction technique based on Singular Value Decomposition (SVD) in order to extract a small number of relevant features that best preserve the characteristics of the original image. Afterward, we learn the classifier through a dynamic choice of copulas that allows us to identify the distribution of the different classes within the dataset. The use of copulas proves to be a good choice due to their ability to recognize the probability distribution of classes and hence an accurate final classification with low computational cost can be conducted. The proposed approach was tested on two benchmark datasets widely used in literature. The experimental results confirm that CopSCHI outperforms the state-of-the-art methods considered in this paper as competitors
On the Classification of Hyperspectral Images with Different Copula Family
In the task of remote sensing, the Hyperspectral image (HSI) classification to analyze land cover is an established research topic. However, the nature of remote sensing data still poses several challenges including, the curse of dimensionality, the negligible number of samples during training or the presence of unbalanced data which makes learning difficult. Having a training set of pixels with the label of the assigned class, the operation that is performed in the classification of hyperspectral images is to assign a class label to each pixel in the test set based on the knowledge acquired with the training set. This paper discusses a new approach in the supervised classification of HS images considering the statistical tool of Copulas. Comparison with well-established techniques shows the good behaviour of this technique
Test set for initial value problem solvers, release 2.4, http://www.dm.uniba.it/~testset/
- …