Beyond sparsity: the role of \(L_{1}\)-optimizer in pattern classification
From MaRDI portal
Publication:650959
DOI10.1016/j.patcog.2011.08.022zbMath1227.68102OpenAlexW1990319151WikidataQ59534062 ScholiaQ59534062MaRDI QIDQ650959
Jing-Yu 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
Related Items (13)
Fast approximate \(L_\infty\) minimization: speeding up robust regression ⋮ Linear reconstruction measure steered nearest neighbor classification framework ⋮ On group-wise \(\ell_p\) regularization: theory and efficient algorithms ⋮ The \(L_{2,1}\)-norm-based unsupervised optimal feature selection with applications to action recognition ⋮ Individualized learning for improving kernel Fisher discriminant analysis ⋮ A unified framework for the identification of a general class of multivariable nonlinear block‐structured systems ⋮ Sparse representation based multi-instance learning for breast ultrasound image classification ⋮ Orthogonal sparse linear discriminant analysis ⋮ Adaptive graph construction using data self-representativeness for pattern classification ⋮ Dual robust regression for pattern classification ⋮ Deep learning on image denoising: an overview ⋮ A neighborhood prior constrained collaborative representation for classification ⋮ \(\upsilon\)-support vector machine based on discriminant sparse neighborhood preserving embedding
Uses Software
Cites Work
- Unnamed Item
- Sparsity preserving projections with applications to face recognition
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- Atomic Decomposition by Basis Pursuit
- Morphological Component Analysis: An Adaptive Thresholding Strategy
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
- Learning Multiscale Sparse Representations for Image and Video Restoration
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Matching pursuits with time-frequency dictionaries
- Dense Error Correction Via $\ell^1$-Minimization
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Stable signal recovery from incomplete and inaccurate measurements
- Diagrams for centrally symmetric polytopes
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- Compressed sensing
This page was built for publication: Beyond sparsity: the role of \(L_{1}\)-optimizer in pattern classification
