English
Related papers

Related papers: Generalized spiral transformation for high-resolut…

200 papers

We present a versatile formulation of the convolution operation that we term a "mapped convolution." The standard convolution operation implicitly samples the pixel grid and computes a weighted sum. Our mapped convolution decouples these…

Computer Vision and Pattern Recognition · Computer Science 2019-06-27 Marc Eder , True Price , Thanh Vu , Akash Bapat , Jan-Michael Frahm

We introduce an algorithm to solve linear inverse problems regularized with the total (gradient) variation in a gridless manner. Contrary to most existing methods, that produce an approximate solution which is piecewise constant on a fixed…

Signal Processing · Electrical Eng. & Systems 2025-07-08 Yohann de Castro , Vincent Duval , Romain Petit

The purpose of this note is to exhibit some simple and basic constructions for smooth compact transformation groups, and some of their most immediate applications to geometry.

Differential Geometry · Mathematics 2012-07-19 Karsten Grove , Catherine Searle

We introduce a new sorting device for permutations which makes use of a pop stack augmented with a bypass operation. This results in a sorting machine, which is more powerful than the usual Popstacksort algorithm and seems to have never…

Discrete Mathematics · Computer Science 2025-03-12 Lapo Cioni , Luca Ferrari , Rebecca Smith

We propose an algorithm for evolving spiral curves on a planar domain by normal velocities depending on the so-called crystalline curvatures. The algorithm uses a minimizing movement approach and relies on a special level set method for…

Numerical Analysis · Mathematics 2025-04-08 Takeshi Ohtsuka , Yen-Hsi Richard Tsai

This work extends the recently introduced Alpha-Procrustes family of Riemannian metrics for symmetric positive definite (SPD) matrices by incorporating generalized versions of the Bures-Wasserstein (GBW), Log-Euclidean, and Wasserstein…

Machine Learning · Statistics 2025-12-22 Salvish Goomanee , Andi Han , Pratik Jawanpuria , Bamdev Mishra

A theory of simultaneous resolution of singularities for families of embedded varieties (over a field of characteristic zero) parametrized by the spectrum of a suitable artinian ring, and compatible with a given algorithm of resolution, is…

Algebraic Geometry · Mathematics 2009-04-24 Augusto Nobile

We propose the first optimal geometric multigrid solver for hybrid high-order discretizations that can handle arbitrary polytopal agglomeration hierarchies in both two and three dimensions. The key ingredient is the use of modified skeleton…

Numerical Analysis · Mathematics 2026-03-03 Santiago Badia , Jordi Manyer

Vectorization of images is a key concern uniting computer graphics and computer vision communities. In this paper we are presenting a novel idea for efficient, customizable vectorization of raster images, based on Catmull Rom spline…

Computer Vision and Pattern Recognition · Computer Science 2014-03-05 Tolga Birdal , Emrah Bala

Fourier transforms are ubiquitous mathematical tools in basic and applied sciences. We here report classical and quantum optical realizations of the discrete fractional Fourier transform, a generalization of the Fourier transform. In the…

We describe new methods for the construction of spiral toolpaths for high-speed machining. In the simplest case, our method takes a polygon as input and a number $\delta>0$ and returns a spiral starting at a central point in the polygon,…

Computational Geometry · Computer Science 2015-01-21 Mikkel Abrahamsen

The affine Grassmannian is a noncompact smooth manifold that parameterizes all affine subspaces of a fixed dimension. It is a natural generalization of Euclidean space, points being zero-dimensional affine subspaces. We will realize the…

Methodology · Statistics 2018-06-26 Lek-Heng Lim , Ken Sze-Wai Wong , Ke Ye

Adaptive regularization methods pre-multiply a descent direction by a preconditioning matrix. Due to the large number of parameters of machine learning problems, full-matrix preconditioning methods are prohibitively expensive. We show how…

Machine Learning · Computer Science 2020-11-19 Naman Agarwal , Brian Bullins , Xinyi Chen , Elad Hazan , Karan Singh , Cyril Zhang , Yi Zhang

A basic problem in the theory of partially ordered vector spaces is to characterise those cones on which every order-isomorphism is linear. We show that this is the case for every Archimedean cone that equals the inf-sup hull of the sum of…

Functional Analysis · Mathematics 2023-11-27 Bas Lemmens , Hent van Imhoff , Onno van Gaans

We introduce a novel class of finite difference approximations, termed zigzag schemes, that employ a hybrid stencil that is neither symmetrical, nor fully one-sided. These zigzag schemes often enjoy more permissive stability constraints and…

Numerical Analysis · Mathematics 2025-05-26 Lorenzo Poggioni , Didier Clamond , Yves D'Angelo

The concept of sharpness has been successfully applied to traditional architectures like MLPs and CNNs to predict their generalization. For transformers, however, recent work reported weak correlation between flatness and generalization. We…

Machine Learning · Computer Science 2025-05-09 Marvin F. da Silva , Felix Dangel , Sageev Oore

This article is concerned with the metric study of a construction of G\'erardin of the action of the boundary at infinity of the space of norms on a non-Archimedean vector space, and its generalisation to graded algebras. Namely, given…

Algebraic Geometry · Mathematics 2026-03-04 Rémi Reboulet

We prove that the principal pivot transform (also known as the partial inverse, sweep operator, or exchange operator in various contexts) maps matrices with positive imaginary part to matrices with positive imaginary part. We show that the…

Functional Analysis · Mathematics 2021-08-16 J. E. Pascoe , Ryan Tully-Doyle

There has recently been renewed recognition of the need to understand the consistency properties that must be preserved when a generalized matrix inverse is required. The most widely known generalized inverse, the Moore-Penrose…

Numerical Analysis · Computer Science 2018-08-03 Jeffrey Uhlmann

Given a zero-dimensional ideal I in K[x1,...,xn] of degree D, the transformation of the ordering of its Groebner basis from DRL to LEX is a key step in polynomial system solving and turns out to be the bottleneck of the whole solving…

Symbolic Computation · Computer Science 2017-03-01 Jean-Charles Faugère , Chenqi Mou