Related papers: Verifying an algorithm computing Discrete Vector F…
This paper shows how to reduce the computational cost for a variety of common machine vision tasks by operating directly in the compressed domain, particularly in the context of hardware acceleration. Pyramid Vector Quantization (PVQ) is…
We present the results of computation of cohomology for some Lie (super)algebras of Hamiltonian vector fields and related algebras. At present, the full cohomology rings for these algebras are not known even for the low dimensional vector…
Common programming tools, like compilers, debuggers, and IDEs, crucially rely on the ability to analyse program code to reason about its behaviour and properties. There has been a great deal of work on verifying compilers and static…
This paper proposes an efficient probabilistic method that computes combinatorial gradient fields for two dimensional image data. In contrast to existing algorithms, this approach yields a geometric Morse-Smale complex that converges almost…
Complex vector light modes with a spatial variant polarization distribution have become topical of late, enabling the development of novel applications in numerous research fields. Key to this is the remarkable similarities they hold with…
This work is a part of an ongoing effort to prove the correctness of invertibility conditions for the theory of fixed-width bit-vectors, which are used to solve quantified bit-vector formulas in the Satisfiability Modulo Theories (SMT)…
Persistent homology, an algebraic method for discerning structure in abstract data, relies on the construction of a sequence of nested topological spaces known as a filtration. Two-parameter persistent homology allows the analysis of data…
Machine learning methods based on statistical principles have proven highly successful in dealing with a wide variety of data analysis and analytics tasks. Traditional data models are mostly concerned with independent identically…
Expressive static typing disciplines are a powerful way to achieve high-quality software. However, the adoption cost of such techniques should not be under-estimated. Just like gradual typing allows for a smooth transition from…
We investigate when a computable automorphism of a computable field can be effectively extended to a computable automorphism of its (computable) algebraic closure. We then apply our results and techniques to study effective embeddings of…
We present new, explicit, volume-preserving vector fields for polynomial divergence-free vector fields of arbitrary degree (both positive and negative). The main idea is to decompose the divergence polynomial by means of an appropriate…
Vectors fields defined on surfaces constitute relevant and useful representations but are rarely used. One reason might be that comparing vector fields across two surfaces of the same genus is not trivial: it requires to transport the…
Given a triangulated region in the complex plane, a discrete vector field $Y$ assigns a vector $Y_i\in \mathbb{C}$ to every vertex. We call such a vector field holomorphic if it defines an infinitesimal deformation of the triangulation that…
The combination of persistent homology and discrete Morse theory has proven very effective in visualizing and analyzing big and heterogeneous data. Indeed, topology provides computable and coarse summaries of data independently from…
Estimating a 6DOF object pose from a single image is very challenging due to occlusions or textureless appearances. Vector-field based keypoint voting has demonstrated its effectiveness and superiority on tackling those issues. However,…
We describe an embedding of the QWIRE quantum circuit language in the Coq proof assistant. This allows programmers to write quantum circuits using high-level abstractions and to prove properties of those circuits using Coq's theorem proving…
In recent years, a number of lightweight programs have been deployed in critical domains, such as in smart contracts based on blockchain technology. Therefore, the security and reliability of such programs should be guaranteed by the most…
We show in this text how the most important homology equivalences of fundamental Algebraic Topology can be obtained as reductions associated to discrete vector fields. Mainly the homology equivalences whose existence -- most often…
Complex vectorial light fields, non-separable in their polarization and spatial degree of freedom, are of relevance in a wide variety of fields encompassing microscopy, metrology, communication and topological studies. Controversially, they…
This article introduces an algorithm to compute the persistent homology of a filtered complex with various coefficient fields in a single matrix reduction. The algorithm is output-sensitive in the total number of distinct persistent…