Pixel-wise classification in graphene-detection with tree-based machine learning algorithms

• URL: http://arxiv.org/abs/2209.07578v1
• Date: Wed, 24 Aug 2022 08:10:27 GMT
• Title: Pixel-wise classification in graphene-detection with tree-based machine learning algorithms
• Authors: Woon Hyung Cho, Jiseon Shin, Young Duck Kim, and George J. Jung
• Abstract summary: We introduce four different tree-based machine learning algorithms -- decision tree, random forest, extreme boost gradient, and light gradient boosting machine. We train them with five optical microscopy images of graphene, and evaluate their performances with multiple metrics and indices. The code developed in this paper will be released at indices.com/gjung-group/Graphene_segmentation.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Mechanical exfoliation of graphene and its identification by optical inspection is one of the milestones in condensed matter physics that sparked the field of 2D materials. Finding regions of interest from the entire sample space and identification of layer number is a routine task potentially amenable to automatization. We propose supervised pixel-wise classification methods showing a high performance even with a small number of training image datasets that require short computational time without GPU. We introduce four different tree-based machine learning algorithms -- decision tree, random forest, extreme gradient boost, and light gradient boosting machine. We train them with five optical microscopy images of graphene, and evaluate their performances with multiple metrics and indices. We also discuss combinatorial machine learning models between the three single classifiers and assess their performances in identification and reliability. The code developed in this paper is open to the public and will be released at github.com/gjung-group/Graphene_segmentation.

Related papers

• Feature Engineering is Not Dead: Reviving Classical Machine Learning with Entropy, HOG, and LBP Feature Fusion for Image Classification [0.13194391758295113]
  We revisit classical machine learning based image classification through a novel approach centered on Permutation Entropy (PE)<n>We extend PE to two-dimensional images and propose a multiscale, multi-orientation entropy-based feature extraction approach.<n>Our results demonstrate that the fusion of PE with HOG and LBP provides a compact, interpretable, and effective alternative to computationally expensive and limited interpretable deep learning models.
  arXiv  Detail & Related papers  (2025-07-18T09:29:03Z)
• Polaritonic Machine Learning for Graph-based Data Analysis [25.723282688367924]
  Photonic and polaritonic systems offer a fast and efficient platform for accelerating machine learning (ML) through physics-based computing.<n>We show how lattices of condensates can efficiently embed relational and topological information from point cloud datasets.<n>This information is then incorporated into a pattern recognition workflow based on convolutional neural networks (CNNs)
  arXiv  Detail & Related papers  (2025-07-14T15:57:22Z)
• Dual-branch PolSAR Image Classification Based on GraphMAE and Local Feature Extraction [22.39266854681996]
  We propose a dual-branch classification model based on generative self-supervised learning in this paper. The first branch is a superpixel-branch, which learns superpixel-level polarimetric representations using a generative self-supervised graph masked autoencoder. To acquire finer classification results, a convolutional neural networks-based pixel-branch is further incorporated to learn pixel-level features.
  arXiv  Detail & Related papers  (2024-08-08T08:17:50Z)
• Supervised binary classification of small-scale digit images and weighted graphs with a trapped-ion quantum processor [56.089799129458875]
  We present the results of benchmarking a quantum processor based on trapped $171$Yb$+$ ions.<n>We perform a supervised binary classification on two types of datasets: small binary digit images and weighted graphs with a ring topology.
  arXiv  Detail & Related papers  (2024-06-17T18:20:51Z)
• A Structure-Aware Framework for Learning Device Placements on Computation Graphs [15.282882425920064]
  We propose a novel framework for the task of device placement, relying on smaller computation graphs extracted from the OpenVINO toolkit. The framework consists of five steps, including graph coarsening, node representation learning and policy optimization. To train the entire framework, we use reinforcement learning using the execution time of the placement as a reward.
  arXiv  Detail & Related papers  (2024-05-23T05:29:29Z)
• Curriculum Graph Machine Learning: A Survey [51.89783017927647]
  curriculum graph machine learning (Graph CL) integrates the strength of graph machine learning and curriculum learning. This paper comprehensively overview approaches on Graph CL and present a detailed survey of recent advances in this direction.
  arXiv  Detail & Related papers  (2023-02-06T16:59:25Z)
• Learning Graph Search Heuristics [48.83557172525969]
  We present PHIL (Path Heuristic with Imitation Learning), a novel neural architecture and a training algorithm for discovering graph search and navigations from data. Our function learns graph embeddings useful for inferring node distances, runs in constant time independent of graph sizes, and can be easily incorporated in an algorithm such as A* at test time. Experiments show that PHIL reduces the number of explored nodes compared to state-of-the-art methods on benchmark datasets by 58.5% on average.
  arXiv  Detail & Related papers  (2022-12-07T22:28:00Z)
• Training Deep Learning Algorithms on Synthetic Forest Images for Tree Detection [0.0]
  We propose to use simulated forest environments to automatically generate 43 k realistic synthetic images with pixel-level annotations. We also report the promising transfer learning capability of features learned on our synthetic dataset by directly predicting bounding box, segmentation masks and keypoints on real images.
  arXiv  Detail & Related papers  (2022-10-08T20:49:40Z)
• Two-Stream Graph Convolutional Network for Intra-oral Scanner Image Segmentation [133.02190910009384]
  We propose a two-stream graph convolutional network (i.e., TSGCN) to handle inter-view confusion between different raw attributes. Our TSGCN significantly outperforms state-of-the-art methods in 3D tooth (surface) segmentation.
  arXiv  Detail & Related papers  (2022-04-19T10:41:09Z)
• MGAE: Masked Autoencoders for Self-Supervised Learning on Graphs [55.66953093401889]
  Masked graph autoencoder (MGAE) framework to perform effective learning on graph structure data. Taking insights from self-supervised learning, we randomly mask a large proportion of edges and try to reconstruct these missing edges during training.
  arXiv  Detail & Related papers  (2022-01-07T16:48:07Z)
• Automated Graph Machine Learning: Approaches, Libraries, Benchmarks and Directions [58.220137936626315]
  This paper extensively discusses automated graph machine learning approaches. We introduce AutoGL, our dedicated and the world's first open-source library for automated graph machine learning. Also, we describe a tailored benchmark that supports unified, reproducible, and efficient evaluations.
  arXiv  Detail & Related papers  (2022-01-04T18:31:31Z)
• A Comprehensive Analytical Survey on Unsupervised and Semi-Supervised Graph Representation Learning Methods [4.486285347896372]
  This survey aims to evaluate all major classes of graph embedding methods. We organized graph embedding techniques using a taxonomy that includes methods from manual feature engineering, matrix factorization, shallow neural networks, and deep graph convolutional networks. We designed experiments on top of PyTorch Geometric and DGL libraries and run experiments on different multicore CPU and GPU platforms.
  arXiv  Detail & Related papers  (2021-12-20T07:50:26Z)
• Graph Kernel Neural Networks [53.91024360329517]
  We propose to use graph kernels, i.e. kernel functions that compute an inner product on graphs, to extend the standard convolution operator to the graph domain. This allows us to define an entirely structural model that does not require computing the embedding of the input graph. Our architecture allows to plug-in any type of graph kernels and has the added benefit of providing some interpretability.
  arXiv  Detail & Related papers  (2021-12-14T14:48:08Z)
• Scalable Graph Embedding LearningOn A Single GPU [18.142879223260785]
  We introduce a hybrid CPU-GPU framework that addresses the challenges of learning embedding of large-scale graphs. We show that our system can scale training to datasets with an order of magnitude greater than a single machine's total memory capacity.
  arXiv  Detail & Related papers  (2021-10-13T19:09:33Z)
• CaCL: Class-aware Codebook Learning for Weakly Supervised Segmentation on Diffuse Image Patterns [9.22349617343802]
  We propose a novel class-aware codebook learning (CaCL) algorithm to perform weakly supervised learning for diffuse image patterns. Specifically, the CaCL algorithm is deployed to segment protein expressed brush border regions from histological images of human duodenum.
  arXiv  Detail & Related papers  (2020-11-02T07:47:10Z)

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.