Learning with \ell ^{1}-graph for image analysis
From MaRDI portal
Publication:5366297
DOI10.1109/TIP.2009.2038764zbMATH Open1371.68229DBLPjournals/tip/ChengYYFH10OpenAlexW1904464160WikidataQ45963227 ScholiaQ45963227MaRDI QIDQ5366297FDOQ5366297
Authors: Bin Cheng, Jianchao Yang, Shuicheng Yan, Yun Fu, Thomas S. Huang
Publication date: 9 October 2017
Published in: IEEE Transactions on Image Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tip.2009.2038764
Learning and adaptive systems in artificial intelligence (68T05) Image analysis in multivariate analysis (62H35)
Cited In (36)
- Learning a discriminant graph-based embedding with feature selection for image categorization
- Embedding tangent space extreme learning machine for EEG decoding in brain computer interface systems
- Discriminant sparse neighborhood preserving embedding for face recognition
- Adaptive multiple graph regularized semi-supervised extreme learning machine
- Semi-supervised classification based on low rank representation
- Constructing \(L_1\)-graphs for subspace learning via recurrent neural networks
- Semi-supervised double sparse graphs based discriminant analysis for dimensionality reduction
- Lagrangian relaxation graph matching
- Robust subspace clustering based on automatic weighted multiple kernel learning
- Variants of k-regular nearest neighbor graph and their construction
- Manifold adaptive kernelized low-rank representation for semisupervised image classification
- Enhanced low-rank representation via sparse manifold adaption for semi-supervised learning
- Robust subspace segmentation via nonconvex low rank representation
- Adaptive graph construction using data self-representativeness for pattern classification
- Low-rank affinity based local-driven multilabel propagation
- A classification-oriented dictionary learning model: explicitly learning the particularity and commonality across categories
- Fast and robust face recognition via coding residual map learning based adaptive masking
- Multiview sample classification algorithm based on L1-graph domain adaptation learning
- Face recognition using double sparse local Fisher discriminant analysis
- An image segmentation method based on network clustering model
- Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms
- Graph-based semi-supervised learning via improving the quality of the graph dynamically
- Noise-robust semi-supervised learning via fast sparse coding
- An overview of computational sparse models and their applications in artificial intelligence
- Robust classifier using distance-based representation with square weights
- Similarity preserving low-rank representation for enhanced data representation and effective subspace learning
- Regularized coplanar discriminant analysis for dimensionality reduction
- Efficient dynamic graph construction for inductive semi-supervised learning
- Subspace clustering using a low-rank constrained autoencoder
- Kernel truncated regression representation for robust subspace clustering
- Convolutional Networks Can Learn to Generate Affinity Graphs for Image Segmentation
- Multi-source adaptation joint kernel sparse representation for visual classification
- Supervised neighborhood graph construction for semi-supervised classification
- Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensing
- Subspace learning by \(\ell^0\)-induced sparsity
- Linear regression based projections for dimensionality reduction
This page was built for publication: Learning with $\ell ^{1}$-graph for image analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5366297)