Searcharxiv⌕ Search

arXiv subjects

Vitalii Makogin

Publications and source records attributed to Vitalii Makogin.

At least 19 recordsLinked to original sources

DFS-based fast crack pre-detection

This paper develops a computationally efficient pre-detection method for cracks in three-dimensional CT images of concrete. Instead of attempting full voxel-wise crack segmentation, the method focuses on locating cubic subregions where crack structures are likely to be present and should be analyzed further. The proposed pipeline combines multiscale Maximal Hessian Entry filtering with graph-based connectivity analysis. After binarization, each subregion is represented by the boundary face with the largest foreground pixels, which transforms the local detection problem from a three-dimensional image task into a two-dimensional graph problem. A sparse lattice graph is constructed on the selected face, and Depth-First Search is applied to detect connected components corresponding to possible crack cross-sections. The choice of mesh size is justified by a probabilistic upper bound on a lattice-miss event. Experiments on semi-synthetic and real CT data show that the method gives fast, interpretable crack pre-localization while avoiding exhaustive analysis of the full image.

eess.IV↗

Extrapolation of max-stable random fields with Fréchet marginals

We propose a method for the prediction of stationary max--stable random fields with $α$-Fréchet marginal distribution $H_α$. The method is suitable to cope with heavy tails for $α\in(0,2)$ and is (approximately) exact in marginal distributions. It is based on a recent extrapolation approach via level sets which requires no moment assumptions. An explicit connection between the excursion metric and the Davis-Resnick distance is established. The existence of the predictor is proven. The non-uniqueness of the forecast is demonstrated on several examples. The method is tested on multiple simulated time series and random fields as well as applied to real data of annual maximum precipitation.

math.PR↗

A statistical method for crack pre-detection in 3D concrete images

In practical applications, effectively segmenting cracks in large-scale computed tomography (CT) images holds significant importance for understanding the structural integrity of materials. Classical image-processing techniques and modern deep-learning models both face substantial computational challenges when applied directly to high resolution big data volumes. This paper introduces a statistical framework for crack pre-localization, whose purpose is not to replace or compete with segmentation networks, but to identify, with controlled error rates, the regions of a 3D CT image that are most likely to contain cracks. The method combines a simple Hessian-based filter, geometric descriptors computed on a regular spatial partition, and a spatial multiple testing procedure to detect anomalous regions while relying only on minimal calibration data, rather than large annotated datasets. Experiments on semi-synthetic and real 3D CT scans demonstrate that the proposed approach reliably highlights regions likely to contain cracks while preserving linear computational complexity. By restricting subsequent high resolution segmentation to these localized regions, deep-learning models can be trained and operate more efficiently, reducing both training runtime as well as resource consumption. The framework thus offers a practical and interpretable preprocessing step for large-scale CT inspection pipelines.

cs.CV↗

A change-point problem for $m$-dependent multivariate random field

In this paper, we consider a change-point problem for a centered, stationary and $m$-dependent multivariate random field. Under the distribution free assumption, a change-point test using CUSUM statistic is proposed to detect anomalies within a multidimensional random field, controlling the false positive rate as well as the Family-Wise Error in the multiple hypotheses testing context.

math.ST↗

Prediction of random variables by excursion metric projections

We use the concept of excursions for the prediction of random variables without any moment existence assumptions. To do so, an excursion metric on the space of random variables is defined which appears to be a kind of a weighted $L^1$-distance. Using equivalent forms of this metric and the specific choice of excursion levels, we formulate the prediction problem as a minimization of a certain target functional which involves the excursion metric. Existence of the solution and weak consistency of the predictor are discussed. An application to the extrapolation of stationary heavy-tailed random functions illustrates the use of the aforementioned theory. Numerical experiments with the prediction of Gaussian, $α$-stable and further heavy--tailed time series round up the paper.

math.ST↗

Extrapolation of Stationary Random Fields Via Level Sets

In this paper, we use the concept of excursion sets for the extrapolation of stationary random fields. Doing so, we define excursion sets for the field and its linear predictor, and then minimize the expected volume of the symmetric difference of these sets under the condition that the univariate distributions of the predictor and of the field itself coincide. We illustrate the new approach on Gaussian random fields.

math.PR↗

Limit theorems for excursion sets of subordinated Gaussian random fields with long-range dependence

This paper considers the asymptotic behaviour of volumes of excursion sets of subordinated Gaussian random fields with (possibly) infinite variance. Actually, we consider integral functionals of such fields and obtain their limiting distribution using the Hermite expansion of the integrand. We consider the general non-stationary Gaussian random fields, including stationary and anisotropic special cases. The limiting random variables in our limit theorems have the form of multiple Wiener-Itô integrals. We illustrate most results with corresponding examples.

math.PR↗

The entropy based goodness of fit tests for generalized von Mises-Fisher distributions and beyond

We introduce some new classes of unimodal rotational invariant directional distributions, which generalize von Mises-Fisher distribution. We propose three types of distributions, one of which represents axial data. For each new type we provide formulae and short computational study of parameter estimators by the method of moments and the method of maximum likelihood. The main goal of the paper is to develop the goodness of fit test to detect that sample entries follow one of the introduced generalized von Mises--Fisher distribution based on the maximum entropy principle. We use $k$th nearest neighbour distances estimator of Shannon entropy and prove its $L^2$-consistency. We examine the behaviour of the test statistics, find critical values and compute power of the test on simulated samples. We apply the goodness of fit test to local fiber directions in a glass fibre reinforced composite material and detect the samples which follow axial generalized von Mises--Fisher distribution.

math.ST↗

Entropy-based test for generalized Gaussian distributions

In this paper, we provide the proof of $L^2$ consistency for the $k$th nearest neighbour distance estimator of the Shannon entropy for an arbitrary fixed $k\geq 1.$ We construct the non-parametric test of goodness-of-fit for a class of introduced generalized multivariate Gaussian distributions based on a maximum entropy principle. The theoretical results are followed by numerical studies on simulated samples.

math.ST↗

Approximate solution of the integral equations involving kernel with additional singularity

The paper is devoted to the approximate solutions of the Fredholm integral equations of the second kind with the weak singular kernel that can have additional singularity in the numerator. We describe two problems that lead to such equations. They are the problem of minimization of small deviation and the entropy minimization problem. Both of them appear when considering dynamical system involving mixed fractional Brownian motion. In order to deal with the kernel with additional singularity applying well-known methods for weakly singular kernels, we prove the theorem on the approximation of solution of integral equation with the kernel containing additional singularity by the solutions of the integral equations whose kernels are weakly singular but the numerator is continuous. We demonstrate numerically how our methods work being applied to our specific integral equations.

math.PR↗

Long Range Dependence for Stable Random Processes

We investigate long and short memory in $α$-stable moving averages and max-stable processes with $α$-Fréchet marginal distributions. As these processes are heavy-tailed, we rely on the notion of long range dependence suggested by Kulik and Spodarev (2019) based on the covariance of excursions. Sufficient conditions for the long and short range dependence of $α$-stable moving averages are proven in terms of integrability of the corresponding kernel functions. For max-stable processes, the extremal coefficient function is used to state a necessary and sufficient condition for long range dependence.

math.PR↗

Fractional integrals, derivatives and integral equations with weighted Takagi-Landsberg functions

In this paper we find fractional Riemann-Liouville derivatives for the Takagi-Landsberg functions. Moreover, we introduce their generalizations called weighted Takagi-Landsberg functions which have arbitrary bounded coefficients in the expansion under Schauder basis. The class of the weighted Takagi- Landsberg functions of order $H>0$ on $[0,1]$ coincides with the $H$-Hölder continuous functions on $[0,1]$. Based on computed fractional integrals and derivatives of the Haar and Schauder functions, we get a new series representation of the fractional derivatives of a Hölder continuous function. This result allows to get the new formula of a Riemann-Stieltjes integral. The application of such series representation is the new method of numerical solution of the Volterra and linear integral equations driven by a Hölder continuous function.

math.CA↗

Detecting anomalies in fibre systems using 3-dimensional image data

We consider the problem of detecting anomalies in the directional distribution of fibre materials observed in 3D images. We divide the image into a set of scanning windows and classify them into two clusters: homogeneous material and anomaly. Based on a sample of estimated local fibre directions, for each scanning window we compute several classification attributes, namely the coordinate wise means of local fibre directions, the entropy of the directional distribution, and a combination of them. We also propose a new spatial modification of the Stochastic Approximation Expectation-Maximization (SAEM) algorithm. Besides the clustering we also consider testing the significance of anomalies. To this end, we apply a change point technique for random fields and derive the exact inequalities for tail probabilities of a test statistics. The proposed methodology is first validated on simulated images. Finally, it is applied to a 3D image of a fibre reinforced polymer.

stat.ME↗

Gaussian self-similar random fields with distinct stationary properties of their rectangular increments

We describe two classes of Gaussian self-similar random fields: with strictly stationary rectangular increments and with mild stationary rectangular increments. We find explicit spectral and moving average representations for the fields with strictly stationary rectangular increments and characterize fields with mild stationary rectangular increments by the properties of covariance functions of their Lamperti transformations as well as in terms of their spectral densities. We establish that both classes contain not only fractional Brownian sheets and we provide corresponding examples. As a by-product, we obtain a new spectral representation for the fractional Brownian motion.

math.PR↗

Application of Clustering Methods to Anomaly Detection in Fibrous Media

The paper considers the problem of anomaly detection in 3D images of fibre materials. The spatial Stochastic Expectation Maximisation algorithm and Adaptive Weights Clustering are applied to solve this problem. The initial 3D grey scale image was divided into small cubes subject to clustering. For each cube clustering attributes values were calculated: mean local direction and directional entropy. Clustering is conducted according to the given attributes. The proposed methods are tested on the simulated images and on real fibre materials.

stat.AP↗

On mean-variance hedging under partial observations and terminal wealth constraints

In the paper, a mean-square minimization problem under terminal wealth constraint with partial observations is studied. The problem is naturally connected to the mean-variance hedging problem under incomplete information. A new approach to solving this problem is proposed. The paper provides a solution when the underlying pricing process is a square-integrable semimartingale. The proposed method for the study is based on the martingale representation. In special cases, the Clark-Ocone representation can be used to obtain explicit solutions. The results and the method are illustrated and supported by example with two correlated geometric Brownian motions.

q-fin.MF↗

Simulation paradoxes related to a fractional Brownian motion with small Hurst index

We consider the simulation of sample paths of a fractional Brownian motion with small values of the Hurst index and estimate the behavior of the expected maximum. We prove that, for each fixed $N$, the error of approximation $\mathbf {E}\max_{t\in[0,1]}B^H(t)-\mathbf {E}\max_{i=\overline{1,N}}B^H(i/N)$ grows rapidly to $\infty$ as the Hurst index tends to 0.

math.PR↗

Probability distributions of extremes of self-similar Gaussian random fields

We have obtained some upper bounds for the probability distribution of extremes of a self-similar Gaussian random field with stationary rectangular increments that are defined on the compact spaces. The probability distributions of extremes for the normalized self-similar Gaussian random fields with stationary rectangular increments defined in ${\mathbb{R}}^2_+$ have been presented. In our work we have used the techniques developed for the self-similar fields and based on the classical series analysis of the maximal probability bounding from below for the Gaussian fields.

math.PR↗