arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1911.05862math.FA
收藏

有限阿贝尔群作用下的信号分类:有限维设置

Classifying Signals Under a Finite Abelian Group Action: The Finite Dimensional Setting

Jameson Cahill, Andres Contreras, Andres Contreras Hip

摘要:

设$G$是作用在$\mathbb{C}^N$上的有限群.我们研究的问题identifyng类在$\mathbb{C}^N / G$的一个给定的信号:这包括几种类型的问题,在信号处理。一些实例包括某些概括的相位检索,图像识别,纹理分析等,在我们以前的工作\cite{prev},基于代数方法,我们构建了一个Lipschitz平移不变变换-的情况下,当$G$是循环的。在这里,我们推广我们的结果,包括所有有限的阿贝尔群。此外,我们展示了一种新的变换的存在,该变换避免了计算信号条目的模的高功率-这可能是计算上的负担。新的变换不享受在我们早期的工作强加的代数结构,因此更灵活。探索了其他(甚至更低)维的表示,然而它们仅提供几乎处处(实际上是通用的)恢复,这对于应用来说不是显著的缺点。我们的构造是局部鲁棒的,并提供其他基于统计和神经网络的方法的替代方案。

英文摘要:

Let $G$ be a finite group acting on $\mathbb{C}^N$. We study the problem of identifyng the class in $\mathbb{C}^N / G$ of a given signal: this encompasses several types of problems in signal processing. Some instances include certain generalizations of phase retrieval, image recognition, the analysis of textures, etc. In our previous work \cite{prev}, based on an algebraic approach, we constructed a Lipschitz translation invariant transform -- the case when $G$ is cyclic. Here, we extend our results to include all finite Abelian groups. Moreover, we show the existence of a new transform that avoids computing high powers of the moduli of the signal entries--which can be computationally taxing. The new transform does not enjoy the algebraic structure imposed in our earlier work and is thus more flexible. Other (even lower) dimensional representations are explored, however they only provide an almost everywhere (actually generic) recovery which is not a significant drawback for applications. Our constructions are locally robust and provide alternatives to other statistical and neural networks based methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑