Field inversion by consensus and compressed sensing
暂无分享,去创建一个
[1] Michael Elad,et al. Stable recovery of sparse overcomplete representations in the presence of noise , 2006, IEEE Transactions on Information Theory.
[2] Soummya Kar,et al. Sensor Networks With Random Links: Topology Design for Distributed Consensus , 2007, IEEE Transactions on Signal Processing.
[3] Stephen P. Boyd,et al. Fast linear iterations for distributed averaging , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).
[4] E. Candès,et al. Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.
[5] E.J. Candes. Compressive Sampling , 2022 .
[6] Soummya Kar,et al. Distributed Consensus Algorithms in Sensor Networks: Link Failures and Channel Noise , 2007, ArXiv.
[7] Yaakov Tsaig,et al. Extensions of compressed sensing , 2006, Signal Process..
[8] Reza Olfati-Saber,et al. Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.
[9] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[10] E.J. Candes,et al. An Introduction To Compressive Sampling , 2008, IEEE Signal Processing Magazine.
[11] Soummya Kar,et al. Distributed Sensor Localization in Random Environments Using Minimal Number of Anchor Nodes , 2008, IEEE Transactions on Signal Processing.
[12] Soummya Kar,et al. Topology for Distributed Inference on Graphs , 2006, IEEE Transactions on Signal Processing.
[13] Yaakov Tsaig,et al. Breakdown of equivalence between the minimal l1-norm solution and the sparsest solution , 2006, Signal Process..