Quaternion Nonlinear Transform-Induced Nuclear Norm for Low-Rank Tensor Completion

• URL: http://arxiv.org/abs/2605.01467v1
• Date: Sat, 02 May 2026 14:35:34 GMT
• Title: Quaternion Nonlinear Transform-Induced Nuclear Norm for Low-Rank Tensor Completion
• Abstract summary: We propose a quaternion nonlinear transform-induced tensor nuclear norm (QNTTNN) via a real embedding of quaternions.<n>Building upon QNTTNN, we develop a proximal alternating minimization algorithm with rigorous convergence guarantees.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Tensor completion has emerged as a powerful framework for recovering missing data in multidimensional signals by exploiting low-rank tensor structures. Among existing approaches, linear transform-based tensor nuclear norm (TNN) methods have achieved considerable success by enforcing low-rankness on transformed frontal slices. However, the low-rank structure revealed by linear transforms remains inherently limited. To better capture intrinsic correlations, nonlinear transform-based TNN (NTTNN) models have been proposed, significantly enhancing low-rank representation through composite transforms. Despite their effectiveness, existing NTTNN methods are restricted to real-valued tensors and fail to model quaternion-valued data, which are essential for preserving inter-channel dependencies in color images and videos. Extending nonlinear TNN models to the quaternion domain is challenging due to the non-commutativity of quaternion multiplication and the complexity of quaternion singular value decomposition. To address the limitations encountered in prior works, we propose a quaternion nonlinear transform-induced tensor nuclear norm (QNTTNN) via a real embedding of quaternions, enabling tractable nuclear norm definitions and efficient optimization. Building upon QNTTNN, we formulate a quaternion tensor completion model and develop a proximal alternating minimization algorithm with rigorous convergence guarantees. Extensive experiments on benchmark color video inpainting datasets validate the superior performance of the proposed method over existing approaches.

Related papers

• Low-Rank Tensor Completion Based on Fractional Regularization with Ky Fan p-k Norm [63.91066367247722]
  This paper addresses low-rank tensor completion (LRTC)<n>It proposes a novel non surrogate, namely the ratio of the tub tensor norm to the tensor Ky Fan p-k norm (TNK)
  arXiv  Detail & Related papers  (2026-06-17T13:12:07Z)
• Multi-Dimensional Visual Data Recovery: Scale-Aware Tensor Modeling and Accelerated Randomized Computation [51.65236537605077]
  We propose a new type of network compression optimization technique, fully randomized tensor network compression (FCTN)<n>FCTN has significant advantages in correlation characterization and transpositional in algebra, and has notable achievements in multi-dimensional data processing and analysis.<n>We derive efficient algorithms with guarantees to solve the formulated models.
  arXiv  Detail & Related papers  (2026-02-13T14:56:37Z)
• Low-Rank Tensor Recovery via Variational Schatten-p Quasi-Norm and Jacobian Regularization [49.85875869048434]
  We propose a CP-based low-rank tensor function parameterized by neural networks for implicit neural representation.<n>To achieve sparser CP decomposition, we introduce a variational Schatten-p quasi-norm to prune redundant rank-1 components.<n>For smoothness, we propose a regularization term based on the spectral norm of the Jacobian and Hutchinson's trace estimator.
  arXiv  Detail & Related papers  (2025-06-27T11:23:10Z)
• Quaternion Nuclear Norms Over Frobenius Norms Minimization for Robust Matrix Completion [20.11953064373745]
  This paper introduces the quaternion model normart state the Frobenius framework for this problem.<n>We prove that the QNOF can be simplified to solving the $L1/L$ problem.<n>We also extend the QNOF to robust completion of the quaternion matrix.
  arXiv  Detail & Related papers  (2025-04-30T09:44:09Z)
• MNT-TNN: Spatiotemporal Traffic Data Imputation via Compact Multimode Nonlinear Transform-based Tensor Nuclear Norm [45.59831141171801]
  Modern communication technologies have introduced new challenges in missing value imputation.<n>We propose a novel imputation method based on a Multimode Transformed Nuclear Norm (MNSS-TNN)<n>We also suggest an Augmented Transform-based Nuclear Norm Families (ATTNNs) framework to enhance the imputation results.
  arXiv  Detail & Related papers  (2025-03-29T02:58:31Z)
• Fréchet Cumulative Covariance Net for Deep Nonlinear Sufficient Dimension Reduction with Random Objects [22.156257535146004]
  We introduce a new statistical dependence measure termed Fr'echet Cumulative Covariance (FCCov) and develop a novel nonlinear SDR framework based on FCCov.<n>Our approach is not only applicable to complex non-Euclidean data, but also exhibits robustness against outliers.<n>We prove that our method with squared Frobenius norm regularization achieves unbiasedness at the $sigma$-field level.
  arXiv  Detail & Related papers  (2025-02-21T10:55:50Z)
• Tensor-Var: Efficient Four-Dimensional Variational Data Assimilation [30.63086465547801]
  Four-dimensional variational assimilation (4D-Var) faces high computational costs in complex nonlinear systems and depends on imperfect state-observation mappings.<n>Deep learning (DL) offers more expressive approximators, while integrating DL models into 4D-Var is challenging due to their nonlinearities and lack of theoretical guarantees in assimilation results.<n>We propose a novel framework that integrates kernel conditional mean embedding (CME) with 4D-Var to linearize nonlinear dynamics, achieving convex optimization in a learned feature space.
  arXiv  Detail & Related papers  (2025-01-23T01:43:31Z)
• OTLRM: Orthogonal Learning-based Low-Rank Metric for Multi-Dimensional Inverse Problems [14.893020063373022]
  We introduce a novel data-driven generative low-rank t-SVD model based on the learnable orthogonal transform.<n>We also propose a low-rank solver as a generalization of SVT, which utilizes an efficient representation of generative networks to obtain low-rank structures.
  arXiv  Detail & Related papers  (2024-12-15T12:28:57Z)
• Irregular Tensor Low-Rank Representation for Hyperspectral Image Representation [71.69331824668954]
  Spectral variations pose a common challenge in analyzing hyperspectral images (HSI)<n>Low-rank tensor representation has emerged as a robust strategy, leveraging inherent correlations within HSI data.<n>We propose a novel model for irregular tensor lowrank representation tailored to efficiently model irregular 3D cubes.
  arXiv  Detail & Related papers  (2024-10-24T02:56:22Z)
• Truncated tensor Schatten p-norm based approach for spatiotemporal traffic data imputation with complicated missing patterns [77.34726150561087]
  We introduce four complicated missing patterns, including missing and three fiber-like missing cases according to the mode-drivenn fibers. Despite nonity of the objective function in our model, we derive the optimal solutions by integrating alternating data-mputation method of multipliers.
  arXiv  Detail & Related papers  (2022-05-19T08:37:56Z)
• Nonlinear Transform Induced Tensor Nuclear Norm for Tensor Completion [12.788874164701785]
  We propose a low-rank tensor completion (LRTC) model along the theoretical convergence of the NTTNN and the PAM algorithm. Our method outperforms linear transform-based state-of-the-art nuclear norm (TNN) methods qualitatively and quantitatively.
  arXiv  Detail & Related papers  (2021-10-17T09:25:37Z)
• Multi-View Spectral Clustering Tailored Tensor Low-Rank Representation [105.33409035876691]
  This paper explores the problem of multi-view spectral clustering (MVSC) based on tensor low-rank modeling. We design a novel structured tensor low-rank norm tailored to MVSC. We show that the proposed method outperforms state-of-the-art methods to a significant extent.
  arXiv  Detail & Related papers  (2020-04-30T11:52:12Z)

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.