The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Quantized overcomplete expansions in IR/sup N/: analysis, synthesis, and algorithms
Open accessAbstract
Coefficient quantization has peculiar qualitative effects on representations of vectors in IR with respect to overcomplete sets of vectors. These effects are investigated in two settings: frame expansions (representations obtained by forming inner products with each element of the set) and matching pursuit expansions (approximations obtained by greedily forming linear combinations). In both cases, based on the concept of consistency, it is shown that traditional linear reconstruction methods are suboptimal, and better consistent reconstruction algorithms are given. The proposed consistent reconstruction algorithms were in each case implemented, and experimental results are included. For frame expansions, results are proven to bound distortion as a function of frame redundancy r and quantization step size for linear, consistent, and optimal reconstruction methods. Taken together, these suggest that optimal reconstruction methods will yield O(1/r/sup 2/) mean-squared error (MSE), and that consistency is sufficient to insure this asymptotic behavior. A result on the asymptotic tightness of random frames is also proven. Applicability of quantized matching pursuit to lossy vector compression is explored. Experiments demonstrate the likelihood that a linear reconstruction is inconsistent, the MSE reduction obtained with a nonlinear (consistent) reconstruction algorithm, and generally competitive performance at low bit rates.
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
Probability, Random Variables, and Stochastic Processes.
Abrahams, J., & Papoulis, A. (1984) · Journal of the American Statistical Association · doi:10.2307/2288754 · Cited by 16,226
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
Probability, Random Variables, and Stochastic Processes
Miller, I. (1966) · Technometrics · doi:10.1080/00401706.1966.10490365 · Cited by 8,452
Vector Quantization and Signal Compression
Gersho, A., & Gray, R. M. (1992) · Springer eBooks · doi:10.1007/978-1-4615-3626-0 · Cited by 7,003
The wavelet transform, time-frequency localization and signal analysis
Daubechies, I. (1990) · IEEE Transactions on Information Theory · doi:10.1109/18.57199 · Cited by 6,483
Sphere Packings, Lattices and Groups.
Coxeter, H. S. M., Conway, J. H., & Sloane, N. J. A. (1989) · The American Mathematical Monthly · doi:10.2307/2323992 · Cited by 3,377
Sparse Approximate Solutions to Linear Systems
Natarajan, B. K. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792240406 · Cited by 2,783
A class of nonharmonic Fourier series
Duffin, R. J., & Schaeffer, A. C. (1952) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1952-0047179-6 · Cited by 2,277
Sphere Packings, Lattices and Groups
Conway, J. H., & Sloane, N. J. A. (1988) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-1-4757-2016-7 · Cited by 1,532
Introduction to applied mathematics.
(1986) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(86)90036-4 · Cited by 1,495
Cited by
Method of optimal directions for frame design
Engan, K., Aase, S. O., & Hakon Husoy, J. (1999) · 1999 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings. ICASSP99 (Cat. No.99CH36258) · doi:10.1109/icassp.1999.760624 · Cited by 1,253
Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
Jacques, L., Laska, J. N., Boufounos, P. T., & Baraniuk, R. G. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2234823 · Cited by 653
The Undecimated Wavelet Decomposition and its Reconstruction
Starck, J.-L., Fadili, J., & Murtagh, F. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.887733 · Cited by 530
Designing structured tight frames via an alternating projection method
Tropp, J. A., Dhillon, I. S., Heath, R. W., & Strohmer, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839492 · Cited by 494
Normalized Iterative Hard Thresholding: Guaranteed Stability and Performance
Blumensath, T., & Davies, M. E. (2010) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2010.2042411 · Cited by 485
Blumensath, T., & Davies, M. E. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.916124 · Cited by 461
Finite Normalized Tight Frames
Benedetto, J. J., & Fickus, M. (2003) · Advances in Computational Mathematics · doi:10.1023/a:1021323312367 · Cited by 421
Analog Beamforming in MIMO Communications With Phase Shift Networks and Online Channel Estimation
Venkateswaran, V., & van der Veen, A.-J. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2048321 · Cited by 396
Foundations of Signal Processing
Vetterli, M., Kovačević, J., & Goyal, V. K. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139839099 · Cited by 393
Self-citationLife Beyond Bases: The Advent of Frames (Part I)
Kovacevic, J., & Chebira, A. (2007) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.4286567 · Cited by 341
Equal-Norm Tight Frames with Erasures
Casazza, P. G., & Kovačević, J. (2003) · Advances in Computational Mathematics · doi:10.1023/a:1021349819855 · Cited by 329
Frame-theoretic analysis of oversampled filter banks
Bolcskei, H., Hlawatsch, F., & Feichtinger, H. G. (1998) · IEEE Transactions on Signal Processing · doi:10.1109/78.735301 · Cited by 318
The redundant discrete wavelet transform and additive noise
Fowler, J. E. (2005) · IEEE Signal Processing Letters · doi:10.1109/lsp.2005.853048 · Cited by 316
Directional multiresolution image representations
Do, M. N. (2002) · doi:10.5075/epfl-thesis-2500 · Cited by 312
Do, M. N., & Vetterli, M. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.815389 · Cited by 267
Self-citationMulti-frame compression: theory and design
Engan, K., Aase, S. O., & Husøy, J. H. (2000) · Signal Processing · doi:10.1016/s0165-1684(00)00072-4 · Cited by 255
Compressive Sampling and Lossy Compression
Goyal, V. K., Fletcher, A. K., & Rangan, S. (2008) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.915001 · Cited by 252
Self-citation
Metadata
- Authors
- Goyal, V. K., Vetterli, M., & Thao, N. T.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1998
- Volume
- 44
- Issue
- 1
- Pages
- 16-31
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W1976318178
- Cited by
- 417
- References
- 18
- FWCI
- 13.84
- 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.