Table of Contents
Fetching ...

A Novel Riemannian Sparse Representation Learning Network for Polarimetric SAR Image Classification

Junfei Shi, Mengmeng Nie, Weisi Lin, Haiyan Jin, Junhuai Li, Rui Wang

TL;DR

This work tackles the challenge that PolSAR covariance matrices are Hermitian positive definite and lie on a Riemannian manifold, making Euclidean DL misrepresent matrix geometry. It introduces a sparse representation guided network (SRSR_CNN) that directly processes HPD matrices through a superpixel-based Riemannian sparse representation (SRSR), an unfolded SRSRNet for learned sparse codes and dictionary atoms, and a CNN-enhanced module for contextual features. The approach yields superior classification performance across three PolSAR datasets, with ablations confirming the benefit of integrating geometric sparse representations, network unfolding, and high-level CNN features. The method offers a principled, interpretable framework for PolSAR image classification that preserves matrix geometry and improves edge detail and region homogeneity, with potential impact on remote sensing analytics and related domains.

Abstract

Deep learning is an effective end-to-end method for Polarimetric Synthetic Aperture Radar(PolSAR) image classification, but it lacks the guidance of related mathematical principle and is essentially a black-box model. In addition, existing deep models learn features in Euclidean space, where PolSAR complex matrix is commonly converted into a complex-valued vector as the network input, distorting matrix structure and channel relationship. However, the complex covariance matrix is Hermitian positive definite (HPD), and resides on a Riemannian manifold instead of a Euclidean one. Existing methods cannot measure the geometric distance of HPD matrices and easily cause some misclassifications due to inappropriate Euclidean measures. To address these issues, we propose a novel Riemannian Sparse Representation Learning Network (SRSR CNN) for PolSAR images. Firstly, a superpixel-based Riemannian Sparse Representation (SRSR) model is designed to learn the sparse features with Riemannian metric. Then, the optimization procedure of the SRSR model is inferred and further unfolded into an SRSRnet, which can automatically learn the sparse coefficients and dictionary atoms. Furthermore, to learn contextual high-level features, a CNN-enhanced module is added to improve classification performance. The proposed network is a Sparse Representation (SR) guided deep learning model, which can directly utilize the covariance matrix as the network input, and utilize Riemannian metric to learn geometric structure and sparse features of complex matrices in Riemannian space. Experiments on three real PolSAR datasets demonstrate that the proposed method surpasses state-of-the-art techniques in ensuring accurate edge details and correct region homogeneity for classification.

A Novel Riemannian Sparse Representation Learning Network for Polarimetric SAR Image Classification

TL;DR

This work tackles the challenge that PolSAR covariance matrices are Hermitian positive definite and lie on a Riemannian manifold, making Euclidean DL misrepresent matrix geometry. It introduces a sparse representation guided network (SRSR_CNN) that directly processes HPD matrices through a superpixel-based Riemannian sparse representation (SRSR), an unfolded SRSRNet for learned sparse codes and dictionary atoms, and a CNN-enhanced module for contextual features. The approach yields superior classification performance across three PolSAR datasets, with ablations confirming the benefit of integrating geometric sparse representations, network unfolding, and high-level CNN features. The method offers a principled, interpretable framework for PolSAR image classification that preserves matrix geometry and improves edge detail and region homogeneity, with potential impact on remote sensing analytics and related domains.

Abstract

Deep learning is an effective end-to-end method for Polarimetric Synthetic Aperture Radar(PolSAR) image classification, but it lacks the guidance of related mathematical principle and is essentially a black-box model. In addition, existing deep models learn features in Euclidean space, where PolSAR complex matrix is commonly converted into a complex-valued vector as the network input, distorting matrix structure and channel relationship. However, the complex covariance matrix is Hermitian positive definite (HPD), and resides on a Riemannian manifold instead of a Euclidean one. Existing methods cannot measure the geometric distance of HPD matrices and easily cause some misclassifications due to inappropriate Euclidean measures. To address these issues, we propose a novel Riemannian Sparse Representation Learning Network (SRSR CNN) for PolSAR images. Firstly, a superpixel-based Riemannian Sparse Representation (SRSR) model is designed to learn the sparse features with Riemannian metric. Then, the optimization procedure of the SRSR model is inferred and further unfolded into an SRSRnet, which can automatically learn the sparse coefficients and dictionary atoms. Furthermore, to learn contextual high-level features, a CNN-enhanced module is added to improve classification performance. The proposed network is a Sparse Representation (SR) guided deep learning model, which can directly utilize the covariance matrix as the network input, and utilize Riemannian metric to learn geometric structure and sparse features of complex matrices in Riemannian space. Experiments on three real PolSAR datasets demonstrate that the proposed method surpasses state-of-the-art techniques in ensuring accurate edge details and correct region homogeneity for classification.

Paper Structure

This paper contains 19 sections, 24 equations, 9 figures, 5 tables.

Figures (9)

  • Figure 1: The framework of the proposed SRSR_CNN method.
  • Figure 2: A single layer obtained by unfolding Eq.(\ref{['18']}).
  • Figure 3: PauliRGB images and the ground truth maps on the three considered datasets, i.e., Area of Xi'an, Oberpfaffenhofen, and Flevoland.
  • Figure 4: Classification results of the Xi'an data set. (a) KNNRS; (b) CVCNN; (c) 3DCNN; (d) DFGCN; (e) CEGCN; (f) PolMPCNN; (g) SRSR_CNN.
  • Figure 5: Classification results of the Oberpfaffenhofen data set. (a) KNNRS; (b) CVCNN; (c) 3DCNN; (d) DFGCN; (e) CEGCN; (f) PolMPCNN; (g) SRSR_CNN.
  • ...and 4 more figures