Spatial prediction of soil thickness with Gaussian Process Regression using pedological knowledge described by partial differential equations

Author(s):  
Kerstin Rau ◽  
Thomas Gläßle ◽  
Tobias Rentschler ◽  
Philipp Hennig ◽  
Thomas Scholten

<p>Recently, there is a growing interest for the soil variable soil thickness in the soil science, geoscience and ecology communities. More and more scientists assume that soil thickness summarizes many different characteristics of the site that are important for plant growth, soil biodiversity and climate change. As such soil thickness can be an indicator of properties like water holding capacity, nutrient cycling, carbon storage, habitat for soil fauna and overall soil quality and productivity. At the same time, it takes a lot of effort to measure soil thickness, especially for larger and heterogeneous areas like mountain regions, which would require dense sampling. For these reasons, it is becoming increasingly important to spatially predict soil thickness as accurately as possible using models. <br>The typical difficulty in predicting variables in environmental sciences is the small number of samples in the field and resulting from this a small number of usable data points to train models in the spatial domain. One possibility to create valid models with sparse spatially distributed soil data is the combination of point measurements with domain knowledge. For soils and their properties such knowledge can be archived from related environmental data, for example, parent material and climate, and their spatial distribution neighboring the sample points. Frequently used machine learning methods for environmental modelling, especially in the geosciences, are the Gaussian Process Regression Models (GPRs), because a spatial correlation can already be implemented via the covariance kernel. One of the great advantages of using GPRs is the possibility to inform this algorithm directly with soil science knowledge. We can claim this knowledge in different ways. <br>In this paper we apply a new approach of implementing geographical knowledge into the Gaussian Processes by means of partial differential equations (PDEs), each describing a pedological process. These PDEs include information on how independent environmental variables influence the searched dependent variable. At first, we calculate for simple correlations between soil thickness and these variables, which we then convert into a PDE. As independent variables we initially use exclusively topographical variables derived from Digital Elevation Models (DEM) such as slope, different curvatures, aspect or the topographic wetness index. In this way, expert knowledge can adapt the GPR model in addition to the already existing assumption of spatial dependency given by prior covariance, where near things are more related than distant. <br>The algorithm will be applied to a data set from Andalusia, Spain, developed by Tobias Rentschler. Among land use information gained from remote sensing, it contains our target variable soil thickness.</p>

Author(s):  
Wei Xing ◽  
Akeel A. Shah ◽  
Prasanth B. Nair

In this paper, Isomap and kernel Isomap are used to dramatically reduce the dimensionality of the output space to efficiently construct a Gaussian process emulator of parametrized partial differential equations. The output space consists of spatial or spatio-temporal fields that are functions of multiple input variables. For such problems, standard multi-output Gaussian process emulation strategies are computationally impractical and/or make restrictive assumptions regarding the correlation structure. The method we develop can be applied without modification to any problem involving vector-valued targets and vector-valued inputs. It also extends a method based on linear dimensionality reduction to response surfaces that cannot be described accurately by a linear subspace of the high dimensional output space. Comparisons to the linear method are made through examples that clearly demonstrate the advantages of nonlinear dimensionality reduction.


2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Jiaohui Yu

In today’s rapid development of network and multimedia technology, the booming of electronic commerce, users in the network shopping species of images and other multimedia information showing geometric growth, in the face of this situation, how to find the images they need in the vast amount of online shopping images has become an urgent problem to solve. This paper is based on the partial differential equation to do the following research: Based on the partial differential equation is a kind of equation that simulates the human visual perception system to analyze images; based on the summary of the advantages and disadvantages of multifeature image retrieval technology, we propose a multifeature image retrieval technology method based on the partial differential equation to alleviate the indexing imbalance caused by the mismatch of multifeature image retrieval technology distribution. To improve the search speed of the data-dependent locally sensitive hashing algorithm, we propose a query pruning algorithm compatible with the proposed partial differential equation-based multifeature image retrieval technology method, which greatly improves the retrieval speed while ensuring the retrieval accuracy; to implement the data-dependent partial differential equation algorithm, we need to distribute the data set among different operation nodes, and to better achieve better parallelization of operations, we need to measure the similarity between categories, and we achieve the problem of distributing data among various categories in each operation node by introducing a clustering method with constraints. The purpose of this article for image recognition is for better shopping platforms for merchants. This algorithm has trained multiple samples and has data support. The experimental results show that our proposed data set allocation method shows significant advantages over the data set allocation method that does not consider category correlation. However, the image features used in image retrieval systems are often hundreds or even thousands of dimensions, and these features are not only high in dimensionality but also huge in number, which makes image retrieval systems encounter an inevitable problem—“dimensionality disaster.” To overcome this problem, scholars have proposed a series of approximate nearest neighbor methods, but multifeature image retrieval techniques based on partial differential equations are more widely used in people’s daily life.


2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Wenfu Pan ◽  
Li Chen ◽  
Ruxing Zhang

In this paper, anisotropic partial differential equations are used to conduct an indepth study and analysis of automatic recognition of financial bills. Firstly, it obtains the invoices of the group enterprise, uses scanning technology and related image recognition technology to capture, process, compress and slice the paper bill content, and then carries out data identification and verification of the image. It classifies the obtained electronic data information into bills, converts it into electronic information related to bills according to the corresponding categories of the bill template, and stores it in the bill table of the database to achieve the management operation of formatted electronic files. After categorizing the bills according to the electronic information of bills to match the business scenarios, financial journal vouchers can be generated according to the preconfigured voucher templates of the corresponding business scenarios, and the financial journal vouchers are converted into voucher messages using XML technology. Finally, we use agent technology to design middleware for heterogeneous financial systems to realize the function of communicating voucher messages to each other in different business systems. The system automatically extracts the key information of invoices through OCR technology and performs real-time verification and cyclical feedback to the verification results to the suppliers. The system has realized the intelligent management of the power company’s VAT invoices, thus greatly enhancing the efficiency of VAT invoice verification and settlement. The automatic tax invoice recognition system adopts a network structured tax invoice recognition model, which eliminates the cumbersome steps of character decomposition and character classification in traditional OCR character recognition. After several trials, it has obtained better experimental results in terms of recognition accuracy, with an accuracy rate of over 93% in the recognition of tax invoice data set.


Sign in / Sign up

Export Citation Format

Share Document