Riemannian Complex Hermit Positive Definite Convolution Network for Polarimetric SAR Image Classification

• URL: http://arxiv.org/abs/2502.08137v1
• Date: Wed, 12 Feb 2025 05:41:25 GMT
• Title: Riemannian Complex Hermit Positive Definite Convolution Network for Polarimetric SAR Image Classification
• Authors: Junfei Shi, Mengmeng Nie, Yuke Li, Haiyan Jin, Weisi Lin,
• Abstract summary: Deep learning can learn semantic features in Euclidean space effectively for PolSAR images. They need to covert the complex covariance matrix into a feature vector or complex-valued vector as the network input. We propose a complex HPD unfolding network and a CV-3DCNN enhanced network to learn complex HPD matrices directly.
• Score: 42.353289630062555
• License:
• Abstract: Deep learning can learn high-level semantic features in Euclidean space effectively for PolSAR images, while they need to covert the complex covariance matrix into a feature vector or complex-valued vector as the network input. However, the complex covariance matrices are essentially a complex Hermit positive definite (HPD) matrix endowed in Riemannian manifold rather than Euclidean space. The matrix's real and imagery parts are with the same significance, as the imagery part represents the phase information. The matrix vectorization will destroy the geometric structure and manifold characteristics of complex covariance matrices. To learn complex HPD matrices directly, we propose a Riemannian complex HPD convolution network(HPD\_CNN) for PolSAR images. This method consists of a complex HPD unfolding network(HPDnet) and a CV-3DCNN enhanced network. The proposed complex HPDnet defines the HPD mapping, rectifying and the logEig layers to learn geometric features of complex matrices. In addition, a fast eigenvalue decomposition method is designed to reduce computation burden. Finally, a Riemannian-to-Euclidean enhanced network is defined to enhance contextual information for classification. Experimental results on two real PolSSAR datasets demonstrate the proposed method can achieve superior performance than the state-of-the-art methods especially in heterogeneous regions.

Related papers

• SPDFusion: An Infrared and Visible Image Fusion Network Based on a Non-Euclidean Representation of Riemannian Manifolds [35.03742076163911]
  We propose a novel SPD (symmetric positive definite) manifold learning framework for multi-modal image fusion. Our framework exhibits superior performance compared to the current state-of-the-art methods.
  arXiv  Detail & Related papers  (2024-11-16T03:09:49Z)
• Fitting Multilevel Factor Models [41.38783926370621]
  We develop a novel, fast implementation of the expectation-maximization algorithm, tailored for multilevel factor models. We show that the inverse of an invertible PSD MLR matrix is also an MLR matrix with the same sparsity in factors. We present an algorithm that computes the Cholesky factorization of an expanded matrix with linear time and space complexities.
  arXiv  Detail & Related papers  (2024-09-18T15:39:12Z)
• Understanding Matrix Function Normalizations in Covariance Pooling through the Lens of Riemannian Geometry [63.694184882697435]
  Global Covariance Pooling (GCP) has been demonstrated to improve the performance of Deep Neural Networks (DNNs) by exploiting second-order statistics of high-level representations. This paper provides a comprehensive and unified understanding of the matrix logarithm and power from a Riemannian geometry perspective.
  arXiv  Detail & Related papers  (2024-07-15T07:11:44Z)
• Riemannian Complex Matrix Convolution Network for PolSAR Image Classification [6.958028708925819]
  Existing deep learning methods learn PolSAR data by converting the covariance matrix into a feature vector or complex-valued vector as the input. To learn geometric structure of complex matrix, we propose a Riemannian complex matrix convolution network for PolSAR image classification. Experiments are conducted on three sets of real PolSAR data with different bands and sensors.
  arXiv  Detail & Related papers  (2023-12-06T09:33:33Z)
• Deep Diversity-Enhanced Feature Representation of Hyperspectral Images [87.47202258194719]
  We rectify 3D convolution by modifying its topology to enhance the rank upper-bound. We also propose a novel diversity-aware regularization (DA-Reg) term that acts on the feature maps to maximize independence among elements. To demonstrate the superiority of the proposed Re$3$-ConvSet and DA-Reg, we apply them to various HS image processing and analysis tasks.
  arXiv  Detail & Related papers  (2023-01-15T16:19:18Z)
• Rank-Enhanced Low-Dimensional Convolution Set for Hyperspectral Image Denoising [50.039949798156826]
  This paper tackles the challenging problem of hyperspectral (HS) image denoising. We propose rank-enhanced low-dimensional convolution set (Re-ConvSet) We then incorporate Re-ConvSet into the widely-used U-Net architecture to construct an HS image denoising method.
  arXiv  Detail & Related papers  (2022-07-09T13:35:12Z)
• Two-Stream Graph Convolutional Network for Intra-oral Scanner Image Segmentation [133.02190910009384]
  We propose a two-stream graph convolutional network (i.e., TSGCN) to handle inter-view confusion between different raw attributes. Our TSGCN significantly outperforms state-of-the-art methods in 3D tooth (surface) segmentation.
  arXiv  Detail & Related papers  (2022-04-19T10:41:09Z)
• ResNet-LDDMM: Advancing the LDDMM Framework Using Deep Residual Networks [86.37110868126548]
  In this work, we make use of deep residual neural networks to solve the non-stationary ODE (flow equation) based on a Euler's discretization scheme. We illustrate these ideas on diverse registration problems of 3D shapes under complex topology-preserving transformations.
  arXiv  Detail & Related papers  (2021-02-16T04:07:13Z)
• QR and LQ Decomposition Matrix Backpropagation Algorithms for Square, Wide, and Deep -- Real or Complex -- Matrices and Their Software Implementation [0.0]
  This article presents matrix backpropagation algorithms for the QR decomposition of matrices $A_m, n$, that are either square (m = n), wide (m n), or deep (m > n), with rank $k = min(m, n)$. We derive novel matrix backpropagation results for the pivoted (full-rank) QR decomposition and for the LQ decomposition of deep input matrices.
  arXiv  Detail & Related papers  (2020-09-19T21:03:37Z)
• Geometric Approaches to Increase the Expressivity of Deep Neural Networks for MR Reconstruction [41.62169556793355]
  Deep learning approaches have been extensively investigated to reconstruct images from accelerated magnetic resonance image (MRI) acquisition. It is not clear how to choose a suitable network architecture to balance the trade-off between network complexity and performance. This paper proposes a systematic geometric approach using bootstrapping and subnetwork aggregation to increase the expressivity of the underlying neural network.
  arXiv  Detail & Related papers  (2020-03-17T14:18:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.