Related papers: Pseudo P-points and splitting number
The crux of semi-supervised semantic segmentation is to assign adequate pseudo-labels to the pixels of unlabeled images. A common practice is to select the highly confident predictions as the pseudo ground-truth, but it leads to a problem…
If split supersymmetry can be advocated as a means to have gauge-coupling unification as well as dark matter, another plausible scenario is to enlarge judiciously the particle content of the Standard Model to achieve the same goals without…
A space is nearly pseudocompact if and only if $\upsilon X\backslash X$ is dense in $\beta X\backslash X$. If we denote $K=cl_{\beta X}(\upsilon X\backslash X)$, then $\delta X=X\cup(\beta X\backslash K)$ is referred by Henriksen and…
Particle splitting methods are considered for the estimation of rare events. The probability of interest is that a Markov process first enters a set $B$ before another set $A$, and it is assumed that this probability satisfies a large…
We construct a sequence of subset partition graphs satisfying the dimension reduction, adjacency, strong adjacency, and endpoint count properties whose diameter has a superlinear asymptotic lower bound. These abstractions of polytope graphs…
We present Polite Teacher, a simple yet effective method for the task of semi-supervised instance segmentation. The proposed architecture relies on the Teacher-Student mutual learning framework. To filter out noisy pseudo-labels, we use…
Semi-weakly supervised semantic segmentation (SWSSS) aims to train a model to identify objects in images based on a small number of images with pixel-level labels, and many more images with only image-level labels. Most existing SWSSS…
Medical ultrasound imaging is ubiquitous, but manual analysis struggles to keep pace. Automated segmentation can help but requires large labeled datasets, which are scarce. Semi-supervised learning leveraging both unlabeled and limited…
Robustly handling collisions between individual particles in a large particle-based simulation has been a challenging problem. We introduce particle merging-and-splitting, a simple scheme for robustly handling collisions between particles…
Existing pseudo label generation methods for point weakly supervised object detection are inadequate in low data volume and dense object detection tasks. We consider the generation of weakly supervised pseudo labels as the model's sparse…
In this paper we present a use of nonstandard methods in the theory of ultrafilters and in related applications to combinatorics of numbers.
Using the property of being completely Baire, countable dense homogeneity and the perfect set property we will be able, under Martin's Axiom for countable posets, to distinguish non-principal ultrafilters on $\omega$ up to homeomorphism.…
We construct a random $n$-hypergraph for every $n$, in a given pseudofinite field.
Superpixels are widely used in computer vision to simplify image representation and reduce computational complexity. While traditional methods rely on low-level features, deep learning-based approaches leverage high-level features but also…
$\renewcommand{\Re}{\mathbb{R}}$Given a set $P$ of $n$ points in $\Re^d$, consider the problem of computing $k$ subsets of $P$ that form clusters that are well-separated from each other, and each of them is large (cardinality wise). We…
We present a general form of the iteration and interpolation process used in implicit particle filters. Implicit filters are based on a pseudo-Gaussian representation of posterior densities, and are designed to focus the particle paths so…
Nonstandard analysis is very complex, so finding a simple description of infinitesimal points will be useful. In this paper, ultrafilters as infinitesimal points in a topological space will be proposed, and some topological concepts is…
Pseudo-Labeling is a simple and effective approach to semi-supervised learning. It requires criteria that guide the selection of pseudo-labeled data. The latter have been shown to crucially affect pseudo-labeling's generalization…
We continue the exploration of various aspects of divisibility of ultrafilters, adding one more relation to the picture: multiplicative finite embeddability. We show that it lies between divisibility relations $\mid_M$ and…
We survey some recent results about the order structure of various kinds of ultrafilters. More precisely, we study Rudin-Keisler and Tukey reducibility in classes of selective, stable ordered-union, and P-point ultrafilters. Although these…