The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Sensor Selection via Convex Optimization
Abstract
We consider the problem of choosing a set of k sensor measurements, from a set of m possible or potential sensor measurements, that minimizes the error in estimating some parameters. Solving this problem by evaluating the performance for each of the (mk) possible choices of sensor measurements is not practical unless m and k are small. In this paper, we describe a heuristic, based on convex optimization, for approximately solving this problem. Our heuristic gives a subset selection as well as a bound on the best performance that can be achieved by any selection of k sensor measurements. There is no guarantee that the gap between the performance of the chosen subset and the performance bound is always small; but numerical experiments suggest that the gap is small in many cases. Our heuristic method requires on the order ofm3operations; form= 1000 possible sensors, we can carry out sensor selection in a few seconds on a 2-GHz personal computer.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Self-citationRegression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Donoho, D. L. (2004) · Cited by 16,703
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
Fedorov, V. V., Studden, W. J., & Klimko, E. M. (1972) · Cited by 2,092
Branch-and-Bound Methods: A Survey
Lawler, E. L., & Wood, D. E. (1966) · Operations Research · doi:10.1287/opre.14.4.699 · Cited by 1,997
Theory of Optimal Experiments.
Herzberg, A. M., Wynn, H. P., Fedorov, V. V., Studden, W. J., & Klimko, E. M. (1972) · Biometrika · doi:10.2307/2334826 · Cited by 1,897
(1993) · Choice Reviews Online · doi:10.5860/choice.31-0986 · Cited by 1,540
Just relax: convex programming methods for identifying sparse signals in noise
Tropp, J. A. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.864420 · Cited by 1,407
Wireless Sensor Networks: An Information Processing Approach
Zhao, F., & Guibas, L. J. (2004) · Cited by 959
Sensor placement for on-orbit modal identification and correlation of large space structures
Kammer, D. C. (1991) · Journal of Guidance, Control, and Dynamics · doi:10.2514/3.20635 · Cited by 935
Information-driven dynamic sensor collaboration
Zhao, F., Shin, J., & Reich, J. (2002) · IEEE Signal Processing Magazine · doi:10.1109/79.985685 · Cited by 803
Wireless Sensor Networks: An Information Processing Approach
Mytum-Smithson, J. (2005) · Sensor Review · doi:10.1108/sr.2005.08725bae.001 · Cited by 686
Pukelsheim, F. (2006) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719109 · Cited by 684
Scalable Information-Driven Sensor Querying and Routing for Ad Hoc Heterogeneous Sensor Networks
Chu, M., Haussecker, H., & Zhao, F. (2002) · The International Journal of High Performance Computing Applications · doi:10.1177/10943420020160030901 · Cited by 634
Gupta, V., Chung, T. H., Hassibi, B., & Murray, R. M. (2006) · Automatica · doi:10.1016/j.automatica.2005.09.016 · Cited by 470
Near-optimal sensor placements in Gaussian processes
Guestrin, C., Krause, A., & Singh, A. P. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102385 · Cited by 454
Information-Driven Dynamic Sensor Collaboration for Tracking Applications
Zhao, F., Shin, J., & Reich, J. (2002) · Cited by 440
Data Fusion and Sensor Management: A Decentralized Information-Theoretic Approach
Manyika, J., & Durrant-Whyte, H. F. (1995) · Cited by 354
Portfolio optimization with linear and fixed transaction costs
Lobo, M. S., Fazel, M., & Boyd, S. (2007) · Annals of Operations Research · doi:10.1007/s10479-006-0145-1 · Cited by 350
Self-citationEntropy-based sensor selection heuristic for target localization
Wang, H., Yao, K., Pottie, G., & Estrin, D. (2004) · Proceedings of the 3rd international symposium on Information processing in sensor networks · doi:10.1145/984622.984628 · Cited by 310
D-Optimality for Regression Designs: A Review
John, R. C. S., & Draper, N. R. (1975) · Technometrics · doi:10.2307/1267995 · Cited by 279
Sensor placement for on-orbit modal identification via a genetic algorithm
Yao, L., Sethares, W. A., & Kammer, D. C. (1993) · AIAA Journal · doi:10.2514/3.11868 · Cited by 224
Computation of Minimum-Volume Covering Ellipsoids
Sun, P., & Freund, R. M. (2004) · Operations Research · doi:10.1287/opre.1040.0115 · Cited by 188
Multivariate Nonnegative Quadratic Mappings
Luo, Z.-Q. T., Sturm, J. F., & Zhang, S. (2004) · SIAM Journal on Optimization · doi:10.1137/s1052623403421498 · Cited by 184
Maximum Mutual Information Principle for Dynamic Sensor Query Problems
Ertin, E., Fisher, J. W., III, & Potter, L. (2003) · International Symposium on Information Processing in Sensor Networks · doi:10.1007/3-540-36978-3_27 · Cited by 177
A review of some exchange algorithms for constructing discrete D-optimal designs
Nguyen, N.-K., & Miller, A. J. (1992) · Computational Statistics & Data Analysis · doi:10.1016/0167-9473(92)90064-m · Cited by 162
Optimal sensor selection for discrete-event systems with partial observation
Jiang, S., Kumar, R., & Garcia, H. E. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.809144 · Cited by 118
On an Optimization Problem in Sensor Selection*
Debouk, R., Lafortune, S., & Teneketzis, D. (2002) · Discrete Event Dynamic Systems · doi:10.1023/a:1019770124060 · Cited by 98
Pukelsheim, F. (2006) · Society for Industrial and Applied Mathematics eBooks · Cited by 93
Optimal sensor selection strategy for discrete-time state estimators
Oshman, Y. (1994) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/7.272256 · Cited by 88
The sensor selection problem for bounded uncertainty sensing models
Isler, V., & Bajcsy, R. (2005) · Information Processing in Sensor Networks · doi:10.5555/1147685.1147714 · Cited by 77
The sensor selection problem for bounded uncertainty sensing models
Isler, V., & Bajcsy, R. K. (2005) · International Symposium on Information Processing in Sensor Networks (IPSN) · doi:10.1109/ipsn.2005.1440917 · Cited by 57
Optimal wire and transistor sizing for circuits with non-tree topology
Vandenberghe, L., Boyd, S., & Gamal, A. E. (1997) · doi:10.5555/266388.266485 · Cited by 27
Self-citationOptimal wire and transistor sizing for circuits with non-tree topology
Vandenberghe, Boyd, S., & Gamal, E. (1997) · International Conference on Computer Aided Design · doi:10.1109/iccad.1997.643528 · Cited by 27
Self-citation
Cited by
Data-Driven Science and Engineering: Machine Learning, Dynamical Systems, and Control
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690 · Cited by 1,154
Kim, S.-J., Koh, K., Boyd, S., & Gorinevsky, D. (2009) · SIAM Review · doi:10.1137/070690274 · Cited by 615
Self-citation(2018) · IEEE Control Systems · doi:10.1109/mcs.2018.2810460 · Cited by 518
Efficient Sampling Set Selection for Bandlimited Graph Signals Using Graph Spectral Proxies
Anis, A., Gadde, A., & Ortega, A. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2546233 · Cited by 336
Greedy sensor selection: Leveraging submodularity
Shamaiah, M., Banerjee, S., & Vikalo, H. (2010) · 49th IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2010.5717225 · Cited by 298
Metadata
- Authors
- Joshi, S., & Boyd, S.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2009-02
- Volume
- 57
- Issue
- 2
- Pages
- 451-462
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2169207653
- Cited by
- 1,311
- References
- 36
- FWCI
- 48.28
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.