IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v205y2025i2d10.1007_s10957-025-02648-x.html
   My bibliography  Save this article

Complex Representation Matrix of Third-Order Quaternion Tensors with Application to Video Inpainting

Author

Listed:
  • Fengsheng Wu

    (Yunnan University)

  • Chaoqian Li

    (Yunnan University)

  • Yaotang Li

    (Yunnan University)

  • Niansheng Tang

    (Yunnan University)

Abstract

Quaternion tensors are currently applied widely across various scientific and engineering fields. However, the inherent multiple imaginary components of quaternions and their non-commutative multiplication pose significant challenges to the computational efficiency of quaternion tensors. In this paper, we introduce a complex representation matrix (CRM) for third-order quaternion tensors based on the specific algebraic structure. With the discrete Fourier transform, the novel CRM framework demonstrates distinctive advantages through its advantageous algebraic characteristics, which not only establish its theoretical uniqueness but also enable effective transformation of quaternion tensor optimization problems into the complex domain for efficient solution. The proposed CRM features a block-diagonal structure, enabling efficient large-scale computations and enhancing its suitability for high-dimensional problems. To evaluate its advantages in video inpainting, two CRM-based quaternion tensor completion methods are introduced. Simulation studies and example analyses confirm their effectiveness and efficiency.

Suggested Citation

  • Fengsheng Wu & Chaoqian Li & Yaotang Li & Niansheng Tang, 2025. "Complex Representation Matrix of Third-Order Quaternion Tensors with Application to Video Inpainting," Journal of Optimization Theory and Applications, Springer, vol. 205(2), pages 1-33, May.
  • Handle: RePEc:spr:joptap:v:205:y:2025:i:2:d:10.1007_s10957-025-02648-x
    DOI: 10.1007/s10957-025-02648-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-025-02648-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10957-025-02648-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:205:y:2025:i:2:d:10.1007_s10957-025-02648-x. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.