Beyond sparsity: the role of L₁-optimizer in pattern classification
From MaRDI portal
Publication:650959
DOI10.1016/J.PATCOG.2011.08.022zbMATH Open1227.68102DBLPjournals/pr/YangZXY12OpenAlexW1990319151WikidataQ59534062 ScholiaQ59534062MaRDI QIDQ650959FDOQ650959
Jingyu Yang, Yong Xu, Lei Zhang, Jian Yang
Publication date: 7 December 2011
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2011.08.022
Recommendations
- A fast sparse representation based classification
- A fast \(\ell_1\)-solver and its applications to robust face recognition
- Locality-sensitive dictionary learning for sparse representation based classification
- Robust classifier using distance-based representation with square weights
- Image classification using kernel collaborative representation with regularized least square
Cites Work
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Title not available (Why is that?)
- Matching pursuits with time-frequency dictionaries
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- Dense Error Correction Via $\ell^1$-Minimization
- Stable signal recovery from incomplete and inaccurate measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Compressed sensing
- Diagrams for centrally symmetric polytopes
- Atomic decomposition by basis pursuit
- Learning Multiscale Sparse Representations for Image and Video Restoration
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- Sparsity preserving projections with applications to face recognition
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- Morphological Component Analysis: An Adaptive Thresholding Strategy
Cited In (13)
- \(\upsilon\)-support vector machine based on discriminant sparse neighborhood preserving embedding
- Fast approximate \(L_\infty\) minimization: speeding up robust regression
- The \(L_{2,1}\)-norm-based unsupervised optimal feature selection with applications to action recognition
- A neighborhood prior constrained collaborative representation for classification
- Adaptive graph construction using data self-representativeness for pattern classification
- On group-wise \(\ell_p\) regularization: theory and efficient algorithms
- Dual robust regression for pattern classification
- Deep learning on image denoising: an overview
- Orthogonal sparse linear discriminant analysis
- Linear reconstruction measure steered nearest neighbor classification framework
- A unified framework for the identification of a general class of multivariable nonlinear block‐structured systems
- Individualized learning for improving kernel Fisher discriminant analysis
- Sparse representation based multi-instance learning for breast ultrasound image classification
Uses Software
This page was built for publication: Beyond sparsity: the role of \(L_{1}\)-optimizer in pattern classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650959)
