Related papers: Centrally Image partition Regularity near 0

We show that for $q$-colorings in $k$-uniform hypergraphs with maximum degree $\Delta$, if $k\ge 50$ and $q\ge 700\Delta^{\frac{5}{k-10}}$, there is a "Lee-Yang" zero-free strip around the interval $[0,1]$ of the partition function, which…

Under the name prime decomposition (pd), a unique decomposition of an arbitrary $N$-dimensional density matrix $\rho$ into a sum of seperable density matrices with dimensions given by the coprime factors of $N$ is introduced. For a class of…

The core vertex set of a graph is an invariant of the graph. It consists of those vertices associated with the non-zero entries of the nullspace vectors of a $\{0,1\}$-adjacency matrix. The remaining vertices of the graph form the…

Overdetermined systems of first kind integral equations appear in many applications. When the right-hand side is discretized, the resulting finite-data problem is ill-posed and admits infinitely many solutions. We propose a numerical method…

Cell nuclei segmentation is one of the most important tasks in the analysis of biomedical images. With ever-growing sizes and amounts of three-dimensional images to be processed, there is a need for better and faster segmentation methods.…

This paper deals with the dynamics of discretizations of isometries of $\mathbf R^n$, and more precisely the density of the successive images of $\mathbf Z^n$ by the discretizations of a generic sequence of isometries. We show that this…

We prove three main results about semialgebraic hypergraphs. First, we prove an optimal and oblivious regularity lemma. Fox, Pach, and Suk proved that the class of $k$-uniform semialgebraic hypergraphs satisfies a very strong regularity…

Motivated by a $2$-dimensional (unsupervised) image segmentation task whereby local regions of pixels are clustered via edge detection methods, a more general probabilistic mathematical framework is devised. Critical thresholds are…

We introduce the notion of regular (boundary) poles for infinitesimal generators of semigroups of holomorphic self-maps of the unit disc. We characterize such regular poles in terms of $\beta$-points (i.e. pre-images of values with positive…

This paper investigates one of the most fundamental computer vision problems: image segmentation. We propose a supervised hierarchical approach to object-independent image segmentation. Starting with over-segmenting superpixels, we use a…

We show that the perfect matching problem in general graphs is in Quasi-NC. That is, we give a deterministic parallel algorithm which runs in $O(\log^3 n)$ time on $n^{O(\log^2 n)}$ processors. The result is obtained by a derandomization of…

We study a curious class of partitions, the parts of which obey an exceedingly strict congruence condition we refer to as "sequential congruence": the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part…

Real world image super-resolution (Real-ISR) often leverages the powerful generative priors of text-to-image diffusion models by regularizing the output to lie on their learned manifold. However, existing methods often overlook the…

The curvature regularities are well-known for providing strong priors in the continuity of edges, which have been applied to a wide range of applications in image processing and computer vision. However, these models are usually non-convex,…

Let $\mathcal{H}_d^{(t)}$ ($t \geq -d$, $t>-3$) be the reproducing kernel Hilbert space on the unit ball $\mathbb{B}_d$ with kernel \[ k(z,w) = \frac{1}{(1-\langle z, w \rangle)^{d+t+1}} . \] We prove that if an ideal $I \triangleleft…

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…

Image segmentation is a long-studied and important problem in image processing. Different solutions have been proposed, many of which follow the information theoretic paradigm. While these information theoretic segmentation methods often…

Image segmentation is a critical step in computer vision tasks constituting an essential issue for pattern recognition and visual interpretation. In this paper, we propose a new stopping criterion for the mean shift iterative algorithm by…

Recently, Blecher and Knopfmacher explored the notion of fixed points in integer partitions. Here, we distinguish partitions with a fixed point by which value is fixed and analyze the resulting triangle of integers. In particular, we…

We give a definition of partition C*-algebras: To any partition of a finite set, we assign algebraic relations for a matrix of generators of a universal C*-algebra. We then prove how certain relations may be deduced from others and we…