Sparse sensor selection for distributed systems: an l1-relaxation approach
We study the problem of sensor selection for distributed systems, where a large number of sensors are located spatially in many different locations. Specifically, we consider both perfect and packet-dropping communication channels. While the original problem is NP-hard, by adopting a sparse design,...
Saved in:
Main Authors: | Zhong, Yuxing, Yang, Nachuan, Huang, Lingying, Shi, Guodong, Shi, Ling |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Article |
Language: | English |
Published: |
2024
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/179227 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Representative Selection with Structured Sparsity
by: Wang, Hongxing, et al.
Published: (2017) -
Sparse algorithms are not stable: A no-free-lunch theorem
by: Xu, H., et al.
Published: (2014) -
Sparse kernel canonical correlation analysis
by: Chu, D., et al.
Published: (2014) -
Large-scale online feature selection for ultra-high dimensional sparse data
by: WU, Yue, et al.
Published: (2017) -
SPARSITY BASED REGULARIZATION FOR SIGNAL RECOVERY AND CLUSTERING
by: XU GUODONG
Published: (2018)