Identifying charge density and dielectric environment of graphene using
Raman spectroscopy and deep learning
- URL: http://arxiv.org/abs/2203.00431v1
- Date: Fri, 25 Feb 2022 00:25:01 GMT
- Title: Identifying charge density and dielectric environment of graphene using
Raman spectroscopy and deep learning
- Authors: Zhuofa Chen, Yousif Khaireddin, Anna K. Swan
- Abstract summary: The impact of the environment on graphene's properties can be evaluated by Raman spectroscopy.
We develop a deep learning model to overcome the effects of such variations and classify graphene Raman spectra according to different charge densities and dielectric environments.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The impact of the environment on graphene's properties such as strain, charge
density, and dielectric environment can be evaluated by Raman spectroscopy.
These environmental interactions are not trivial to determine, since they
affect the spectra in overlapping ways. Data preprocessing such as background
subtraction and peak fitting is typically used. Moreover, collected
spectroscopic data vary due to different experimental setups and environments.
Such variations, artifacts, and environmental differences pose a challenge in
accurate spectral analysis. In this work, we developed a deep learning model to
overcome the effects of such variations and classify graphene Raman spectra
according to different charge densities and dielectric environments. We
consider two approaches: deep learning models and machine learning algorithms
to classify spectra with slightly different charge density or dielectric
environment. These two approaches show similar success rates for high
Signal-to-Noise data. However, deep learning models are less sensitive to
noise. To improve the accuracy and generalization of all models, we use data
augmentation through additive noise and peak shifting. We demonstrated the
spectra classification with 99% accuracy using a convolutional neural net (CNN)
model. The CNN model is able to classify Raman spectra of graphene with
different charge doping levels and even subtle variation in the spectra between
graphene on SiO$_2$ and graphene on silanized SiO$_2$. Our approach has the
potential for fast and reliable estimation of graphene doping levels and
dielectric environments. The proposed model paves the way for achieving
efficient analytical tools to evaluate the properties of graphene.
Related papers
- Graph Generation via Spectral Diffusion [51.60814773299899]
We present GRASP, a novel graph generative model based on 1) the spectral decomposition of the graph Laplacian matrix and 2) a diffusion process.
Specifically, we propose to use a denoising model to sample eigenvectors and eigenvalues from which we can reconstruct the graph Laplacian and adjacency matrix.
Our permutation invariant model can also handle node features by concatenating them to the eigenvectors of each node.
arXiv Detail & Related papers (2024-02-29T09:26:46Z) - Data Augmentation Scheme for Raman Spectra with Highly Correlated
Annotations [0.23090185577016453]
We exploit the additive nature of spectra in order to generate additional data points from a given dataset that have statistically independent labels.
We show that training a CNN on these generated data points improves the performance on datasets where the annotations do not bear the same correlation as the dataset that was used for model training.
arXiv Detail & Related papers (2024-02-01T18:46:28Z) - Through the Dual-Prism: A Spectral Perspective on Graph Data
Augmentation for Graph Classification [71.36575018271405]
We introduce the Dual-Prism (DP) augmentation method, comprising DP-Noise and DP-Mask.
We find that keeping the low-frequency eigenvalues unchanged can preserve the critical properties at a large scale when generating augmented graphs.
arXiv Detail & Related papers (2024-01-18T12:58:53Z) - Shape-aware Graph Spectral Learning [36.63516222161871]
Spectral Graph Neural Networks (GNNs) are gaining attention for their ability to surpass the limitations of message-passing GNNs.
Some works empirically show that the preferred graph frequency is related to the graph homophily level.
This relationship between graph frequency and graphs with homophily/heterophily has not been systematically analyzed and considered in existing spectral GNNs.
We propose shape-aware regularization on a Newton Interpolation-based spectral filter that can learn an arbitrary spectral filter and incorporate prior knowledge about the desired shape of the corresponding homophily level.
arXiv Detail & Related papers (2023-10-16T04:57:30Z) - Graph Classification Gaussian Processes via Spectral Features [7.474662887810221]
Graph classification aims to categorise graphs based on their structure and node attributes.
In this work, we propose to tackle this task using tools from graph signal processing by deriving spectral features.
We show that even such a simple approach, having no learned parameters, can yield competitive performance compared to strong neural network and graph kernel baselines.
arXiv Detail & Related papers (2023-06-06T15:31:05Z) - Unveiling the Sampling Density in Non-Uniform Geometric Graphs [69.93864101024639]
We consider graphs as geometric graphs: nodes are randomly sampled from an underlying metric space, and any pair of nodes is connected if their distance is less than a specified neighborhood radius.
In a social network communities can be modeled as densely sampled areas, and hubs as nodes with larger neighborhood radius.
We develop methods to estimate the unknown sampling density in a self-supervised fashion.
arXiv Detail & Related papers (2022-10-15T08:01:08Z) - DiGress: Discrete Denoising diffusion for graph generation [79.13904438217592]
DiGress is a discrete denoising diffusion model for generating graphs with categorical node and edge attributes.
It achieves state-of-the-art performance on molecular and non-molecular datasets, with up to 3x validity improvement.
It is also the first model to scale to the large GuacaMol dataset containing 1.3M drug-like molecules.
arXiv Detail & Related papers (2022-09-29T12:55:03Z) - Supernova Light Curves Approximation based on Neural Network Models [53.180678723280145]
Photometric data-driven classification of supernovae becomes a challenge due to the appearance of real-time processing of big data in astronomy.
Recent studies have demonstrated the superior quality of solutions based on various machine learning models.
We study the application of multilayer perceptron (MLP), bayesian neural network (BNN), and normalizing flows (NF) to approximate observations for a single light curve.
arXiv Detail & Related papers (2022-06-27T13:46:51Z) - Unsupervised Spectral Unmixing For Telluric Correction Using A Neural
Network Autoencoder [58.720142291102135]
We present a neural network autoencoder approach for extracting a telluric transmission spectrum from a large set of high-precision observed solar spectra from the HARPS-N radial velocity spectrograph.
arXiv Detail & Related papers (2021-11-17T12:54:48Z) - Adaptive Gaussian Processes on Graphs via Spectral Graph Wavelets [3.2498534294827044]
We propose a process model using spectral graph wavelets, which can aggregate information at different scales.
We achieve scalability to larger graphs by using a spectrum-adaptive approximation of the filter function, which is designed to yield a low approximation error in dense areas of the graph spectrum.
arXiv Detail & Related papers (2021-10-25T09:25:04Z) - Cycle-StarNet: Bridging the gap between theory and data by leveraging
large datasets [0.0]
Current automated methods for analyzing spectra are either (a) data-driven, which requires prior knowledge of stellar parameters and elemental abundances, or (b) based on theoretical synthetic models that are susceptible to the gap between theory and practice.
We present a hybrid generative domain adaptation method that turns simulated stellar spectra into realistic spectra by applying unsupervised learning to large spectroscopic surveys.
arXiv Detail & Related papers (2020-07-06T23:06:58Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.