A Novel Gaussian Process Based Ground Segmentation Algorithm with Local-Smoothness Estimation

• URL: http://arxiv.org/abs/2112.05847v1
• Date: Wed, 1 Dec 2021 18:42:08 GMT
• Title: A Novel Gaussian Process Based Ground Segmentation Algorithm with Local-Smoothness Estimation
• Authors: Pouria Mehrabi, Hamid D. Taghirad
• Abstract summary: A novel $mathcalGP$-based method is proposed for the ground segmentation task in rough driving scenarios. Two Gaussian processes are introduced to separately model the observation and local characteristics of the data.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Autonomous Land Vehicles (ALV) shall efficiently recognize the ground in unknown environments. A novel $\mathcal{GP}$-based method is proposed for the ground segmentation task in rough driving scenarios. A non-stationary covariance function is utilized as the kernel for the $\mathcal{GP}$. The ground surface behavior is assumed to only demonstrate local-smoothness. Thus, point estimates of the kernel's length-scales are obtained. Thus, two Gaussian processes are introduced to separately model the observation and local characteristics of the data. While, the \textit{observation process} is used to model the ground, the \textit{latent process} is put on length-scale values to estimate point values of length-scales at each input location. Input locations for this latent process are chosen in a physically-motivated procedure to represent an intuition about ground condition. Furthermore, an intuitive guess of length-scale value is represented by assuming the existence of hypothetical surfaces in the environment that every bunch of data points may be assumed to be resulted from measurements from this surfaces. Bayesian inference is implemented using \textit{maximum a Posteriori} criterion. The log-marginal likelihood function is assumed to be a multi-task objective function, to represent a whole-frame unbiased view of the ground at each frame. Simulation results shows the effectiveness of the proposed method even in an uneven, rough scene which outperforms similar Gaussian process based ground segmentation methods. While adjacent segments do not have similar ground structure in an uneven scene, the proposed method gives an efficient ground estimation based on a whole-frame viewpoint instead of just estimating segment-wise probable ground surfaces.

Related papers

• NeuralGF: Unsupervised Point Normal Estimation by Learning Neural Gradient Function [55.86697795177619]
  Normal estimation for 3D point clouds is a fundamental task in 3D geometry processing. We introduce a new paradigm for learning neural gradient functions, which encourages the neural network to fit the input point clouds. Our excellent results on widely used benchmarks demonstrate that our method can learn more accurate normals for both unoriented and oriented normal estimation tasks.
  arXiv  Detail & Related papers  (2023-11-01T09:25:29Z)
• Neural Gradient Learning and Optimization for Oriented Point Normal Estimation [53.611206368815125]
  We propose a deep learning approach to learn gradient vectors with consistent orientation from 3D point clouds for normal estimation. We learn an angular distance field based on local plane geometry to refine the coarse gradient vectors. Our method efficiently conducts global gradient approximation while achieving better accuracy and ability generalization of local feature description.
  arXiv  Detail & Related papers  (2023-09-17T08:35:11Z)
• Efficient Large-scale Nonstationary Spatial Covariance Function Estimation Using Convolutional Neural Networks [3.5455896230714194]
  We use ConvNets to derive subregions from the nonstationary data. We employ a selection mechanism to identify subregions that exhibit similar behavior to stationary fields. We assess the performance of the proposed method with synthetic and real datasets at a large scale.
  arXiv  Detail & Related papers  (2023-06-20T12:17:46Z)
• Concrete Score Matching: Generalized Score Matching for Discrete Data [109.12439278055213]
  "Concrete score" is a generalization of the (Stein) score for discrete settings. "Concrete Score Matching" is a framework to learn such scores from samples.
  arXiv  Detail & Related papers  (2022-11-02T00:41:37Z)
• A Segment-Wise Gaussian Process-Based Ground Segmentation With Local Smoothness Estimation [3.42658286826597]
  The precise and informative model of the ground and the surface ahead is crucial for navigation and obstacle avoidance. In bumpy and rough scenes the functional relationship of the surface-related features may vary in different areas of the ground. The segment-wise GP-based ground segmentation method with local smoothness estimation is proposed.
  arXiv  Detail & Related papers  (2022-10-19T12:42:21Z)
• A Probabilistic Framework for Dynamic Object Recognition in 3D Environment With A Novel Continuous Ground Estimation Method [0.0]
  A probabilistic framework is developed and proposed for Dynamic Object Recognition in 3D Environments. A novel Gaussian Process Regression (GPR) based method is developed to detect ground points in different urban scenarios.
  arXiv  Detail & Related papers  (2022-01-27T16:07:10Z)
• Surface Warping Incorporating Machine Learning Assisted Domain Likelihood Estimation: A New Paradigm in Mine Geology Modelling and Automation [68.8204255655161]
  A Bayesian warping technique has been proposed to reshape modeled surfaces based on geochemical and spatial constraints imposed by newly acquired blasthole data. This paper focuses on incorporating machine learning in this warping framework to make the likelihood generalizable. Its foundation is laid by a Bayesian computation in which the geological domain likelihood given the chemistry, p(g|c) plays a similar role to p(y(c)|g.
  arXiv  Detail & Related papers  (2021-02-15T10:37:52Z)
• Gaussian Process Gradient Maps for Loop-Closure Detection in Unstructured Planetary Environments [17.276441789710574]
  The ability to recognize previously mapped locations is an essential feature for autonomous systems. Unstructured planetary-like environments pose a major challenge to these systems due to the similarity of the terrain. This paper presents a method to solve the loop closure problem using only spatial information.
  arXiv  Detail & Related papers  (2020-09-01T04:41:40Z)
• Making Affine Correspondences Work in Camera Geometry Computation [62.7633180470428]
  Local features provide region-to-region rather than point-to-point correspondences. We propose guidelines for effective use of region-to-region matches in the course of a full model estimation pipeline. Experiments show that affine solvers can achieve accuracy comparable to point-based solvers at faster run-times.
  arXiv  Detail & Related papers  (2020-07-20T12:07:48Z)
• Spatial Pyramid Based Graph Reasoning for Semantic Segmentation [67.47159595239798]
  We apply graph convolution into the semantic segmentation task and propose an improved Laplacian. The graph reasoning is directly performed in the original feature space organized as a spatial pyramid. We achieve comparable performance with advantages in computational and memory overhead.
  arXiv  Detail & Related papers  (2020-03-23T12:28:07Z)

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.