Improving Log-Cumulant Based Estimation of Roughness Information in SAR imagery

• URL: http://arxiv.org/abs/2306.13200v1
• Date: Thu, 22 Jun 2023 20:53:39 GMT
• Title: Improving Log-Cumulant Based Estimation of Roughness Information in SAR imagery
• Authors: Jeova Farias Sales Rocha Neto, and Francisco Alixandre Avila Rodrigues
• Abstract summary: We propose improvements to parameter estimation in $mathcalG0$ distributions using the Method of Log-Cumulants. We show how we can use this method to achieve fast and reliable SAR image understanding based on roughness information.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Synthetic Aperture Radar (SAR) image understanding is crucial in remote sensing applications, but it is hindered by its intrinsic noise contamination, called speckle. Sophisticated statistical models, such as the $\mathcal{G}^0$ family of distributions, have been employed to SAR data and many of the current advancements in processing this imagery have been accomplished through extracting information from these models. In this paper, we propose improvements to parameter estimation in $\mathcal{G}^0$ distributions using the Method of Log-Cumulants. First, using Bayesian modeling, we construct that regularly produce reliable roughness estimates under both $\mathcal{G}^0_A$ and $\mathcal{G}^0_I$ models. Second, we make use of an approximation of the Trigamma function to compute the estimated roughness in constant time, making it considerably faster than the existing method for this task. Finally, we show how we can use this method to achieve fast and reliable SAR image understanding based on roughness information.

Related papers

• Robust Representation Consistency Model via Contrastive Denoising [83.47584074390842]
  randomized smoothing provides theoretical guarantees for certifying robustness against adversarial perturbations. diffusion models have been successfully employed for randomized smoothing to purify noise-perturbed samples. We reformulate the generative modeling task along the diffusion trajectories in pixel space as a discriminative task in the latent space.
  arXiv  Detail & Related papers  (2025-01-22T18:52:06Z)
• An accuracy-runtime trade-off comparison of scalable Gaussian process approximations for spatial data [11.141688859736805]
  A drawback of Gaussian processes is their computational cost having $mathcalO(N3)$ time and $mathcalO(N2)$ memory complexity. Numerous approximation techniques have been proposed to address this limitation. We analyze this trade-off between accuracy and runtime on multiple simulated and large-scale real-world datasets.
  arXiv  Detail & Related papers  (2025-01-20T12:35:58Z)
• R$^2$-Gaussian: Rectifying Radiative Gaussian Splatting for Tomographic Reconstruction [53.19869886963333]
  3D Gaussian splatting (3DGS) has shown promising results in rendering image and surface reconstruction. This paper introduces R2$-Gaussian, the first 3DGS-based framework for sparse-view tomographic reconstruction.
  arXiv  Detail & Related papers  (2024-05-31T08:39:02Z)
• GS-SLAM: Dense Visual SLAM with 3D Gaussian Splatting [51.96353586773191]
  We introduce textbfGS-SLAM that first utilizes 3D Gaussian representation in the Simultaneous Localization and Mapping system. Our method utilizes a real-time differentiable splatting rendering pipeline that offers significant speedup to map optimization and RGB-D rendering. Our method achieves competitive performance compared with existing state-of-the-art real-time methods on the Replica, TUM-RGBD datasets.
  arXiv  Detail & Related papers  (2023-11-20T12:08:23Z)
• Using Neural Networks for Fast SAR Roughness Estimation of High Resolution Images [2.6107298043931197]
  We propose a neural network-based estimation framework that learns how to predict underlying parameters of $G_I0$ samples. We show that this approach leads to an estimator that is quicker, yields less estimation error and is less prone to failures.
  arXiv  Detail & Related papers  (2023-09-06T20:24:13Z)
• Amortized Bayesian Inference of GISAXS Data with Normalizing Flows [0.10752246796855561]
  We propose a simulation-based framework that combines variational auto-encoders and normalizing flows to estimate the posterior distribution of object parameters. We demonstrate that our method reduces the inference cost by orders of magnitude while producing consistent results with ABC.
  arXiv  Detail & Related papers  (2022-10-04T12:09:57Z)
• The split Gibbs sampler revisited: improvements to its algorithmic structure and augmented target distribution [1.1279808969568252]
  Current state-of-the-art methods often address these difficulties by replacing the posterior density with a smooth approximation. An alternative approach is based on data augmentation and relaxation, where auxiliary variables are introduced in order to construct an approximate augmented posterior distribution. This paper proposes a new accelerated proximal MCMC method called latent space SK-ROCK, which tightly combines the benefits of the two strategies.
  arXiv  Detail & Related papers  (2022-06-28T11:21:41Z)
• Improved Convergence Rates for Sparse Approximation Methods in Kernel-Based Learning [48.08663378234329]
  Kernel-based models such as kernel ridge regression and Gaussian processes are ubiquitous in machine learning applications. Existing sparse approximation methods can yield a significant reduction in the computational cost. We provide novel confidence intervals for the Nystr"om method and the sparse variational Gaussian processes approximation method.
  arXiv  Detail & Related papers  (2022-02-08T17:22:09Z)
• Fully Adaptive Bayesian Algorithm for Data Analysis, FABADA [0.0]
  This paper describes a novel non-parametric noise reduction technique from the point of view of Bayesian inference. It iteratively evaluates possible smoothed versions of the data, the smooth models, obtaining an estimation of the underlying signal. Iterations stop based on the evidence and the $chi2$ statistic of the last smooth model, and we compute the expected value of the signal.
  arXiv  Detail & Related papers  (2022-01-13T18:54:31Z)
• Sample and Computation Redistribution for Efficient Face Detection [137.19388513633484]
  Training data sampling and computation distribution strategies are the keys to efficient and accurate face detection. scrfdf34 outperforms the best competitor, TinaFace, by $3.86%$ (AP at hard set) while being more than emph3$times$ faster on GPUs with VGA-resolution images.
  arXiv  Detail & Related papers  (2021-05-10T23:51:14Z)
• SLOE: A Faster Method for Statistical Inference in High-Dimensional Logistic Regression [68.66245730450915]
  We develop an improved method for debiasing predictions and estimating frequentist uncertainty for practical datasets. Our main contribution is SLOE, an estimator of the signal strength with convergence guarantees that reduces the computation time of estimation and inference by orders of magnitude.
  arXiv  Detail & Related papers  (2021-03-23T17:48:56Z)
• 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)

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.