arXiv subjects

Can Evren Yarman

Publications and source records attributed to Can Evren Yarman.

4 recordsLinked to original sources

arXiv2026

Motion-Enabled Tomography via Gaussian Mixture Models

Recovering physical properties of objects in motion is a core task across scientific and industrial applications. When the relative motion between the object and the sensing apparatus provides sufficient angular coverage, Computerized Tomography offers a powerful means of reconstruction. For such scenarios, we propose a parametric spatiotemporal model applied to Gaussian Mixture Models (GMM), in which each constituent Gaussian is parameterized by its own angular velocity, projectile motion, and geometry. GMM are a suitable means of reconstruction because they (i) admit accurate approximations in object space and (ii) have a closed form expression under the ray transform; enabling efficient forward predictions and exact gradient computations in data space. By decoupling the reconstruction problem into two sub-inverse problems, we characterize solutions as minimizers of task-specific objective functions that are derived and solved by utilizing the properties of (ii). The resulting algorithm we provide is applicable to objects in Euclidean space of arbitrary dimension. We validate the method on a simulated 2D problem, achieving accurate reconstruction of a 5-Gaussian GMM with intersecting trajectories. This also provides a foundation for further experimentation in settings with noisy data, 3D objects, and non-rigid body dynamics.

math.NA↗

arXiv2020

Gaussian mixture model decomposition of multivariate signals

We propose a greedy variational method for decomposing a non-negative multivariate signal as a weighted sum of Gaussians, which, borrowing the terminology from statistics, we refer to as a Gaussian mixture model. Notably, our method has the following features: (1) It accepts multivariate signals, i.e. sampled multivariate functions, histograms, time series, images, etc. as input. (2) The method can handle general (i.e. ellipsoidal) Gaussians. (3) No prior assumption on the number of mixture components is needed. To the best of our knowledge, no previous method for Gaussian mixture model decomposition simultaneously enjoys all these features. We also prove an upper bound, which cannot be improved by a global constant, for the distance from any mode of a Gaussian mixture model to the set of corresponding means. For mixtures of spherical Gaussians with common variance $σ^2$, the bound takes the simple form $\sqrt{n}σ$. We evaluate our method on one- and two-dimensional signals. Finally, we discuss the relation between clustering and signal decomposition, and compare our method to the baseline expectation maximization algorithm.

stat.ML↗

arXiv2017

Sampling for approximating $R$-limited functions

$R$-limited functions are multivariate generalization of band-limited functions whose Fourier transforms are supported within a compact region $R\subset\mathbb{R}^{n}$. In this work, we generalize sampling and interpolation theorems for band-limited functions to $R$-limited functions. More precisely, we investigated the following question: "For a function compactly supported within a region similar to $R$, does there exist an $R$-limited function that agrees with the function over its support for a desired accuracy?". Starting with the Fourier domain definition of an $R$-limited function, we write the equivalent convolution and a discrete Fourier transform representations for $R$-limited functions through approximation of the convolution kernel using a discrete subset of Fourier basis. The accuracy of the approximation of the convolution kernel determines the accuracy of the discrete Fourier representation. Construction of the discretization can be achieved using the tools from approximation theory as demonstrated in the appendices. The main contribution of this work is proving the equivalence between the discretization of the Fourier and convolution representations of $R$-limited functions. Here discrete convolution representation is restricted to shifts over a compactly supported region similar to $R$. We show that discrete shifts for the convolution representation are equivalent to the spectral parameters used in discretization of the Fourier representation of the convolution kernel. This result is a generalization of the cardinal theorem of interpolation of band-limited functions. The error corresponding to discrete convolution representation is also bounded by the approximation of the convolution kernel using discretized Fourier basis.

cs.IT↗

arXiv2017

Approximating fractional derivative of the Gaussian function and Dawson's integral

A new method for approximating fractional derivatives of the Gaussian function and Dawson's integral are presented. Unlike previous approaches, which are dominantly based on some discretization of Riemann-Liouville integral using polynomial or discrete Fourier basis, we take an alternative approach which is based on expressing the Riemann-Liouville definition of the fractional integral for the semi-infinite axis in terms of a moment problem. As a result, fractional derivatives of the Gaussian function and Dawson's integral are expressed as a weighted sum of complex scaled Gaussian and Dawson's integral. Error bounds for the approximation are provided. Another distinct feature of the proposed method compared to the previous approaches, it can be extended to approximate partial derivative with respect to the order of the fractional derivative which may be used in PDE constraint optimization problems.

math.NA↗