Related papers: Selection Lemmas for various geometric objects
(i) We provide a short and simple proof of the first selection lemma. (ii) We also prove a selection lemma of a new type in $\Re^d$. For example, when $d=2$ assuming $n$ is large enough we prove that for any set $P$ of $n$ points in general…
The point selection theorem says that the convex hull of any finite point set contains a point that lies in a positive proportion of the simplices determined by that set. This paper proves several new volumetric versions of this theorem…
$ \newcommand{\Re}{\mathbb{R}} \newcommand{\reals}{\mathbb{R}} \newcommand{\SetX}{\mathsf{X}} \newcommand{\rad}{r} \newcommand{\Mh}[1]{#1} \newcommand{\query}{q} \newcommand{\eps}{\varepsilon} \newcommand{\VorX}[1]{\mathcal{V} \pth{#1}}…
We study geometric variations of the discriminating code problem. In the \emph{discrete version} of the problem, a finite set of points $P$ and a finite set of objects $S$ are given in $\mathbb{R}^d$. The objective is to choose a subset…
Symmetry is an important composition feature by investigating similar sides inside an image plane. It has a crucial effect to recognize man-made or nature objects within the universe. Recent symmetry detection approaches used a smoothing…
The projection lemma (often also referred to as the elimination lemma) is one of the most powerful and useful tools in the context of linear matrix inequalities for system analysis and control. In its traditional formulation, the projection…
Selective segmentation is an important application of image processing. In contrast to global segmentation in which all objects are segmented, selective segmentation is used to isolate specific objects in an image and is of particular…
Machine learning and data mining techniques are effective tools to classify large amounts of data. But they tend to preserve any inherent bias in the data, for example, with regards to gender or race. Removing such bias from data or the…
Evolution and geometry generate complexity in similar ways. Evolution drives natural selection while geometry may capture the logic of this selection and express it visually, in terms of specific generic properties representing some kind of…
Consider a set $P$ of $n$ points picked uniformly and independently from $[0,1]^d$ for a constant dimension $d$ -- such a point set is extremely well behaved in many aspects. For example, for a fixed $r \in [0,1]$, we prove a new…
The success of deep neural networks in image classification and learning can be partly attributed to the features they extract from images. It is often speculated about the properties of a low-dimensional manifold that models extract and…
Symmetry detection and discrimination are of fundamental meaning in science, technology, and engineering. This paper introduces reflection invariants and defines the directional moment to detect symmetry for shape analysis and object…
In this work, we develop Extraction Theorems for classes of geometric objects with small extraction numbers. These classes include intervals, axis-parallel segments, axis-parallel rays, and octants. We investigate these classes of objects…
For certain weak versions of the Axiom of Choice (most notably, the Boolean Prime Ideal theorem), we obtain equivalent formulations in terms of partial orders, and filter-like objects within them intersecting certain dense sets or…
In 2008, Halman proved a discrete Helly-type theorem for axis-parallel boxes in $\mathbb R^d$. Very recently, this result was extended to the $(p,q)$ setting with $p \geq q \geq d+1$ by Edwards and Sober\'on, and subsequently to the case $p…
Delaunay has shown that the Delaunay complex of a finite set of points $P$ of Euclidean space $\mathbb{R}^m$ triangulates the convex hull of $P$, provided that $P$ satisfies a mild genericity property. Voronoi diagrams and Delaunay…
We introduce the notion of geometric purity in rigidly-compactly generated tt-categories by considering exact triangles that are pure at each tt-stalk. We develop a systematic study of this concept, including examples and applications. In…
We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…
The goal of feature selection is to choose the optimal subset of features for a recognition task by evaluating the importance of each feature, thereby achieving effective dimensionality reduction. Currently, proposed feature selection…
We study constrained selection sets of random closed sets defined on a non-atomic probability space. Given a random interval $Y=[y_L,y_U]$ and scalar constraints on the expectation or the median of admissible selections, we characterize the…