Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

如何形式化压缩感知问题? #1

Open
FlyerMaxwell opened this issue Oct 9, 2019 · 0 comments
Open

如何形式化压缩感知问题? #1

FlyerMaxwell opened this issue Oct 9, 2019 · 0 comments

Comments

@FlyerMaxwell
Copy link

前辈你好,我们专业遇到大量可以抽象成信号的问题,但对于什么问题可以采用“压缩感知”进行处理一直不得法。从原理上要找基的变换,映射到一个稀疏的基表示。但实际过程中,往往卡在如何形式化一个压缩感知的问题,或者如何寻找其稀疏表示上。这方面应如何提高?

比如:一个平面上散落着不同的点,每一个点有N次机会广播,广播的半径可以由GPS时钟统一(可以以时间为种子随机改变)。因为广播半径相同,则每次广播节点均可知该次广播范围内的节点数量。
能否使用压缩感知的方式,推断出全局的节点分布?这个信号的稀疏表示应该如何形式化?

万分感谢!

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant