Related papers: Relationship between the 2n-points binary and (3n-…
In this paper, we adapt the two topological numbers, which have been proposed to efficiently characterize simple points in specific neighborhoods for 3D binary images, to the case of 2D binary images. Unlike the 3D case, we only use a…
Bundling crossings is a strategy which can enhance the readability of drawings. In this paper we consider good drawings, i.e., we require that any two edges have at most one common point which can be a common vertex or a crossing. Our main…
The paper describes a method for measuring the similarity and symmetry of an image annotated with bounding boxes indicating image objects. The latter representation became popular recently due to the rapid development of fast and efficient…
Using the method of equivariant moving frames, we present a procedure for constructing symmetry-preserving finite element methods for second-order ordinary differential equations. Using the method of lines, we then indicate how our…
This paper presents and analyses a new family of linear subdivision schemes to refine noisy data given on triangular meshes. The subdivision rules consist of locally fitting and evaluating a weighted least squares approximating first-degree…
This paper is concerned with the spectral characteristics of quaternionic positive definite functions on the real line. We generalize the Stone's theorem to the case of a right quaternionic linear one-parameter unitary group via two…
This paper extends the matrix based approach to the setting of multiple subdivision schemes studied in [Sauer 2012]. Multiple subdivision schemes, in contrast to stationary and non-stationary schemes, allow for level dependent subdivision…
In this paper we consider the binary similarity problem that consists in determining if two binary functions are similar only considering their compiled form. This problem is know to be crucial in several application scenarios, such as…
This paper gives some relating results for various concepts of convexity in metric spaces such as midpoint convexity, convex structure, uniform convexity and near-uniform convexity, Busemann curvature and its relation to convexity. Some…
In a quadruply imaged lens system the angular distribution of images around the lens center is completely described by three relative angles. We show empirically that in the 3D space of these angles, spanning 180 x 180 x 90 degrees, quads…
Recently, with the help of Parisi-Sourlas supersymmetry an intriguing relation was found expressing the four-point scalar conformal block of a (d-2)-dimensional CFT in terms of a five-term linear combination of blocks of a d-dimensional…
We present two graph drawing algorithms based on the recently defined "grand-Schnyder woods", which are a far-reaching generalization of the classical Schnyder woods. The first is a straight-line drawing algorithm for plane graphs with…
Since the Bin Packing Problem (BPP) is one of the main NP-hard problems, a lot of approximation algorithms have been suggested for it. It has been proven that the best algorithm for BPP has the approximation ratio of 3/2 and the time order…
The objective of ordinal embedding is to find a Euclidean representation of a set of abstract items, using only answers to triplet comparisons of the form "Is item $i$ closer to the item $j$ or item $k$?". In recent years, numerous…
Approximate Nearest Neighbour (ANN) search is a fundamental problem in information retrieval, underpinning large-scale applications in computer vision, natural language processing, and cross-modal search. Hashing-based methods provide an…
Combining the techniques of approximation algorithms and parameterized complexity has long been considered a promising research area, but relatively few results are currently known. In this paper we study the parameterized approximability…
Let $\mathscr{Q}(m,q)$ and $\mathscr{S}(m,q)$ be the sets of quadratic forms and symmetric bilinear forms on an $m$-dimensional vector space over $\mathbb{F}_q$, respectively. The orbits of $\mathscr{Q}(m,q)$ and $\mathscr{S}(m,q)$ under a…
Ordinal embedding aims at finding a low dimensional representation of objects from a set of constraints of the form "item $j$ is closer to item $i$ than item $k$". Typically, each object is mapped onto a point vector in a low dimensional…
Nonlinear parabolic equations are frequently encountered in applications and efficient approximating techniques for their solution are of great importance. In order to provide an effective scheme for the temporal approximation of such…
The use of high-dimensional features has become a normal practice in many computer vision applications. The large dimension of these features is a limiting factor upon the number of data points which may be effectively stored and processed,…