Translation-invariant interpolation of parametric dictionaries

11/29/2020
by   Frédéric Champagnat, et al.
0

In this communication, we address the problem of approximating the atoms of a parametric dictionary, commonly encountered in the context of sparse representations in "continuous" dictionaries. We focus on the case of translation-invariant dictionaries, where the inner product between atoms only depends on the difference between parameters. We investigate the following general question: is there some low-rank approximation of the dictionary which interpolates a subset of atoms while preserving the translation-invariant nature of the original dictionary? We derive necessary and sufficient conditions characterizing the existence of such an "interpolating" and "translation-invariant" low-rank approximation. Moreover, we provide closed-form expressions of such a dictionary when it exists. We illustrate the applicability of our results in the case of a two-dimensional isotropic Gaussian dictionary. We show that, in this particular setup, the proposed approximation framework outperforms standard Taylor approximation.

READ FULL TEXT

page 1

page 2

page 3

research
09/14/2020

Continuous dictionaries meet low-rank tensor approximations

In this short paper we bridge two seemingly unrelated sparse approximati...
research
12/10/2017

Identifiability of Kronecker-structured Dictionaries for Tensor Data

This paper derives sufficient conditions for reliable recovery of coordi...
research
01/05/2015

Group K-Means

We study how to learn multiple dictionaries from a dataset, and approxim...
research
09/08/2013

A Clustering Approach to Learn Sparsely-Used Overcomplete Dictionaries

We consider the problem of learning overcomplete dictionaries in the con...
research
11/01/2014

Entropy of Overcomplete Kernel Dictionaries

In signal analysis and synthesis, linear approximation theory considers ...
research
08/14/2022

Generic Go to Go: Dictionary-Passing, Monomorphisation, and Hybrid

Go is a popular statically-typed industrial programming language. To aid...
research
04/13/2018

On the Minimal Overcompleteness Allowing Universal Sparse Representation

Sparse representation over redundant dictionaries constitutes a good mod...

Please sign up or login with your details

Forgot password? Click here to reset