Identify Equivalent Frames

11/17/2019
by   Xuemei Chen, et al.
0

A frame is an overcomplete set that can represent vectors(signals) faithfully and stably. Two frames are equivalent if signals can be essentially represented in the same way, which means two frames differ by a permutation, sign change or orthogonal transformation. Since these operations are combinatorial in nature, it is infeasible to check whether two frames are equivalent by exhaustive search. In this note, we present an algorithm that can check this equivalence in polynomial time. Theoretical guarantees are provided for special cases.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

03/26/2020

Linearly Self-Equivalent APN Permutations in Small Dimension

All almost perfect nonlinear (APN) permutations that we know to date adm...
09/17/2021

A Note on Occur-Check

Most known results on avoiding the occur-check are based on the notion o...
01/20/2020

(p,q)-frames in shift-invariant subspaces of mixed Lebesgue spaces L^p,q(R×R^d)

In this paper, we mainly discuss the (p,q)-frame in shift-invariant subs...
07/16/2021

The equivalence of linear codes implies semi-linear equivalence

We prove that if two linear codes are equivalent then they are semi-line...
02/14/2021

A new search direction for full-Newton step infeasible interior-point method in linear optimization

In this paper, we study an infeasible interior-point method for linear o...
12/12/2021

Algorithmic Bayesian persuasion with combinatorial actions

Bayesian persuasion is a model for understanding strategic information r...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.