Pith. sign in

REVIEW 2 cited by

Building Deep Networks on Grassmann Manifolds

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1611.05742 v3 pith:DCWNW6O5 submitted 2016-11-17 cs.CV

classification cs.CV
keywords grassmannlayersmanifoldsdeepgrassmannianlearningnetworksachieve
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Learning representations on Grassmann manifolds is popular in quite a few visual recognition tasks. In order to enable deep learning on Grassmann manifolds, this paper proposes a deep network architecture by generalizing the Euclidean network paradigm to Grassmann manifolds. In particular, we design full rank mapping layers to transform input Grassmannian data to more desirable ones, exploit re-orthonormalization layers to normalize the resulting matrices, study projection pooling layers to reduce the model complexity in the Grassmannian context, and devise projection mapping layers to respect Grassmannian geometry and meanwhile achieve Euclidean forms for regular output layers. To train the Grassmann networks, we exploit a stochastic gradient descent setting on manifolds of the connection weights, and study a matrix generalization of backpropagation to update the structured data. The evaluations on three visual recognition tasks show that our Grassmann networks have clear advantages over existing Grassmann learning methods, and achieve results comparable with state-of-the-art approaches.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Riemannian batch normalization for SPD neural networks

    cs.LG 2019-09 conditional novelty 7.0 of 10

    A Riemannian batch normalization layer for SPD neural networks, using barycenter centering and learned bias, improves classification accuracy and robustness to scarce data.

  2. Permutation-invariant Feature Restructuring for Correlation-aware Image Set-based Recognition

    cs.CV 2019-08 conditional novelty 6.0 of 10

    An image set recognition framework that uses residual self-attention and sparse/collaborative dictionary reconstruction, and is provably permutation-invariant, achieves top scores on IJB-A, Celebrity-1000, and iLIDS-VID.

Pith tools