The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
Source Localization and Sensing: A Nonparametric Iterative Adaptive Approach Based on Weighted Least Squares
Open accessAbstract
Array processing is widely used in sensing applications for estimating the locations and waveforms of the sources in a given field. In the absence of a large number of snapshots, which is the case in numerous practical applications, such as underwater array processing, it becomes challenging to estimate the source parameters accurately. This paper presents a nonparametric and hyperparameter, free-weighted, least squares-based iterative adaptive approach for amplitude and phase estimation (IAA-APES) in array processing. IAA-APES can work well with few snapshots (even one), uncorrelated, partially correlated, and coherent sources, and arbitrary array geometries. IAA-APES is extended to give sparse results via a model-order selection tool, the Bayesian information criterion (BIC). Moreover, it is shown that further improvements in resolution and accuracy can be achieved by applying the parametric relaxation-based cyclic approach (RELAX) to refine the IAA-APES&BIC estimates if desired. IAA-APES can also be applied to active sensing applications, including single-input single-output (SISO) radar/sonar range-Doppler imaging and multi-input single-output (MISO) channel estimation for communications. Simulation results are presented to evaluate the performance of IAA-APES for all of these applications, and IAA-APES is shown to outperform a number of existing approaches.
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
Regression 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
Estimating the Dimension of a Model
Schwarz, G. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344136 · Cited by 47,033
A Simplex Method for Function Minimization
Nelder, J. A., & Mead, R. (1965) · The Computer Journal · doi:10.1093/comjnl/7.4.308 · Cited by 28,905
(2007) · Electronics: A First Course · doi:10.4324/9780080477527-64 · Cited by 24,923
Multiple emitter location and signal parameter estimation
Schmidt, R. (1986) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.1986.1143830 · Cited by 14,718 · cited 1×
“The well-known standard Capon beamformer (SCB) [2] and multiple signal classification (MUSIC) [3, 4] methods provide superresolution when the sources are uncorrelated and the number of snapshots is high.”
YALMIP : a toolbox for modeling and optimization in MATLAB
Lofberg, J. (2005) · 2004 IEEE International Conference on Robotics and Automation (IEEE Cat. No.04CH37508) · doi:10.1109/cacsd.2004.1393890 · Cited by 9,149
Matching pursuits with time-frequency dictionaries
Mallat, S. G., & Zhang, Z. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.258082 · Cited by 9,112
Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
Lagarias, J. C., Reeds, J. A., Wright, M. H., & Wright, P. E. (1998) · SIAM Journal on Optimization · doi:10.1137/s1052623496303470 · Cited by 7,447
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
High-resolution frequency-wavenumber spectrum analysis
Capon, J. (1969) · Proceedings of the IEEE · doi:10.1109/proc.1969.7278 · Cited by 6,374
Optimum Array Processing: Part IV of Detection, Estimation, and Modulation Theory
Van Trees, H. L. (2002) · Wiley eBooks · doi:10.1002/0471221104 · Cited by 5,188
Regression Shrinkage and Selection via The Lasso: A Retrospective
Tibshirani, R. (2011) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2011.00771.x · Cited by 3,589
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
Donoho, D. L., & Elad, M. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0437847100 · Cited by 2,898
Spectral Analysis of Signals: The Missing Data Case
Wang, Y., Li, J., & Stoica, P. (2005) · Synthesis Lectures on Signal Processing · doi:10.1007/978-3-031-02525-9 · Cited by 2,890
Self-citationMUSIC, maximum likelihood, and Cramer-Rao bound
Stoica, P., & Nehorai, A. (1989) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/29.17564 · Cited by 2,820
Self-citationSparse Approximate Solutions to Linear Systems
Natarajan, B. K. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792240406 · Cited by 2,783
Pursley, M. B. (2002) · Reference Data for Engineers · doi:10.1016/b978-075067291-7/50026-1 · Cited by 2,779
A sparse signal reconstruction perspective for source localization with sensor arrays
Malioutov, D., Cetin, M., & Willsky, A. S. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.850882 · Cited by 2,638 · cited 2×
“The complexity of `1-SVD, on the other hand, is O(K3K3 svd) [25], where Ksvd is the estimate of the number of sources.”
Estimation with Quadratic Loss
James, W., & Stein, C. (1992) · Springer Series in Statistics · doi:10.1007/978-1-4612-0919-5_30 · Cited by 2,252
Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm
Gorodnitsky, I. F., & Rao, B. D. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.558475 · Cited by 1,834
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/15324430152748236 · Cited by 1,819
Sparse Bayesian Learning for Basis Selection
Wipf, D. P., & Rao, B. D. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.831016 · Cited by 1,559 · cited 11×
“A Bayesian approach, such as sparse Bayesian learning (SBL) [19, 20] or the approach in [21], can also be used to estimate s.”
MethodInfluentialOn robust Capon beamforming and diagonal loading
Li, J., Stoica, P., & Wang, Z. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.812831 · Cited by 1,439
Self-citationJust 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
Sparse solutions to linear inverse problems with multiple measurement vectors
Cotter, S. F., Rao, B. D., Engan, K., & Kreutz-Delgado, K. (2005) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2005.849172 · Cited by 1,393
Stoica, P., & Selen, Y. (2004) · IEEE Signal Processing Magazine · doi:10.1109/msp.2004.1311138 · Cited by 1,358
Self-citationAn Empirical Bayesian Strategy for Solving the Simultaneous Sparse Approximation Problem
Wipf, D. P., & Rao, B. D. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.894265 · Cited by 911
Recent advances in high-speed underwater acoustic communications
Stojanovic, M. (1996) · IEEE Journal of Oceanic Engineering · doi:10.1109/48.486787 · Cited by 749
Sparse channel estimation via matching pursuit with application to equalization
Cotter, S. F., & Rao, B. D. (2002) · IEEE Transactions on Communications · doi:10.1109/26.990897 · Cited by 671
On Sparse Representations in Arbitrary Redundant Bases
Fuchs, J.-J. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.828141 · Cited by 563
Efficient mixed-spectrum estimation with applications to target feature extraction
Li, J., & Stoica, P. (1996) · IEEE Transactions on Signal Processing · doi:10.1109/78.485924 · Cited by 546
Self-citationAdaptive sparseness for supervised learning
Figueiredo, M. A. T. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1227989 · Cited by 536
Swindlehurst, A. L., & Kailath, T. (1992) · IEEE Transactions on Signal Processing · doi:10.1109/78.143447 · Cited by 475
Interpolation and extrapolation using a high-resolution discrete Fourier transform
Sacchi, M. D., Ulrych, T. J., & Walker, C. J. (1998) · IEEE Transactions on Signal Processing · doi:10.1109/78.651165 · Cited by 353
Recovery of Exact Sparse Representations in the Presence of Bounded Noise
Fuchs, J. J. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.855614 · Cited by 314
Estimation of a Covariance Matrix under Stein's Loss
Dey, D. K., & Srinivasan, C. (1985) · The Annals of Statistics · doi:10.1214/aos/1176349756 · Cited by 253
On the application of the global matched filter to DOA estimation with uniform circular arrays
Fuchs, J.-J. (2001) · IEEE Transactions on Signal Processing · doi:10.1109/78.912914 · Cited by 195
Forward sequential algorithms for best basis selection
Cotter, S. F., Rao, B. D., Kreutz-Delgado, K., & Adler, J. (1999) · IEE Proceedings - Vision Image and Signal Processing · doi:10.1049/ip-vis:19990445 · Cited by 152
Sparse equalization for real-time digital underwater acoustic communications
Kocic, M., Brady, D. J., & Stojanovic, M. (2002) · MTS/IEEE OCEANS Conference (OCEANS) · doi:10.1109/oceans.1995.528671 · Cited by 151
Signal reconstruction in sensor arrays using sparse representations
Model, D., & Zibulevsky, M. (2005) · Signal Processing · doi:10.1016/j.sigpro.2005.05.033 · Cited by 89
A 'best' mismatched filter response for radar clutter discrimination
Stutt, C., & Spafford, L. (1968) · IEEE Transactions on Information Theory · doi:10.1109/tit.1968.1054119 · Cited by 83
Linear programming in spectral estimation. Application to array processing
Fuchs, J. (2002) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1996.550547 · Cited by 49
Sparse inverse solution methods for signal and image processing applications
Jeffs, B. D. (2002) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1998.681832 · Cited by 46
Convergence of a Sparse Representations Algorithm Applicable to Real or Complex Data
Fuchs, J. J. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.909363 · Cited by 40
Cited by
MIMO Radar for Advanced Driver-Assistance Systems and Autonomous Driving: Advantages and Challenges
Sun, S., Petropulu, A. P., & Poor, H. V. (2020) · IEEE Signal Processing Magazine · doi:10.1109/msp.2020.2978507 · Cited by 632
SPICE: A Sparse Covariance-Based Estimation Method for Array Processing
Stoica, P., Babu, P., & Li, J. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2090525 · Cited by 614
Self-citationSparsity-based DOA estimation using co-prime arrays
Zhang, Y. D., Amin, M. G., & Himed, B. (2013) · 2013 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2013.6638403 · Cited by 384
On Gridless Sparse Methods for Line Spectral Estimation From Complete and Incomplete Data
Yang, Z., & Xie, L. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2420541 · Cited by 352
Sparse methods for direction-of-arrival estimation
Yang, Z., Li, J., Stoica, P., & Xie, L. (2018) · Academic Press Library in Signal Processing, Volume 7 · doi:10.1016/b978-0-12-811887-0.00011-0 · Cited by 332
Self-citation
Metadata
- Authors
- Yardibi, T., Li, J., Stoica, P., Xue, M., & Baggeroer, A. B.
- Venue
- IEEE Transactions on Aerospace and Electronic Systems
- Published
- 2010-01
- Volume
- 46
- Issue
- 1
- Pages
- 425-443
- ISSN
- 0018-9251 (ISSN-L)
- OpenAlex
- W2112855412
- Cited by
- 699
- References
- 44
- FWCI
- 55.06
- Type
- journal article
- Language
- en
- Open access
- green
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.