Related papers: Testing surface area with arbitrary accuracy
Surface normal estimation from a single image is an important task in 3D scene understanding. In this paper, we address two limitations shared by the existing methods: the inability to estimate the aleatoric uncertainty and lack of detail…
The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These…
This paper presents a method for determining the area explored by a line-sweep sensor during an area-covering mission in a two-dimensional plane. Accurate knowledge of the explored area is crucial for various applications in robotics, such…
Random sequential adsorption (RSA) is a time-dependent packing process, in which particles of certain shapes are randomly and sequentially placed into an empty space without overlap. In the infinite-time limit, the density approaches a…
It was shown by K. Ball and F. Nazarov, that the maximal surface area of a convex set in $\mathbb{R}^n$ with respect to the Standard Gaussian measure is of order $n^{\frac{1}{4}}$. In the present paper we establish the analogous result for…
Randomized Fast Subspace Descent (RFASD) Methods are developed and analyzed for smooth and non-constraint convex optimization problems. The efficiency of the method relies on a space decomposition which is stable in $A$-norm, and meanwhile,…
We present a fast algorithm for global rigid symmetry detection with approximation guarantees. The algorithm is guaranteed to find the best approximate symmetry of a given shape, to within a user-specified threshold, with very high…
Randomized matrix sparsification has proven to be a fruitful technique for producing faster algorithms in applications ranging from graph partitioning to semidefinite programming. In the decade or so of research into this technique, the…
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability distributions given in the form of an oracle $f:[n]\to[m]$.…
We introduce a new type of test for complete spatial randomness that applies to mapped point patterns in a rectangle or a cube of any dimension. This is the first test of its kind to be based on characteristic functions and utilizes a…
Let $P$ be a set of $n$ points in the plane. We show how to find, for a given integer $k>0$, the smallest-area axis-parallel rectangle that covers $k$ points of $P$ in $O(nk^2 \log n+ n\log^2 n)$ time. We also consider the problem of, given…
The failure of roughness parameters to predict surface properties stems from their inherent scale-dependence; in other words, the measured value depends on the way it was measured. Here we take advantage of this scale-dependence to develop…
Randomized smoothing is a popular certified defense against adversarial attacks. In its essence, we need to solve a problem of statistical estimation which is usually very time-consuming since we need to perform numerous (usually $10^5$)…
We propose a series-based nonparametric specification test for a regression function when data are spatially dependent, the `space' being of a general economic or social nature. Dependence can be parametric, parametric with increasing…
It was shown in \cite{GL} that the maximal surface area of a convex set in $\mathbb{R}^n$ with respect to a rotation invariant log-concave probability measure $\gamma$ is of order $\frac{\sqrt{n}}{\sqrt[4]{Var|X|} \sqrt{\mathbb{E}|X|}}$,…
Given a source of iid samples of edges of an input graph $G$ with $n$ vertices and $m$ edges, how many samples does one need to compute a constant factor approximation to the maximum matching size in $G$? Moreover, is it possible to obtain…
We present a novel method for single image depth estimation using surface normal constraints. Existing depth estimation methods either suffer from the lack of geometric constraints, or are limited to the difficulty of reliably capturing…
In this paper we study surfaces in Euclidean 3-space that satisfy a Weingarten condition of linear type as $\kappa_1=m \kappa_2 +n$, where $m$ and $n$ are real numbers and $\kappa_1$ and $\kappa_2$ denote the principal curvatures at each…
In this work, we introduce a novel local pairwise descriptor and then develop a simple, effective iterative method to solve the resulting quadratic assignment through sparsity control for shape correspondence between two approximate…
The good mesh quality of an evolving discretized surface or domain is often compromised during time evolution. In recent years this phenomena have been overcome in a couple of ways, one of them uses arbitrary Lagrangian Eulerian maps.…