Reconciliation of Statistical and Spatial Sparsity For Robust Image and Image-Set Classification
Not on the map. Why?
Abstract (arXiv)
Recent image classification algorithms, by learning deep features from large-scale datasets, have achieved significantly better results comparing to the classic feature-based approaches. However, there are still various challenges of image classifications in practice, such as classifying noisy image or image-set queries and training deep image classification models over the limited-scale dataset. Instead of applying generic deep features, the model-based approaches can be more effective and data-efficient for robust image and image-set classification tasks, as various image priors are exploited for modeling the inter- and intra-set data variations while preventing over-fitting. In this work, we propose a novel Joint Statistical and Spatial Sparse representation, dubbed textitJ3S, to model the image or image-set data for classification, by reconciling both their local patch structures and global Gaussian distribution mapped into Riemannian manifold. To the best of our knowledge, no work to date utilized both global statistics and local patch structures jointly via joint sparse representation. We propose to solve the joint sparse coding problem based on the J3S model, by coupling the local and global image representations using joint sparsity. The learned J3S models are used for robust image and image-set classification. Experiments show that the proposed J3S-based image classification scheme outperforms the popular or state-of-the-art competing methods over FMD, UIUC, ETH-80 and YTC databases.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 9 of its 49 references that are in the map. First posted on arXiv 1 Jun 2021.
Builds on
9 of 49 references.
References · 9
- 2016Matching Networks for One Shot Learningcited by 2,246
- 2017Is Second-order Information Helpful for Large-scale Visual Recognition?cited by 44
- 2015Riemannian Dictionary Learning and Sparse Coding for Positive Definite Matricescited by 24
- 2014From Manifold to Manifold: Geometry-Aware Dimensionality Reduction for SPD Matricescited by 22
- 2013Dictionary Learning and Sparse Coding on Grassmann Manifolds: An Extrinsic Solutioncited by 13
- 2013Sparse Coding and Dictionary Learning for Symmetric Positive Definite Matrices: A Kernel Approachcited by 9
- 2015FRIST - Flipping and Rotation Invariant Sparsifying Transform Learning and Applicationscited by 7
- 2015ℓ0 Sparsifying Transform Learning with Efficient Optimal Updates and Convergence Guaranteescited by 6
- 2020A Set-Theoretic Study of the Relationships of Image Models and Priors for Restoration Problemscited by 2
Built on by
Not cited yet.