Learning with $\ell ^{1}$-graph for image analysis
From MaRDI portal
Publication:5366297
DOI10.1109/TIP.2009.2038764zbMath1371.68229OpenAlexW1904464160WikidataQ45963227 ScholiaQ45963227MaRDI QIDQ5366297
Shuicheng Yan, Yun Fu, Jianchao Yang, Thomas S. Huang, Bin Cheng
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
Image analysis in multivariate analysis (62H35) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (35)
Variants of k-regular nearest neighbor graph and their construction ⋮ Embedding tangent space extreme learning machine for EEG decoding in brain computer interface systems ⋮ An image segmentation method based on network clustering model ⋮ Manifold adaptive kernelized low-rank representation for semisupervised image classification ⋮ Robust classifier using distance-based representation with square weights ⋮ Multiview sample classification algorithm based on L1-graph domain adaptation learning ⋮ Face recognition using double sparse local Fisher discriminant analysis ⋮ Enhanced low-rank representation via sparse manifold adaption for semi-supervised learning ⋮ Robust subspace segmentation via nonconvex low rank representation ⋮ Kernel truncated regression representation for robust subspace clustering ⋮ Noise-robust semi-supervised learning via fast sparse coding ⋮ Beyond linear subspace clustering: a comparative study of nonlinear manifold clustering algorithms ⋮ Learning a discriminant graph-based embedding with feature selection for image categorization ⋮ Multi-source adaptation joint kernel sparse representation for visual classification ⋮ Robust subspace clustering based on automatic weighted multiple kernel learning ⋮ Discriminant sparse neighborhood preserving embedding for face recognition ⋮ Subspace learning by \(\ell^0\)-induced sparsity ⋮ Fast and robust face recognition via coding residual map learning based adaptive masking ⋮ A classification-oriented dictionary learning model: explicitly learning the particularity and commonality across categories ⋮ Linear regression based projections for dimensionality reduction ⋮ Low-rank affinity based local-driven multilabel propagation ⋮ Supervised neighborhood graph construction for semi-supervised classification ⋮ Semi-supervised classification based on low rank representation ⋮ Incomplete variables truncated conjugate gradient method for signal reconstruction in compressed sensing ⋮ Adaptive graph construction using data self-representativeness for pattern classification ⋮ Lagrangian relaxation graph matching ⋮ Semi-supervised double sparse graphs based discriminant analysis for dimensionality reduction ⋮ Regularized coplanar discriminant analysis for dimensionality reduction ⋮ Adaptive multiple graph regularized semi-supervised extreme learning machine ⋮ Efficient dynamic graph construction for inductive semi-supervised learning ⋮ Graph-based semi-supervised learning via improving the quality of the graph dynamically ⋮ Subspace clustering using a low-rank constrained autoencoder ⋮ Constructing \(L_1\)-graphs for subspace learning via recurrent neural networks ⋮ Similarity preserving low-rank representation for enhanced data representation and effective subspace learning ⋮ An Overview of Computational Sparse Models and Their Applications in Artificial Intelligence
This page was built for publication: Learning with $\ell ^{1}$-graph for image analysis
