Related papers: Uniqueness in Discrete Tomography of Delone Sets w…

Improvement of label-free far-field resolution of optical imaging is possible with prior knowledge of the object such as its sparsity or accumulated by a posteriori examination of a similar class of object1-4. We show that the sole…

Deep Convolutional Neural Networks (DCNN) have been proven to be effective for various computer vision problems. In this work, we demonstrate its effectiveness on a continuous object orientation estimation task, which requires prediction of…

We prove that every end of a graph contains either uncountably many disjoint rays or a set of disjoint rays that meet all rays of the end and start at any prescribed feasible set of start vertices. This confirms a conjecture of…

In single-molecule microscopy it is necessary to locate with high precision point sources from noisy observations of the spectrum of the signal at frequencies capped by $f_c$, which is just about the frequency of natural light. This paper…

The Delaunay tessellation of a locally finite subset of hyperbolic space is constructed using convex hulls in Euclidean space of one higher dimension. For finite and lattice-invariant sets it is proven to be a polyhedral decomposition, and…

Precise segmentation of objects with highly similar shapes remains a challenging problem in dense prediction, especially in scenarios with ambiguous boundaries, overlapping instances, and weak inter-instance visual differences. While…

We characterize the extreme points of the set of incentive-compatible mechanisms for screening problems with linear utility. Our framework subsumes problems with and without transfers, such as monopoly pricing, principal-optimal bilateral…

Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…

This article focuses on the question of learning how to automatically select a subset of items among a bigger set. We introduce a methodology for the inference of ensembles of discrete values, based on the Naive Bayes assumption. Our…

Purpose: Automated distinct bone segmentation from CT scans is widely used in planning and navigation workflows. U-Net variants are known to provide excellent results in supervised semantic segmentation. However, in distinct bone…

In this paper we explicitly estimate the number of points in a subset $A \subset \R^{d}$ as a function of the maximum angle $\angle A$ that any three of these points form, provided $\angle A < \theta_d := \arccos(-\frac 1 {d}) \in…

In a series of three papers we develop an end space theory for directed graphs. As for undirected graphs, the ends of a digraph are points at infinity to which its rays converge. Unlike for undirected graphs, some ends are joined by limit…

Labeled Latent Dirichlet Allocation (LLDA) is an extension of the standard unsupervised Latent Dirichlet Allocation (LDA) algorithm, to address multi-label learning tasks. Previous work has shown it to perform in par with other…

In this note we study linear systems on complete toric varieties $X$ with an invariant point, whose orbit under the action of the automorphism group of $X$ contains the dense torus $T$ of $X$. We give a characterization of such varieties in…

We propose an anomaly detection technique for high-resolution X-ray spectroscopy. The method is based on the neural network architecture variational autoencoder, and requires only {\it normal} samples for training. We implement the network…

Let F : P^n --> P^n be a morphism of degree d > 1 defined over C. The dynamical Mordell--Lang conjecture says that the intersection of an orbit O_F(P) and a subvariety X of P^n is usually finite. We consider the number of linear…

For a finite set $U$ of directions in the Euclidean plane, a convex non-degenerate polygon $P$ is called a $U$-polygon if every line parallel to a direction of $U$ that meets a vertex of $P$ also meets another vertex of $P$. We characterize…

In this paper, we propose a novel object detection framework named "Deep Regionlets" by establishing a bridge between deep neural networks and conventional detection schema for accurate generic object detection. Motivated by the abilities…

A set $\mathcal{S}$ of derangements (fixed-point-free permutations) of a set $V$ generates a digraph with vertex set $V$ and arcs $(x,x^\sigma)$ for $x\in V$ and $\sigma\in\mathcal{S}$. We address the problem of characterising those…

We study the property of uniform discreteness within discrete orbits of non-uniform lattices in $SL_2(\mathbb{R})$, acting on $\mathbb{R}^2$ by linear transformations. We provide quantitative consequences of previous results by using…