Learning county from pixels: Corn yield prediction with attention-weighted multiple instance learning

• URL: http://arxiv.org/abs/2312.01001v2
• Date: Thu, 11 Apr 2024 20:07:20 GMT
• Title: Learning county from pixels: Corn yield prediction with attention-weighted multiple instance learning
• Authors: Xiaoyu Wang, Yuchi Ma, Qunying Huang, Zhengwei Yang, Zhou Zhang,
• Abstract summary: This research examines each county at the pixel level and applies multiple instance learning to leverage detailed information within a county. In addition, our method addresses the "mixed pixel" issue caused by the inconsistent resolution between feature datasets and crop mask. The developed model outperforms four other machine learning models over the past five years in the U.S. corn belt.
• Score: 8.573309028586168
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Remote sensing technology has become a promising tool in yield prediction. Most prior work employs satellite imagery for county-level corn yield prediction by spatially aggregating all pixels within a county into a single value, potentially overlooking the detailed information and valuable insights offered by more granular data. To this end, this research examines each county at the pixel level and applies multiple instance learning to leverage detailed information within a county. In addition, our method addresses the "mixed pixel" issue caused by the inconsistent resolution between feature datasets and crop mask, which may introduce noise into the model and therefore hinder accurate yield prediction. Specifically, the attention mechanism is employed to automatically assign weights to different pixels, which can mitigate the influence of mixed pixels. The experimental results show that the developed model outperforms four other machine learning models over the past five years in the U.S. corn belt and demonstrates its best performance in 2022, achieving a coefficient of determination (R2) value of 0.84 and a root mean square error (RMSE) of 0.83. This paper demonstrates the advantages of our approach from both spatial and temporal perspectives. Furthermore, through an in-depth study of the relationship between mixed pixels and attention, it is verified that our approach can capture critical feature information while filtering out noise from mixed pixels.

Related papers

• On the Generalizability of Iterative Patch Selection for Memory-Efficient High-Resolution Image Classification [0.0]
  Classifying large images with small or tiny regions of interest is challenging due to computational and memory constraints. We explore these issues using a novel testbed on a memory-efficient cross-attention transformer with Iterative Patch Selection (IPS) as the patch selection module.
  arXiv  Detail & Related papers  (2024-12-15T16:25:30Z)
• Superpixel Cost Volume Excitation for Stereo Matching [27.757112234793624]
  In this work, we concentrate on exciting the intrinsic local consistency of stereo matching through the incorporation of superpixel soft constraints. Our approach capitalizes on the observation that neighboring pixels are predisposed to belong to the same object and exhibit closely similar intensities within the probability volume of superpixels.
  arXiv  Detail & Related papers  (2024-11-20T07:59:55Z)
• PixRO: Pixel-Distributed Rotational Odometry with Gaussian Belief Propagation [8.049531918823758]
  In this paper, we address the task of frame-to-frame rotational estimation. Instead of reasoning about relative motion between frames using the full images, distribute the estimation at pixel-level. In this paradigm, each pixel produces an estimate of the global motion by only relying on local information and local message-passing with neighbouring pixels.
  arXiv  Detail & Related papers  (2024-06-14T05:28:45Z)
• Semi-supervised Counting via Pixel-by-pixel Density Distribution Modelling [135.66138766927716]
  This paper focuses on semi-supervised crowd counting, where only a small portion of the training data are labeled. We formulate the pixel-wise density value to regress as a probability distribution, instead of a single deterministic value. Our method clearly outperforms the competitors by a large margin under various labeled ratio settings.
  arXiv  Detail & Related papers  (2024-02-23T12:48:02Z)
• Pixel-Inconsistency Modeling for Image Manipulation Localization [59.968362815126326]
  Digital image forensics plays a crucial role in image authentication and manipulation localization. This paper presents a generalized and robust manipulation localization model through the analysis of pixel inconsistency artifacts. Experiments show that our method successfully extracts inherent pixel-inconsistency forgery fingerprints.
  arXiv  Detail & Related papers  (2023-09-30T02:54:51Z)
• Superpixels algorithms through network community detection [0.0]
  Community detection is a powerful tool from complex networks analysis that finds applications in various research areas. Superpixels aim at representing the image at a smaller level while preserving as much as possible original information. We study the efficiency of superpixels computed by state-of-the-art community detection algorithms on a 4-connected pixel graph.
  arXiv  Detail & Related papers  (2023-08-27T13:13:28Z)
• Image Processing and Machine Learning for Hyperspectral Unmixing: An Overview and the HySUPP Python Package [80.11512905623417]
  Unmixing estimates the fractional abundances of the endmembers within the pixel. This paper provides an overview of advanced and conventional unmixing approaches. We compare the performance of the unmixing techniques on three simulated and two real datasets.
  arXiv  Detail & Related papers  (2023-08-18T08:10:41Z)
• Improving Pixel-Level Contrastive Learning by Leveraging Exogenous Depth Information [7.561849435043042]
  Self-supervised representation learning based on Contrastive Learning (CL) has been the subject of much attention in recent years. In this paper we will focus on the depth information, which can be obtained by using a depth network or measured from available data. We show that using this estimation information in the contrastive loss leads to improved results and that the learned representations better follow the shapes of objects.
  arXiv  Detail & Related papers  (2022-11-18T11:45:39Z)
• Probabilistic Deep Metric Learning for Hyperspectral Image Classification [91.5747859691553]
  This paper proposes a probabilistic deep metric learning framework for hyperspectral image classification. It aims to predict the category of each pixel for an image captured by hyperspectral sensors. Our framework can be readily applied to existing hyperspectral image classification methods.
  arXiv  Detail & Related papers  (2022-11-15T17:57:12Z)
• Robust Data Hiding Using Inverse Gradient Attention [82.73143630466629]
  In the data hiding task, each pixel of cover images should be treated differently since they have divergent tolerabilities. We propose a novel deep data hiding scheme with Inverse Gradient Attention (IGA), combing the ideas of adversarial learning and attention mechanism. Empirically, extensive experiments show that the proposed model outperforms the state-of-the-art methods on two prevalent datasets.
  arXiv  Detail & Related papers  (2020-11-21T19:08:23Z)
• ITSELF: Iterative Saliency Estimation fLexible Framework [68.8204255655161]
  Saliency object detection estimates the objects that most stand out in an image. We propose a superpixel-based ITerative Saliency Estimation fLexible Framework (ITSELF) that allows any user-defined assumptions to be added to the model. We compare ITSELF to two state-of-the-art saliency estimators on five metrics and six datasets.
  arXiv  Detail & Related papers  (2020-06-30T16:51:31Z)

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.