Related papers: On the error bounds for visible points in some cut…
We consider passive imaging tasks involving discrimination between known candidate objects and investigate the best possible accuracy with which the correct object can be identified. We analytically compute quantum-limited error bounds for…
The 2-sets convex feasibility problem aims at finding a point in the nonempty intersection of two closed convex sets $A$ and $B$ in a Hilbert space $X$. The method of alternating projections is the simplest iterative procedure for finding a…
We quantify the uncertainty in weak lensing mass estimates of clusters of galaxies, caused by distant (uncorrelated) large scale structure along the line of sight. We find that the effect is fairly small for deep observations (20<R<26) of…
In the 1980's Serre asked how many points of bounded height can lie in a thin set. This has motivated significant research ever since, culminating in a series of recent breakthroughs. It is a good time to take stock of the central questions…
In this paper, using the concept of natural density, we have introduced the notion of rough statistical convergence which is an extension of the notion of rough convergence in a partial metric space. We have defined the set of rough…
Recent works on predictive uncertainty estimation have shown promising results on Out-Of-Distribution (OOD) detection for semantic segmentation. However, these methods struggle to precisely locate the point of interest in the image, i.e,…
The problem of density of $C^0$-stable mappings is a classical and venerable subject in singularity theory. In 1973, Mather showed that the set of proper $C^0$-stable mappings is dense in the set of all proper mappings, which implies that…
According to the Dudley-Wichura extension of the Skorohod representation theorem, convergence in distribution to a limit in a separable set is equivalent to the existence of a coupling with elements converging a.s. in the metric. A density…
We study the set of visible lattice points in multidimensional hypercubes. The problems we investigate mix together geometric, probabilistic and number theoretic tones. For example, we prove that almost all self-visible triangles with…
Studies of strong gravitational lensing in current and upcoming wide and deep photometric surveys, and of stellar kinematics from (integral-field) spectroscopy at increasing redshifts, promise to provide valuable constraints on galaxy…
We report optical spectroscopic observations of a sample of 6 low-galactic latitude microquasar candidates selected by cross-identification of X-ray and radio point source catalogs for |b|<5 degrees. Two objects resulted to be of clear…
We present density split statistics, a framework that studies lensing and counts-in-cells as a function of foreground galaxy density, thereby providing a large-scale measurement of both 2-point and 3-point statistics. Our method extends our…
We have embarked on a survey of ROSAT PSPC archival data with the aim of detecting all significant surface brightness enhancements due to sources in the innermost 15 arcmin of the PSPC field of view (0.5-2.0 keV). This project is part of…
3D object detection from monocular image(s) is a challenging and long-standing problem of computer vision. To combine information from different perspectives without troublesome 2D instance tracking, recent methods tend to aggregate…
We use a large data-set of realistic synthetic observations (PaperI) to assess how observational techniques affect the measurement of physical properties of star-forming regions. In this paper (PaperII), we explore the reliability of the…
This paper introduces the point-axis representation for oriented object detection, emphasizing its flexibility and geometrically intuitive nature with two key components: points and axes. 1) Points delineate the spatial extent and contours…
We give sufficient conditions under which the set of eventually periodic points in the intersection of immediate attracting basins boundaries is non-empty. We give other conditions under which this set is dense in the intersection.
In this paper, we study the problem of unsupervised object detection from 3D point clouds in self-driving scenes. We present a simple yet effective method that exploits (i) point clustering in near-range areas where the point clouds are…
Projection methods are popular algorithms for iteratively solving feasibility problems in Euclidean or even Hilbert spaces. They employ (selections of) nearest point mappings to generate sequences that are designed to approximate a point in…
We consider the problem of mirror invisibility for plane sets. Given a circle and a finite number of unit vectors (defining the directions of invisibility) such that the angles between them are commensurable with $\pi$, for any $\varepsilon…