arXiv research

L-CNNs approximate gauge actions, revealing fixed points with no lattice artifacts.

Concept Relation Discovery and Innovation Enabling Technology (CORDIET), is a toolbox for gaining new knowledge from unstructured text data. At the core of CORDIET is the C-K theory which captures the essential elements of innovation. The tool uses Formal Concept Analysis (FCA), Emergent Self Organizing Maps (ESOM) and…

Machine learning finds a compact fixed point action for SU(3) gauge theory.

Single CNN removes multiple ultrasound artifacts.

Study examines how image artifacts impact polyp detection and proposes methods to mitigate their effects.

New method corrects motion artifacts in MR images without paired data.

Electroencephalograms (EEG) are often contaminated by artifacts which make interpreting them more challenging for clinicians. Hence, automated artifact recognition systems have the potential to aid the clinical workflow. In this abstract, we share the first results on applying various machine learning algorithms to the…

Voice conversion (VC) aims at conversion of speaker characteristic without altering content. Due to training data limitations and modeling imperfections, it is difficult to achieve believable speaker mimicry without introducing processing artifacts; performance assessment of VC, therefore, usually involves both speaker…

Proposes a fixed smooth convolutional layer to reduce checkerboard artifacts in CNNs.

New simulation method tackles sign problem in quantum fields.

Study geodesic X-ray transform and streaking artifacts on simple surfaces or spaces of constant curvature.

Paper introduces adversarial lossy compression for video artifacts reduction.

A new unsupervised method removes CT metal artifacts using beta-CycleGAN and attention.

Single model corrects JPEG artifacts for various compression settings.

Accelerated magnetic resonance (MR) scan acquisition with compressed sensing (CS) and parallel imaging is a powerful method to reduce MR imaging scan time. However, many reconstruction algorithms have high computational costs. To address this, we investigate deep residual learning networks to remove aliasing artifacts …

Paper explores unsupervised learning for ultrasound image artifact removal.

Conebeam CT using a circular trajectory is quite often used for various applications due to its relative simple geometry. For conebeam geometry, Feldkamp, Davis and Kress algorithm is regarded as the standard reconstruction method, but this algorithm suffers from so-called conebeam artifacts as the cone angle increases…

Interpretation of electroencephalogram (EEG) signals can be complicated by obfuscating artifacts. Artifact detection plays an important role in the observation and analysis of EEG signals. Spatial information contained in the placement of the electrodes can be exploited to accurately detect artifacts. However, when few…

Generative model predicts menstrual cycle lengths accounting for self-tracking artifacts.

Estimates support in distributions with sampling artifacts and errors.

Recent work establishes dataset difficulty and removes annotation artifacts via partial-input baselines (e.g., hypothesis-only models for SNLI or question-only models for VQA). When a partial-input baseline gets high accuracy, a dataset is cheatable. However, the converse is not necessarily true: the failure of a parti…

New property identifies arithmetic lattices from nonuniform lattices.

Deep-learning improves 6x6-mm OCTA angiograms by reducing noise and artifacts.

Research finds bounds for knots in hexagonal lattice and classifies 11-stick knots.

We outline the theory of sets with distributive operations: multishelves and multispindles, with examples provided by semi-lattices, lattices and skew lattices. For every such a structure we define multi-term distributive homology and show some of its properties. The main result is a complete formula for the homology o…

This article deals with stability issues related to geodesic X-ray transforms, where an interplay between the (attenuation type) weight in the transform and the underlying geometry strongly impact whether the problem is stable or unstable. In the unstable case, we also explain what types of artifacts are expected in te…

Course on arithmetic lattices at EPFL.

We give a simple example showing that a knot or link diagram that lies in the ${\mathbb{Z}}^2$ lattice is not necessarily the projection of a lattice stick knot or link in the ${\mathbb{Z}}^3$ lattice, and we give a necessary and sufficient condition for when a knot or link diagram that lies in the ${\mathbb{Z}}^2$ lat…

In this article, we analyze the microlocal properties of the linearized forward scattering operator $F$ and the normal operator $F^{*}F$ (where $F^{*}$ is the $L^{2}$ adjoint of $F$) which arises in Synthetic Aperture Radar imaging for the common midpoint acquisition geometry. When $F^{*}$ is applied to the scattered d…

We consider linear models where $d$ potential causes $X_1,...,X_d$ are correlated with one target quantity $Y$ and propose a method to infer whether the association is causal or whether it is an artifact caused by overfitting or hidden common causes. We employ the idea that in the former case the vector of regression c…

New rigidity theorem for product of lattices.

We explore hybrid subgroups of certain non-arithmetic lattices in $\mathrm{PU}(2,1)$. We show that all of Mostow's lattices are virtually hybrids; moreover, we show that some of these non-arithmetic lattices are hybrids of two non-commensurable arithmetic lattices in $\mathrm{PU}(1,1)$.

This paper studies the covolumes of nonuniform arithmetic lattices in PU(n, 1). We determine the smallest covolume nonuniform arithmetic lattices for each n, the number of minimal covolume lattices for each n, and study the growth of the minimal covolume as n varies. In particular, there is a unique lattice (up to conj…

We study the integral transform over a general family of broken rays in $\mathbb{R}^2$. It is natural for broken rays to have conjugate points, for example, when they are reflected from a curved boundary. If there are conjugate points, we show that the singularities cannot be recovered from local data and therefore art…

The paper finds incommensurable lattices in complex models of Baumslag-Solitar groups.

Proves a lattice version of the Atiyah-Singer index theorem.

Sequence discriminative training criteria have long been a standard tool in automatic speech recognition for improving the performance of acoustic models over their maximum likelihood / cross entropy trained counterparts. While previously a lattice approximation of the search space has been necessary to reduce computat…

Vertex distortion measures how far lattice knots deviate from straight lines.

Regular integer lattices are characterized by k unit vectors that build up their generator matrices. These have rank k for D-lattices, and are rank-deficient for A-lattices, for E_6 and E_7. We count lattice points inside hypercubes centered at the origin for all three types, as if classified by maximum infinity norm i…

In this paper we use techniques from convex projective geometry to produce many new examples of thin subgroups of lattices in special linear groups that are isomorphic to the fundamental groups of finite volume hyperbolic manifolds. More specifically, we show that for a large class of arithmetic lattices in SO(n,1) it …

We show that the set of even positive definite lattices that arise from smooth, simply-connected 4-manifolds bounded by a fixed homology 3-sphere can depend on more than the ranks of the lattices. We provide two homology 3-spheres with distinct sets of such lattices, each containing a distinct nonempty subset of the ra…

The paper proves residual finiteness of certain lattices and constructs surfaces with specific fundamental groups.

A celebrated theorem of Hadwiger states that the Euler-Poincaré characteristic is the the unique invariant and continuous valuation on the distributive lattice of compact polyhedra in R^n that assigns value one to each convex non-empty such polyhedron. This paper provides an analogue of Hadwiger's result for finitely p…

The cubic lattice stick index of a knot type is the least number of sticks necessary to construct the knot type in the 3-dimensional cubic lattice. We present the cubic lattice stick index of various knots and links, including all (p,p+1)-torus knots, and show how composing and taking satellites can be used to obtain t…

New method finds lattice polygons that can be dissected into triangles with integer areas.

The paper refines transformations of lattice diagrams and introduces dotted diagrams.

Classifies knots by lattice size, finding unknot ratios and crossing numbers.

Let $G$ be a simply connected, solvable Lie group and $Γ$ a lattice in $G$. The deformation space $\mathcal{D}(Γ,G)$ is the orbit space associated to the action of $\Aut(G)$ on the space $\mathcal{X}(Γ,G)$ of all lattice embeddings of $Γ$ into $G$. Our main result generalises the classical rigidity theorems of Mal'tsev…