A Multiple Parameter Linear Scale-Space for one dimensional Signal Classification

05/22/2023
by   Leon A. Luxemburg, et al.
0

In this article we construct a maximal set of kernels for a multi-parameter linear scale-space that allow us to construct trees for classification and recognition of one-dimensional continuous signals similar the Gaussian linear scale-space approach. Fourier transform formulas are provided and used for quick and efficient computations. A number of useful properties of the maximal set of kernels are derived. We also strengthen and generalize some previous results on the classification of Gaussian kernels. Finally, a new topologically invariant method of constructing trees is introduced.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/25/2022

An approach to the Gaussian RBF kernels via Fock spaces

We use methods from the Fock space and Segal-Bargmann theories to prove ...
research
12/17/2020

Generalized gaussian bounds for discrete convolution powers

We prove a uniform generalized gaussian bound for the powers of a discre...
research
10/06/2022

Fast Automatic Bayesian Cubature Using Matching Kernels and Designs

Automatic cubatures approximate integrals to user-specified error tolera...
research
09/28/2021

Efficient Fourier representations of families of Gaussian processes

We introduce a class of algorithms for constructing Fourier representati...
research
05/12/2014

FastMMD: Ensemble of Circular Discrepancy for Efficient Two-Sample Test

The maximum mean discrepancy (MMD) is a recently proposed test statistic...
research
06/15/2023

Modules and PQ-trees in Robinson spaces

A Robinson space is a dissimilarity space (X,d) on n points for which th...
research
03/30/2020

Parallel Computation of tropical varieties, their positive part, and tropical Grassmannians

In this article, we present a massively parallel framework for computing...

Please sign up or login with your details

Forgot password? Click here to reset