Related papers: Fast generation of isotropic Gaussian random field…
In this paper, we study the problem of inferring spatially-varying Gaussian Markov random fields (SV-GMRF) where the goal is to learn a network of sparse, context-specific GMRFs representing network relationships between genes. An important…
We propose an algorithm for the orthogonal fast discrete spherical Bessel transform on an uniform grid. Our approach is based upon the spherical Bessel transform factorization into the two subsequent orthogonal transforms, namely the fast…
An expression for the joint probability distribution of the principal curvatures at an arbitrary point in the ensemble of isosurfaces defined on isotropic Gaussian random fields on Rn is derived. The result is obtained by deriving symmetry…
We introduce two efficient algorithms for computing the partial Fourier transforms in one and two dimensions. Our study is motivated by the wave extrapolation procedure in reflection seismology. In both algorithms, the main idea is to…
Spatial stochastic processes that are modeled over the entire Earth's surface require statistical approaches that directly consider the spherical domain. Here, we extend the notion of intrinsic random functions (IRF) to model non-stationary…
In a recent work we presented a recursive algorithm to compute the matrix elements of a generic Gaussian transformation in the photon-number basis. Its purpose was to evolve a quantum state by building the transformation matrix and…
Gaussian Schell-model fields are examples of spatially partially coherent fields, which in recent years have found several unique applications. The existing techniques for generating Gaussian Schell-model (GSM) fields are based on…
We develop a novel sampling theorem on the sphere and corresponding fast algorithms by associating the sphere with the torus through a periodic extension. The fundamental property of any sampling theorem is the number of samples required to…
Recently, Gaussian splatting has emerged as a strong alternative to NeRF, demonstrating impressive 3D modeling capabilities while requiring only a fraction of the training and rendering time. In this paper, we show how the standard Gaussian…
We consider the problem of model selection in Gaussian Markov fields in the sample deficient scenario. The benchmark information-theoretic results in the case of d-regular graphs require the number of samples to be at least proportional to…
We consider Gaussian subordinated L\'evy fields (GSLFs) that arise by subordinating L\'evy processes with positive transformations of Gaussian random fields on some spatial domain $\mathcal{D}\subset \mathbb{R}^d$, $d\geq 1$. The resulting…
We present a novel method to generate a synthetic distribution of objects (mock) on a spherical surface (i.e. a sky), by using a real distribution. The resulting surrogate map mimics the clustering features of the real data, including the…
A new algorithm is developed to tackle the issue of sampling non-Gaussian model parameter posterior probability distributions that arise from solutions to Bayesian inverse problems. The algorithm aims to mitigate some of the hurdles faced…
We present a CUDA accelerated implementation of the Characteristic/Scan Conversion algorithm to generate narrow band signed distance fields in logically Cartesian grids. We outline an approach of task and data management on GPUs based on an…
Generating high-quality instance-wise grasp configurations provides critical information of how to grasp specific objects in a multi-object environment and is of high importance for robot manipulation tasks. This work proposed a novel…
This paper considers the problem of simultaneously estimating rare-event probabilities for a class of Gaussian random fields. A conventional rare-event simulation method is usually tailored to a specific rare event and consequently would…
A novel method for generating coded mask patterns based on Gaussian random fields (GRF) is proposed. In contrast to traditional algorithms based on cyclic difference sets, it is possible to construct mask patterns that encode a predefined…
Performing large-scale, accurate quantum simulations of many-fermion systems is a central challenge in quantum science, with applications in chemistry, materials, and high-energy physics. Despite significant progress, realizing generic…
Rue and Held (2005) proposed a method for efficiently computing the Gaussian likelihood for stationary Markov random field models, when the data locations fall on a complete regular grid, and the model has no additive error term. The…
This work explores the application of the fast assembly and formation strategy from [8, 17] to trimmed bi-variate parameter spaces. Two concepts for the treatment of basis functions cut by the trimming curve are investigated: one employs a…