Related papers: Pseudocovering and digital covering spaces
Surveillance and surveying are two important applications of empirical research. A major part of terrain modelling is supported by photographic surveys which are used for capturing expansive natural surfaces using a wide range of sensors --…
Decomposition of digital signals and images into other basis or dictionaries than time or space domains is a very common approach in signal and image processing and analysis. Such a decomposition is commonly obtained using fixed transforms…
Sparse representation of real-life images is a very effective approach in imaging applications, such as denoising. In recent years, with the growth of computing power, data-driven strategies exploiting the redundancy within patches…
The KC property, a separation axiom between weakly Hausdorff and Hausdorff, requires compact subsets to be closed. Various assumptions involving local conditions, dimension, connectivity, and homotopy show certain KC-spaces are in fact…
We study embedding a subset $K$ of the unit sphere to the Hamming cube $\{-1,+1\}^m$. We characterize the tradeoff between distortion and sample complexity $m$ in terms of the Gaussian width $\omega(K)$ of the set. For subspaces and several…
Linear-programming pseudocodewords play a pivotal role in our understanding of the linear-programming decoding algorithms. These pseudocodewords are known to be equivalent to the graph-cover pseudocodewords. The latter pseudocodewords, when…
We show that if a cubic hypersurface with positive dual defect over the complex number field is not a cone, then either the hypersurface coincides with the secant variety of the singular locus, or the hypersurface contains a linear…
Let $V$ be any vector space of multivariate degree-$d$ homogeneous polynomials with co-dimension at most $k$, and $S$ be the set of points where all polynomials in $V$ {\em nearly} vanish. We establish a qualitatively optimal upper bound on…
This paper proposes a novel approach to image deblurring and digital zooming using sparse local models of image appearance. These models, where small image patches are represented as linear combinations of a few elements drawn from some…
We display four approximation theorems for manifold-valued mappings. The first one approximates holomorphic embeddings on pseudoconvex domains in $\Bbb C^n$ with holomorphic embeddings with dense images. The second theorem approximates…
Lindel\"of spaces are studied in any basic Topology course. However, there are other interesting covering properties with similar behaviour, such as almost Lindel\"of, weakly Lindel\"of, and quasi-Lindel\"of, that have been considered in…
A Tychonoff space $X$ is called $\kappa$-pseudocompact if for every continuous mapping $f$ of $X$ into $\mathbb{R}^\kappa$ the image $f(X)$ is compact. This notion generalizes pseudocompactness and gives a stratification of spaces lying…
We define LCL decompositions of the plane and investigate the advantages of using such decompositions in the context of digital topology. We show that discretization schemes based on such decompositions associate, to each LCL tiling of the…
In this paper, we study two classic optimization problems: minimum geometric dominating set and set cover. In the dominating-set problem, for a given set of objects in {the} plane as input, the objective is to choose a minimum number of…
Semi-supervised learning (SSL) uses unlabeled data to compensate for the scarcity of annotated images and the lack of method generalization to unseen domains, two usual problems in medical segmentation tasks. In this work, we propose…
Prior methodologies have disregarded the diversities among distinct degradation types during image reconstruction, employing a uniform network model to handle multiple deteriorations. Nevertheless, we discover that prevalent degradation…
In this paper, we investigate the geometry of compact spacelike biconservative hypersurfaces with constant scalar curvature in de Sitter space $\mathbb{S}_1^{m+1}(c)$, under some geometric constraints. Our results extend the understanding…
Cloaking using complementary media was suggested by Lai et al. in [8]. The study of this problem faces two difficulties. Firstly, this problem is unstable since the equations describing the phenomenon have sign changing coefficients, hence…
The analysis of several algorithms and data structures can be framed as a peeling process on a random hypergraph: vertices with degree less than k are removed until there are no vertices of degree less than k left. The remaining hypergraph…
The traditional way of tackling discrete optimization problems is by using local search on suitably defined cost or fitness landscapes. Such approaches are however limited by the slowing down that occurs when the local minima that are a…