Related papers: On the error bounds for visible points in some cut…
Deep convolutional models often produce inadequate predictions for inputs foreign to the training distribution. Consequently, the problem of detecting outlier images has recently been receiving a lot of attention. Unlike most previous work,…
We consider the problem of finding, for a given quadratic measure of non-uniformity of a set of $N$ points (such as $L_2$ star-discrepancy or diaphony), the asymptotic distribution of this discrepancy for truly random points in the limit…
We explore the detection condition of a wide-separation planet through the perturbation induced by the planetary caustic for various microlensing parameters, especially for the size of the source stars. By constructing the fractional…
Cut-and-project sets $\Sigma\subset\mathbb{R}^n$ represent one of the types of uniformly discrete relatively dense sets. They arise by projection of a section of a higher-dimensional lattice to a suitably oriented subspace. Cut-and-project…
Estimating accurate bolometric fluxes for stars requires reliable photometry to absolutely flux calibrate the spectra. This is a significant problem for studies of very bright stars, which are generally saturated in modern photometric…
For $m, d \in {\mathbb N}$, a jittered sampling point set $P$ having $N = m^d$ points in $[0,1)^d$ is constructed by partitioning the unit cube $[0,1)^d$ into $m^d$ axis-aligned cubes of equal size and then placing one point independently…
In this paper, we study cut sets of attractors of iteration function systems (IFS) in $\mathbb{R}^d$. Under natural conditions, we show that all irreducible cut sets of these attractors are perfect sets or single points. This leads to a…
In this paper we study the high-dimensional super-resolution imaging problem. Here we are given an image of a number of point sources of light whose locations and intensities are unknown. The image is pixelized and is blurred by a known…
We formulate and investigate a statistical inverse problem of a random tomographic nature, where a probability density function on $\mathbb{R}^3$ is to be recovered from observation of finitely many of its two-dimensional projections in…
In this paper we first extend from normed spaces to locally convex spaces some characterizations of denting points in convex sets. On the other hand, we also prove that in an infrabarreled locally convex space a point in a convex set is…
We study the parametric online changepoint detection problem, where the underlying distribution of the streaming data changes from a known distribution to an alternative that is of a known parametric form but with unknown parameters. We…
Deep neural networks have set the state-of-the-art in computer vision tasks such as bounding box detection and semantic segmentation. Object detectors and segmentation models assign confidence scores to predictions, reflecting the model's…
In recent times, there has been a notable surge in multimodal approaches that decorates raw LiDAR point clouds with camera-derived features to improve object detection performance. However, we found that these methods still grapple with the…
We give necessary and sufficient conditions for a nonexpansive map on a finite dimensional normed space to have a nonempty, bounded set of fixed points. Among other results we show that if $f : V \rightarrow V$ is a nonexpansive map on a…
Model sets (also called cut and project sets) are generalizations of lattices. Here we show how the self-similarities of model sets are a natural replacement for the group of translations of a lattice. This leads us to the concept of…
Some properties of $m$-density points and density-degree functions are studied. Moreover the following main results are provided: \vskip2mm \begin{itemize} \item {\it Let $\lambda$ be a continuous differential form of degree $h$ in…
We consider the method of alternating projections for finding a point in the intersection of two closed sets, possibly nonconvex. Assuming only the standard transversality condition (or a weaker version thereof), we prove local linear…
This paper develops asymptotic methods to count faces of random high-dimensional polytopes. Beyond its intrinsic interest, our conclusions have surprising implications - in statistics, probability, information theory, and signal processing…
We provide a direct proof of a result regarding the asymptotic behavior of alternating nearest point projections onto two closed and convex sets in a Hilbert space. Our arguments are based on nonexpansive mapping theory.
A set of points with finite density is constructed in $\mathbb{R}^d$, with $d\geq2$, by adding points to a Poisson process such that any line segment of length $O\left(\varepsilon^{-(d-1)}\ln\varepsilon^{-1}\right)$ in $\mathbb{R}^d$ will…