The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
An affine scaling methodology for best basis selection
Abstract
A methodology is developed to derive algorithms for optimal basis selection by minimizing diversity measures proposed by Wickerhauser (1994) and Donoho (1994). These measures include the p-norm-like (l/sub (p/spl les/1)/) diversity measures and the Gaussian and Shannon entropies. The algorithm development methodology uses a factored representation for the gradient and involves successive relaxation of the Lagrangian necessary condition. This yields algorithms that are intimately related to the affine scaling transformation (AST) based methods commonly employed by the interior point approach to nonlinear optimization. The algorithms minimizing the (l/sub (p/spl les/1)/) diversity measures are equivalent to a previously developed class of algorithms called focal underdetermined system solver (FOCUSS). The general nature of the methodology provides a systematic approach for deriving this class of algorithms and a natural mechanism for extending them. It also facilitates a better understanding of the convergence behavior and a strengthening of the convergence results. The Gaussian entropy minimization algorithm is shown to be equivalent to a well-behaved p=0 norm-like optimization algorithm. Computer experiments demonstrate that the p-norm-like and the Gaussian entropy algorithms perform well, converging to sparse solutions. The Shannon entropy algorithm produces solutions that are concentrated but are shown to not converge to a fully sparse solution.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Daubechies, I. (1992) · doi:10.1137/1.9781611970104 · Cited by 15,979
Daubechies, I., & Heil, C. (1992) · Computers in Physics · doi:10.1063/1.4823127 · Cited by 15,631
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
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
Nonlinear programming: theory and algorithms
(1993) · Computers & Operations Research · doi:10.1016/0305-0548(93)90042-h · Cited by 5,779
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (2001) · SIAM Review · doi:10.1137/s003614450037906x · Cited by 5,085
Linear and nonlinear programming.
(1986) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(86)90092-3 · Cited by 4,805
Pati, Y. C., Rezaiifar, R., & Krishnaprasad, P. S. (2002) · Proceedings of 27th Asilomar Conference on Signals, Systems and Computers · doi:10.1109/acssc.1993.342465 · Cited by 4,323
Strang, G., & Nguyen, T. Q. (1996) · Cited by 4,180
Levary, R. R. (1982) · European Journal of Operational Research · doi:10.1016/0377-2217(82)90093-5 · Cited by 4,158
Entropy-based algorithms for best basis selection
Coifman, R. R., & Wickerhauser, M. V. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.119732 · Cited by 3,188
Vetterli, M., & Kovačević, J. (1995) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 2,898
Sparse Approximate Solutions to Linear Systems
Natarajan, B. K. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792240406 · Cited by 2,783
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
Self-citationAdapted wavelet analysis from theory to software
Wickerhauser, M. V. (1994) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,204
Linear and nonlinear programming
Sydsæter, K., Strøm, A., & Berck, P. (1999) · Economists’ Mathematical Manual · doi:10.1007/978-3-662-03995-3_15 · Cited by 864
Linear and Non Linear Programming
Nash, S. G. (1996) · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno · Cited by 841
Linear and nonlinear programming
(2005) · Economists’ Mathematical Manual · doi:10.1007/3-540-28518-0_15 · Cited by 766
Neuromagnetic source imaging with FOCUSS: a recursive weighted minimum norm algorithm
Gorodnitsky, I. F., George, J. S., & Rao, B. D. (1995) · Electroencephalography and Clinical Neurophysiology · doi:10.1016/0013-4694(95)00107-a · Cited by 567
Self-citationChen, S., & Donoho, D. L. (1994) · Cited by 467
Wavelets and time-frequency analysis
Hess-Nielsen, N., & Wickerhauser, M. V. (1996) · Proceedings of the IEEE · doi:10.1109/5.488698 · Cited by 211
Feature Selection via Mathematical Programming
Bradley, P. S., Mangasarian, O. L., & Street, W. N. (1998) · INFORMS Journal on Computing · doi:10.1287/ijoc.10.2.209 · Cited by 208
Fast orthogonal least squares algorithm for efficient subset model selection
Chen, S., & Wigger, J. (1995) · IEEE Transactions on Signal Processing · doi:10.1109/78.398734 · Cited by 131
Wavelets, subband coding, and best bases
Ramchandran, K., Vetterli, M., & Herley, C. (1996) · Proceedings of the IEEE · doi:10.1109/5.488699 · Cited by 128
Extrapolation and spectral estimation with iterative weighted norm modification
Cabrera, S. D., & Parks, T. W. (1991) · IEEE Transactions on Signal Processing · doi:10.1109/78.80906 · Cited by 105
A Globally Convergent Method for $l_p $ Problems
Li, Y. (1993) · SIAM Journal on Optimization · doi:10.1137/0803030 · Cited by 53
Restoration of blurred star field images by maximally sparse optimization
Jeffs, B. D., & Gunsay, M. (1993) · IEEE Transactions on Image Processing · doi:10.1109/83.217223 · Cited by 38
Improvement of discrete band-limited signal extrapolation by iterative subspace modification
Lee, H., Sullivan, D., & Huang, T. S. (2005) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1987.1169486 · Cited by 28
A recursive weighted minimum norm algorithm: Analysis and applications
Gorodnitsky, I. F., & Rao, B. D. (1993) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1993.319533 · Cited by 20
Self-citationSparse approximate multiquadric interpolation
Carlson, R. E., & Natarajan, B. K. (1994) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(94)90114-7 · Cited by 19
Convergence analysis of a class of adaptive weighted norm extrapolation algorithms
Gorodnitsky, I. F., & Rao, B. D. (2002) · 2018 52nd Asilomar Conference on Signals, Systems, and Computers · doi:10.1109/acssc.1993.342530 · Cited by 4
Self-citation
Cited by
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
Tropp, J. A., & Gilbert, A. C. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.909108 · Cited by 9,653
$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
Aharon, M., Elad, M., & Bruckstein, A. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.881199 · Cited by 9,451
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
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Bruckstein, A. M., Donoho, D. L., & Elad, M. (2009) · SIAM Review · doi:10.1137/060657704 · Cited by 2,183
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
Self-citation
Metadata
- Authors
- Rao, B. D., & Kreutz-Delgado, K.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 1999
- Volume
- 47
- Issue
- 1
- Pages
- 187-200
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2143163931
- Cited by
- 526
- References
- 32
- FWCI
- 8.06
- 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.