Related papers: Consistent digital line segments
We develop an adaptive-metric framework for norm-minimization-based outer approximation algorithms in bounded convex vector optimization. The key idea is to let the scalarization metric vary across iterations while measuring approximation…
We propose a new protocol of \textit{universal} entanglement concentration, which converts many copies of an \textit{unknown} pure state to an \textit{% exact} maximally entangled state. The yield of the protocol, which is outputted as a…
In this paper we provide a rigorous mathematical foundation for continuous approximations of a class of systems with piece-wise continuous functions. By using techniques from the theory of differential inclusions, the underlying piece-wise…
We extend Yosida's 1941 version of Stone-Gelfand duality to metrically complete unital lattice-ordered groups that are no longer required to be real vector spaces. This calls for a generalised notion of compact Hausdorff space whose points…
Nested graphs have been used in different applications, for example to represent knowledge in semantic networks. On the other hand, graphs with cycles are really important in surface reconstruction, periodic schedule and network analysis.…
The paper introduces a new finite element numerical method for the solution of partial differential equations on evolving domains. The approach uses a completely Eulerian description of the domain motion. The physical domain is embedded in…
We examine a unique construction of the real numbers which proceeds directly from the integers using approximately linear-endomorphisms with finite error, called near-endomorphisms. In this paper, we show that the set of near-endomorphisms…
Assuming that a reflected Ornstein-Uhlenbeck state process is observed at discrete time instants, we propose generalized moment estimators to estimate all drift and diffusion parameters via the celebrated ergodic theorem. With the sampling…
The evolution of image halftoning, from its analog roots to contemporary digital methodologies, encapsulates a fascinating journey marked by technological advancements and creative innovations. Yet the theoretical understanding of…
The domain-independent universal Normalized Information Distance based on Kolmogorov complexity has been (in approximate form) successfully applied to a variety of difficult clustering problems. In this paper we investigate theoretical…
The binary radix expansion of a real number can be used to code the outcome of any series of coin tosses, a fact that provides an intriguing link between number theory, measure theory and statistical physics. Inspired by this fact, a…
We prove that for every $d\geq 3$ the homomorphism order of the class of line graphs of finite graphs with maximal degree $d$ is universal. This means that every finite or countably infinite partially ordered set may be represented by line…
In this paper, we present a linear-time approximation scheme for $k$-means clustering of \emph{incomplete} data points in $d$-dimensional Euclidean space. An \emph{incomplete} data point with $\Delta>0$ unspecified entries is represented as…
In the effort to aid cytologic diagnostics by establishing automatic single cell screening using high throughput digital holographic microscopy for clinical studies thousands of images and millions of cells are captured. The bottleneck lies…
This paper introduces a nonconforming virtual element method for general second-order elliptic problems with variable coefficients on domains with curved boundaries and curved internal interfaces. We prove arbitrary order optimal…
Text line segmentation is one of the pre-stages of modern optical character recognition systems. The algorithmic approach proposed by this paper has been designed for this exact purpose. Its main characteristic is the combination of two…
Building on classical aspects of the theory of Diophantine approximation, we consider the collection of all accumulation points of normalized integer vector translates of points $q\alpha$ with $\alpha\in\mathbb{R}^d$ and $q\in\mathbb{Z}$.…
This paper rigorously solves the challenging problem of recognizing periodic patterns under rigid motion in Euclidean geometry. The 3-dimensional case is practically important for justifying the novelty of solid crystalline materials…
Line segmentation from handwritten text images is one of the challenging task due to diversity and unknown variations as undefined spaces, styles, orientations, stroke heights, overlapping, and alignments. Though abundant researches, there…
A unified framework to derive optimized compact schemes for a uniform grid is presented. The optimal scheme coefficients are determined analytically by solving an optimization problem to minimize the spectral error subject to equality…