Related papers: Tiling with Boundaries: Dense digital images have …
We demonstrate a means of creating a digital image by using a two axis tilt micromirror to scan a scene. For each different orientation we extract a single grayscale value from the mirror and combine them to form a single composite image.…
We consider hard-disc mixtures with disc sizes within ratio $\sqrt{2}-1$, that is, the small disc exactly fits in the hole between four large discs. For each prescribed stoichiometry of large and small discs, the densest packings are…
The network flow optimization approach is offered for Bayesian segmentation of gray-scale and color images. It is supposed image pixels are characterized by a feature function taking finite number of arbitrary rational values (it can be…
An h-tiling on a finite simplicial complex is a partition of its geometric realization by maximal simplices deprived of several codimension one faces together with possibly their remaining face of highest codimension. In this last case, the…
We consider the problem of how much edge connectivity is necessary to force a graph G to contain a fixed graph H as an immersion. We show that if the maximum degree in H is D, then all the examples of D-edge connected graphs which do not…
We consider the restricted subsets of $\mathbb{N}_n=\{1,2,\ldots,n\}$ with $q\geq1$ being the largest member of the set $\mathcal{Q}$ of disallowed differences between subset elements. We obtain new results on various classes of problem…
Connected components of real algebraic varieties invariant under the $CB_{n}$-Coxeter group are investigated. In particular, we consider their maximal number and their geometric and topological properties. This provides a decomposition for…
We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed degrees. For rank-one inhomogeneous random graphs, such…
A colouring of a hypergraph's vertices is polychromatic if every hyperedge contains at least one vertex of each colour; the polychromatic number is the maximum number of colours in such a colouring. Its dual, the cover-decomposition number,…
We study the Hard Core Model on the graphs ${\rm {\bf \scriptstyle G}}$ obtained from Archimedean tilings i.e. configurations in $\scriptstyle \{0,1\}^{{\rm {\bf G}}}$ with the nearest neighbor 1's forbidden. Our particular aim in choosing…
The inclusion relation between simple objects in the plane may be used to define geometric set systems, or hypergraphs. Properties of various types of colorings of these hypergraphs have been the subject of recent investigations, with…
In this paper we study a class of fast geometric image inpainting methods based on the idea of filling the inpainting domain in successive shells from its boundary inwards. Image pixels are filled by assigning them a color equal to a…
A partition $(V_1,\ldots,V_k)$ of the vertex set of a graph $G$ with a (not necessarily proper) colouring $c$ is colourful if no two vertices in any $V_i$ have the same colour and every set $V_i$ induces a connected graph. The COLOURFUL…
In this paper, we present a novel non-parametric clustering technique. Our technique is based on the notion that each latent cluster is comprised of layers that surround its core, where the external layers, or border points, implicitly…
Wave propagation in multilayered media with high material contrasts poses significant numerical challenges, as large variations in wavenumbers lead to strong reflections and complex transmission of the incoming wave field. To address these…
A finite set of integers $A$ tiles the integers by translations if $\mathbb{Z}$ can be covered by pairwise disjoint translated copies of $A$. Restricting attention to one tiling period, we have $A\oplus B=\mathbb{Z}_M$ for some…
Consider the set of all digraphs on $[N]$ with $M$ edges, whose minimum in-degree and minimum out-degree are at least $k_1$ and $k_2$ respectively. For $k:=\min\{k_1,k_2\}\ge 2$ and $M/N>\max\{k_1,k_2\}$, $M=\Theta(N)$, we show that, among…
Super-resolution imaging aims at improving the resolution of an image by enhancing it with other images or data that might have been acquired using different imaging techniques or modalities. In this paper we consider the task of doubling,…
The ability to characterize the color content of natural imagery is an important application of image processing. The pixel by pixel coloring of images may be viewed naturally as points in color space, and the inherent structure and…
We consider inhomogeneous percolation on a hierarchical configuration model with a heavy-tailed degree distribution. This graph is the configuration model where all the half-edges are colored either black or white, and edges are formed by…