IEEE Transactions on Signal Processing, ISSN 1053-587X, 06/2008, Volume 56, Issue 6, pp. 2370 - 2382
Sparse signal approximations have become a fundamental tool in signal processing with wide-ranging applications from source separation to signal acquisition....
Gradient methods | Conjugate gradient optimization | Dictionaries | Source separation | Noise reduction | Matching pursuit algorithms | orthogonal matching pursuit (OMP) | Bayesian methods | Signal processing algorithms | Signal processing | Approximation algorithms | matching pursuit (MP) | sparse representations/approximations | gradient optimization | Pursuit algorithms | Matching pursuit (MP) | Sparse representations/approximations | Orthogonal matching pursuit OMP | Gradient optimization | MATCHING PURSUITS | conjugate gradient optimization | SPARSE | matching pursuit (NIP) | ENGINEERING, ELECTRICAL & ELECTRONIC | Fourier analysis | Research | Vector analysis | Matching theory | Analysis | Studies | Algorithms | Conjugate gradient method | Matching | Approximation | Conjugate gradients | Strategy | Optimization
Gradient methods | Conjugate gradient optimization | Dictionaries | Source separation | Noise reduction | Matching pursuit algorithms | orthogonal matching pursuit (OMP) | Bayesian methods | Signal processing algorithms | Signal processing | Approximation algorithms | matching pursuit (MP) | sparse representations/approximations | gradient optimization | Pursuit algorithms | Matching pursuit (MP) | Sparse representations/approximations | Orthogonal matching pursuit OMP | Gradient optimization | MATCHING PURSUITS | conjugate gradient optimization | SPARSE | matching pursuit (NIP) | ENGINEERING, ELECTRICAL & ELECTRONIC | Fourier analysis | Research | Vector analysis | Matching theory | Analysis | Studies | Algorithms | Conjugate gradient method | Matching | Approximation | Conjugate gradients | Strategy | Optimization
Journal Article
2.
Full Text
Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise
IEEE Transactions on Signal Processing, ISSN 1053-587X, 10/2010, Volume 58, Issue 10, pp. 5030 - 5043
We consider the problem of estimating a deterministic sparse vector x 0 from underdetermined measurements A x 0 + w, where w represents white Gaussian noise...
Algorithm design and analysis | sparse estimation | Dictionaries | oracle | Noise reduction | Matching pursuit algorithms | Basis pursuit | matching pursuit | Noise measurement | Dantzig selector | Computer science | Gaussian noise | Signal processing algorithms | Permission | Pursuit algorithms | thresholding algorithm | UNCERTAINTY RELATIONS | REPRESENTATIONS | STABLE RECOVERY | SIGNAL RECOVERY | ENGINEERING, ELECTRICAL & ELECTRONIC | L MINIMIZATION | PURSUIT | LASSO | Signal processing | Usage | Random noise theory | Distribution (Probability theory) | Innovations | Algorithms | Mathematical analysis | Coherence | Estimating | Gaussian | Vectors (mathematics) | Selectors
Algorithm design and analysis | sparse estimation | Dictionaries | oracle | Noise reduction | Matching pursuit algorithms | Basis pursuit | matching pursuit | Noise measurement | Dantzig selector | Computer science | Gaussian noise | Signal processing algorithms | Permission | Pursuit algorithms | thresholding algorithm | UNCERTAINTY RELATIONS | REPRESENTATIONS | STABLE RECOVERY | SIGNAL RECOVERY | ENGINEERING, ELECTRICAL & ELECTRONIC | L MINIMIZATION | PURSUIT | LASSO | Signal processing | Usage | Random noise theory | Distribution (Probability theory) | Innovations | Algorithms | Mathematical analysis | Coherence | Estimating | Gaussian | Vectors (mathematics) | Selectors
Journal Article
2008, ISBN 9780195324266, xiv, 295
Book
IEEE Transactions on Signal Processing, ISSN 1053-587X, 06/2010, Volume 58, Issue 6, pp. 3042 - 3054
We consider efficient methods for the recovery of block-sparse signals-i.e., sparse signals that have nonzero entries occurring in clusters-from an...
Wireless communication | Uncertainty | Matching pursuit algorithms | Clustering algorithms | Vectors | block-sparsity | Basis pursuit | matching pursuit | Sparse matrices | Pursuit algorithms | Equations | Compressed sensing | Block-sparsity | Matching pursuit | compressed sensing | REPRESENTATIONS | GROUP LASSO | UNION | PRINCIPLES | ENGINEERING, ELECTRICAL & ELECTRONIC | Signal processing | Usage | Mathematical optimization | Analysis | Algorithms | Blocking | Clusters | Constants | Complement | Recovery
Wireless communication | Uncertainty | Matching pursuit algorithms | Clustering algorithms | Vectors | block-sparsity | Basis pursuit | matching pursuit | Sparse matrices | Pursuit algorithms | Equations | Compressed sensing | Block-sparsity | Matching pursuit | compressed sensing | REPRESENTATIONS | GROUP LASSO | UNION | PRINCIPLES | ENGINEERING, ELECTRICAL & ELECTRONIC | Signal processing | Usage | Mathematical optimization | Analysis | Algorithms | Blocking | Clusters | Constants | Complement | Recovery
Journal Article
Asia Pacific Journal of Multidisciplinary Research, ISSN 2350-7756, 02/2019, Volume 7, Issue 1, pp. 114 - 124
This research aimed to determine the pursuits of full-time mothers in terms of family, career and their intellectual aspect. This provided information about...
career pursuits | family pursuits | intellectual pursuits
career pursuits | family pursuits | intellectual pursuits
Journal Article
IEEE Transactions on Signal Processing, ISSN 1053-587X, 11/2006, Volume 54, Issue 11, pp. 4311 - 4322
In recent years there has been a growing interest in the study of sparse representation of signals. Using an overcomplete dictionary that contains prototype...
Algorithm design and analysis | Dictionaries | Matching pursuit algorithms | training | matching pursuit | basis pursuit | gain-shape VQ | Atom decomposition | Inverse problems | dictionary | Clustering algorithms | Prototypes | FOCUSS | vector quantization | Feature extraction | Iterative algorithms | codebook | Pursuit algorithms | Signal design | sparse representation | K-means | Training | Dictionary | Codebook | Vector quantization | Matching pursuit | K-SVD | Sparse representation | Basis pursuit | Gain-shape VQ | BASES | ATOMIC DECOMPOSITION | IDENTIFICATION | ENGINEERING, ELECTRICAL & ELECTRONIC | MINIMIZATION | SELECTION | atom decomposition | Signal processing | Coding theory | Vector analysis | Analysis | Methods
Algorithm design and analysis | Dictionaries | Matching pursuit algorithms | training | matching pursuit | basis pursuit | gain-shape VQ | Atom decomposition | Inverse problems | dictionary | Clustering algorithms | Prototypes | FOCUSS | vector quantization | Feature extraction | Iterative algorithms | codebook | Pursuit algorithms | Signal design | sparse representation | K-means | Training | Dictionary | Codebook | Vector quantization | Matching pursuit | K-SVD | Sparse representation | Basis pursuit | Gain-shape VQ | BASES | ATOMIC DECOMPOSITION | IDENTIFICATION | ENGINEERING, ELECTRICAL & ELECTRONIC | MINIMIZATION | SELECTION | atom decomposition | Signal processing | Coding theory | Vector analysis | Analysis | Methods
Journal Article
2006, 4th ed., Contemporary neurology series, ISBN 9780195300901, Volume 70, x, 761
Book
IEEE Transactions on Signal Processing, ISSN 1053-587X, 03/2010, Volume 58, Issue 3, pp. 1708 - 1721
In this paper, we investigate various channel estimators that exploit channel sparsity in the time and/or Doppler domain for a multicarrier underwater acoustic...
Doppler spread | Underwater communication | MUSIC | Dictionaries | Array signal processing | OFDM | Matching pursuit algorithms | Basis pursuit | Delay | ESPRIT | ICI | orthogonal matching pursuit | Channel estimation | Attenuation | Underwater acoustics | Compressed sensing | Pursuit algorithms | Orthogonal matching pursuit | SIGNAL RECOVERY | ENGINEERING, ELECTRICAL & ELECTRONIC | Monte Carlo method | Usage | Doppler effect | Analysis | Algorithms | Spreads | Mathematical models | Detection | Compressed | Channels | Doppler
Doppler spread | Underwater communication | MUSIC | Dictionaries | Array signal processing | OFDM | Matching pursuit algorithms | Basis pursuit | Delay | ESPRIT | ICI | orthogonal matching pursuit | Channel estimation | Attenuation | Underwater acoustics | Compressed sensing | Pursuit algorithms | Orthogonal matching pursuit | SIGNAL RECOVERY | ENGINEERING, ELECTRICAL & ELECTRONIC | Monte Carlo method | Usage | Doppler effect | Analysis | Algorithms | Spreads | Mathematical models | Detection | Compressed | Channels | Doppler
Journal Article
IEEE Transactions on Signal Processing, ISSN 1053-587X, 12/2007, Volume 55, Issue 12, pp. 5695 - 5702
Compressed sensing (CS) offers a joint compression and sensing processes, based on the existence of a sparse representation of the treated signal and a set of...
Linear systems | optimized projections | Dictionaries | Error analysis | compressed sensing (CS) | Matching pursuit algorithms | mutual coherence | orthogonal matching pursuit (OMP) | Basis pursuit (BP) | sparse and redundant representations | Computer science | Signal processing | Iterative algorithms | Iterative methods | Compressed sensing | Pursuit algorithms | Orthogonal matching pursuit (OMP) | Sparse and redundant representations | Compressed sensing (CS) | Optimized projections | Mutual coherence | OFDM modulation | Optimization | basis pursuit (BP) | SPARSE | DICTIONARIES | ENGINEERING, ELECTRICAL & ELECTRONIC | Mathematical optimization | Data compression | Analysis | Functions, Orthogonal | Methods | Compressing | Projection | Representations | Detection | Compressed
Linear systems | optimized projections | Dictionaries | Error analysis | compressed sensing (CS) | Matching pursuit algorithms | mutual coherence | orthogonal matching pursuit (OMP) | Basis pursuit (BP) | sparse and redundant representations | Computer science | Signal processing | Iterative algorithms | Iterative methods | Compressed sensing | Pursuit algorithms | Orthogonal matching pursuit (OMP) | Sparse and redundant representations | Compressed sensing (CS) | Optimized projections | Mutual coherence | OFDM modulation | Optimization | basis pursuit (BP) | SPARSE | DICTIONARIES | ENGINEERING, ELECTRICAL & ELECTRONIC | Mathematical optimization | Data compression | Analysis | Functions, Orthogonal | Methods | Compressing | Projection | Representations | Detection | Compressed
Journal Article
1999, 3rd ed., Contemporary neurology series, ISBN 0195129733, Volume 55, x, 646
Book
IEEE Transactions on Information Theory, ISSN 0018-9448, 10/2004, Volume 50, Issue 10, pp. 2231 - 2242
This article presents new results on using a greedy algorithm, orthogonal matching pursuit (OMP), to solve the sparse approximation problem over redundant...
Greedy algorithms | Sufficient conditions | Dictionaries | Matching pursuit algorithms | Signal processing | Approximation algorithms | Linear programming | Iterative algorithms | Approximation methods | Iterative methods | algorithms | iterative methods | BASES | REPRESENTATION | COMPUTER SCIENCE, INFORMATION SYSTEMS | orthogonal matching pursuit (OMP) | linear programming | IDENTIFICATION | approximation methods | ENGINEERING, ELECTRICAL & ELECTRONIC | basis pursuit (BP) | PROJECTION PURSUIT REGRESSION | DICTIONARIES | PAIRS | Research | Information theory
Greedy algorithms | Sufficient conditions | Dictionaries | Matching pursuit algorithms | Signal processing | Approximation algorithms | Linear programming | Iterative algorithms | Approximation methods | Iterative methods | algorithms | iterative methods | BASES | REPRESENTATION | COMPUTER SCIENCE, INFORMATION SYSTEMS | orthogonal matching pursuit (OMP) | linear programming | IDENTIFICATION | approximation methods | ENGINEERING, ELECTRICAL & ELECTRONIC | basis pursuit (BP) | PROJECTION PURSUIT REGRESSION | DICTIONARIES | PAIRS | Research | Information theory
Journal Article
1995, ISBN 0815193599, xviii, 902
Book
IEEE Transactions on Signal Processing, ISSN 1053-587X, 12/2006, Volume 54, Issue 12, pp. 4634 - 4643
The sparse representation of a multiple-measurement vector (MMV) is a relatively new problem in sparse representation. Efficient methods have been proposed....
Greedy algorithms | Dictionaries | Computational modeling | Matching pursuit algorithms | Predictive models | orthogonal matching pursuit (OMP) | Magnetic analysis | Basis pursuit | Sparse matrices | Equations | Analytical models | multiple-measurement vector (MMV) | Computational efficiency | sparse representation | Orthogonal matching pursuit (OMP) | Sparse representation | Multiple-measurement vector (MMV) | BASES | APPROXIMATION | ALGORITHMS | basis pursuit | ENGINEERING, ELECTRICAL & ELECTRONIC | DECOMPOSITIONS | RECOVERY | PURSUIT | UNCERTAINTY PRINCIPLES | MATRICES | SELECTION | ENTRIES | Signal processing | Vector spaces | Analysis | Functions, Orthogonal | Methods | Studies | Mathematical analysis | Criteria | Matrix theory | Representations | Vectors (mathematics) | Joints
Greedy algorithms | Dictionaries | Computational modeling | Matching pursuit algorithms | Predictive models | orthogonal matching pursuit (OMP) | Magnetic analysis | Basis pursuit | Sparse matrices | Equations | Analytical models | multiple-measurement vector (MMV) | Computational efficiency | sparse representation | Orthogonal matching pursuit (OMP) | Sparse representation | Multiple-measurement vector (MMV) | BASES | APPROXIMATION | ALGORITHMS | basis pursuit | ENGINEERING, ELECTRICAL & ELECTRONIC | DECOMPOSITIONS | RECOVERY | PURSUIT | UNCERTAINTY PRINCIPLES | MATRICES | SELECTION | ENTRIES | Signal processing | Vector spaces | Analysis | Functions, Orthogonal | Methods | Studies | Mathematical analysis | Criteria | Matrix theory | Representations | Vectors (mathematics) | Joints
Journal Article
IEEE Transactions on Information Theory, ISSN 0018-9448, 01/2006, Volume 52, Issue 1, pp. 6 - 18
Overcomplete representations are attracting interest in signal processing theory, particularly due to their potential to generate sparse representations of...
stepwise regression | Dictionaries | Stability | Matching pursuit algorithms | Vectors | Noise generators | Basis pursuit | matching pursuit | Signal representations | overcomplete representation | Noise level | Kruskal rank | Signal processing algorithms | Linear algebra | superresolution | Signal processing | incoherent dictionary | greedy approximation | sparse representation | Stepwise regression | Greedy approximation | Superresolution | Incoherent dictionary | Matching pursuit | Sparse representation | Overcomplete representation | BASES | APPROXIMATION | RECONSTRUCTION | ATOMIC DECOMPOSITION | COMPUTER SCIENCE, INFORMATION SYSTEMS | basis pursuit | ARRAYS | ENGINEERING, ELECTRICAL & ELECTRONIC | GREEDY ALGORITHMS | PURSUIT | FRAMES | BOUNDS | stability | DICTIONARIES | Data communications | Models | Analysis | Methods | Algorithms | Approximation | Noise | Mathematical analysis | Representations | Combinatorial analysis | Optimization
stepwise regression | Dictionaries | Stability | Matching pursuit algorithms | Vectors | Noise generators | Basis pursuit | matching pursuit | Signal representations | overcomplete representation | Noise level | Kruskal rank | Signal processing algorithms | Linear algebra | superresolution | Signal processing | incoherent dictionary | greedy approximation | sparse representation | Stepwise regression | Greedy approximation | Superresolution | Incoherent dictionary | Matching pursuit | Sparse representation | Overcomplete representation | BASES | APPROXIMATION | RECONSTRUCTION | ATOMIC DECOMPOSITION | COMPUTER SCIENCE, INFORMATION SYSTEMS | basis pursuit | ARRAYS | ENGINEERING, ELECTRICAL & ELECTRONIC | GREEDY ALGORITHMS | PURSUIT | FRAMES | BOUNDS | stability | DICTIONARIES | Data communications | Models | Analysis | Methods | Algorithms | Approximation | Noise | Mathematical analysis | Representations | Combinatorial analysis | Optimization
Journal Article
1989, ISBN 9780721626284, 228
Book
IEEE Transactions on Information Theory, ISSN 0018-9448, 2008, Volume 54, Issue 11, pp. 4789 - 4812
Journal Article
IEEE Transactions on Information Theory, ISSN 0018-9448, 05/2008, Volume 54, Issue 5, pp. 2210 - 2219
This paper extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown...
Greedy algorithms | random matrix | Spectroscopy | Dictionaries | thresholding | Matching pursuit algorithms | Linear programming | Basis pursuit (BP) | Decoding | Sparse matrices | restricted isometry constants | orthogonal matching pursuit | redundant dictionary | Signal processing algorithms | sparse approximation | Nuclear magnetic resonance | Compressed sensing | Orthogonal matching pursuit | Restricted isometry constants | Random matrix | Sparse approximation | Thresholding | Redundant dictionary | compressed sensing | basis pursuit (BP) | SIGNAL RECOVERY | COMPUTER SCIENCE, INFORMATION SYSTEMS | SYSTEMS | ENGINEERING, ELECTRICAL & ELECTRONIC | Signal processing | Image coding | Analysis | Threshold (Perception) | Reconstruction | Algorithms | Back propagation | Redundant | Constants | Detection | Compressed
Greedy algorithms | random matrix | Spectroscopy | Dictionaries | thresholding | Matching pursuit algorithms | Linear programming | Basis pursuit (BP) | Decoding | Sparse matrices | restricted isometry constants | orthogonal matching pursuit | redundant dictionary | Signal processing algorithms | sparse approximation | Nuclear magnetic resonance | Compressed sensing | Orthogonal matching pursuit | Restricted isometry constants | Random matrix | Sparse approximation | Thresholding | Redundant dictionary | compressed sensing | basis pursuit (BP) | SIGNAL RECOVERY | COMPUTER SCIENCE, INFORMATION SYSTEMS | SYSTEMS | ENGINEERING, ELECTRICAL & ELECTRONIC | Signal processing | Image coding | Analysis | Threshold (Perception) | Reconstruction | Algorithms | Back propagation | Redundant | Constants | Detection | Compressed
Journal Article
1985, 1 v. (various pagings)
Book
1963, 4Th ed., Field training guide, 1, 39
Book
IEEE Transactions on Signal Processing, ISSN 1053-587X, 11/2009, Volume 57, Issue 11, pp. 4333 - 4346
Finding sparse solutions to underdetermined inverse problems is a fundamental challenge encountered in a wide range of signal processing applications, from...
Greedy algorithms | Source separation | gradient pursuit | Computational modeling | Noise reduction | Matching pursuit algorithms | stagewise selection | weak matching pursuit | Sparse matrices | orthogonal matching pursuit | Inverse problems | Bayesian methods | Signal processing algorithms | Signal processing | sparse representations/approximations | Compressed sensing | Orthogonal matching pursuit | Sparse representations/approximations | Weak matching pursuit | Stagewise selection | Gradient pursuit | SPARSE REPRESENTATIONS | RECOVERY | MATCHING PURSUITS | RECONSTRUCTION | CONVERGENCE | ENGINEERING, ELECTRICAL & ELECTRONIC | Bayesian statistical decision theory | Monte Carlo method | Usage | Analysis | Research | Computational complexity | Conjugates | Computer simulation | Strategy | Convergence | Marketing
Greedy algorithms | Source separation | gradient pursuit | Computational modeling | Noise reduction | Matching pursuit algorithms | stagewise selection | weak matching pursuit | Sparse matrices | orthogonal matching pursuit | Inverse problems | Bayesian methods | Signal processing algorithms | Signal processing | sparse representations/approximations | Compressed sensing | Orthogonal matching pursuit | Sparse representations/approximations | Weak matching pursuit | Stagewise selection | Gradient pursuit | SPARSE REPRESENTATIONS | RECOVERY | MATCHING PURSUITS | RECONSTRUCTION | CONVERGENCE | ENGINEERING, ELECTRICAL & ELECTRONIC | Bayesian statistical decision theory | Monte Carlo method | Usage | Analysis | Research | Computational complexity | Conjugates | Computer simulation | Strategy | Convergence | Marketing
Journal Article
No results were found for your search.
Cannot display more than 1000 results, please narrow the terms of your search.