Related papers: C-image partition regularity near zero

The present paper studies so-called deep image prior (DIP) techniques in the context of ill-posed inverse problems. DIP networks have been recently introduced for applications in image processing; also first experimental results for…

The \textit{nowhere dense ideal} $\mathcal{NC}$ is introduced. It is a coanalytic ideal of $\omega\times\omega$ whose defining characteristic is that the sets of the form $X\times Y$, where $X,Y$ are infinite subsets of $\omega$, are dense…

$c$-realcompact spaces are introduced by Karamzadeh and Keshtkar in Quaest. Math. 41(8), 2018, 1135-1167. We offer a characterization of these spaces $X$ via $c$-stable family of closed sets in $X$ by showing that $X$ is $c$-realcompact if…

We consider approximation algorithms for covering integer programs of the form min $\langle c, x \rangle $ over $x \in \mathbb{N}^n $ subject to $A x \geq b $ and $x \leq d$; where $A \in \mathbb{R}_{\geq 0}^{m \times n}$, $b \in…

Modeling the distribution of natural images is a landmark problem in unsupervised learning. This task requires an image model that is at once expressive, tractable and scalable. We present a deep neural network that sequentially predicts…

This paper explores the concept of approximate Birkhoff-James orthogonality in the context of operators on semi-Hilbert spaces. These spaces are generated by positive semi-definite sesquilinear forms. We delve into the fundamental…

A polar hypersurface P of a complex analytic hypersurface germ, f=0, can be investigated by analyzing the invariance of certain Newton polyhedra associated to the image of P, with respect to suitable coordinates, by certain morphisms…

Size uniformity is one of the main criteria of superpixel methods. But size uniformity rarely conforms to the varying content of an image. The chosen size of the superpixels therefore represents a compromise - how to obtain the fewest…

A Bayesian approach to the classification problem is proposed in which random partitions play a central role. It is argued that the partitioning approach has the capacity to take advantage of a variety of large-scale spatial structures, if…

State-of-the-art image-set matching techniques typically implicitly model each image-set with a Gaussian distribution. Here, we propose to go beyond these representations and model image-sets as probability distribution functions (PDFs)…

Let $X$ be a compact metric space which is locally absolutely retract and let $\phi: C(X)\to C(Y, M_n)$ be a unital homomorphism, where $Y$ is a compact metric space with ${\rm dim}Y\le 2.$ It is proved that there exists a sequence of $n$…

This article investigates the phenomenon of maximal rigidity in spatial processes, where perfect interpolation of the process is possible from partial information, specifically, from its restriction to a strict subdomain, often resulting in…

We solve the problem of best approximation by partial isometries of given rank to an arbitrary rectangular matrix, when the distance is measured in any unitarily invariant norm. In the case where the norm is strictly convex, we parametrize…

Perceptual image restoration seeks for high-fidelity images that most likely degrade to given images. For better visual quality, previous work proposed to search for solutions within the natural image manifold, by exploiting the latent…

Semantic image parsing, which refers to the process of decomposing images into semantic regions and constructing the structure representation of the input, has recently aroused widespread interest in the field of computer vision. The recent…

We study two mixed robust/average-case submodular partitioning problems that we collectively call Submodular Partitioning. These problems generalize both purely robust instances of the problem (namely max-min submodular fair allocation…

Variational segmentation algorithms require a prior imposed in the form of a regularisation term to enforce smoothness of the solution. Recently, it was shown in the Deep Image Prior work that the explicit regularisation in a model can be…

In the present paper we initiate the study of a certain kind of partition inequality, by showing, for example, that if $M\geq 5$ is an integer and the integers $a$ and $b$ are relatively prime to $M$ and satisfy $1\leq a<b<M/2$, and the…

Partition regularity over algebraic structures is a topic in Ramsey theory that has been extensively researched by combinatorialists. Motivated by recent work in this area, we investigate the computability-theoretic and reverse-mathematical…

We give sufficient conditions allowing one to build a C*-algebraic structure on a self-adjoint linear subspace of a C*-algebra in such a way that the subspace is naturally identified with the resulting C*-algebra via a completely positive…