Skip to content
DraconiticResearch
Search Sources API
203,948 studies31 sourcesUpdated 6 min ago
PreprintarXiv licencearXiv

A Fast Algorithm for Quaternion Tensor Singular Value Decomposition under the QT-Product with Applications to Color Video Processing

Abstract

Based on the complex representation of quaternion matrices, this paper revisits the quaternion tensor singular value decomposition (QT-SVD) under the QT-product and establishes the corresponding z-block circulant matrix decomposition. We develop an efficient implementation of the QT-SVD. Numerical experiments show that this implementation is substantially faster than QT-SVD based on the quaternion matrix SVD approach \cite[Theorem~2.3]{AMLzhang2022} while maintaining high numerical accuracy. We further apply the QT-SVD to color video encryption and reconstruction. Experiments on five DAVIS video sequences show that the QT-SVD achieves higher reconstruction quality and shorter decomposition times than the quaternion T-SVD \cite{tsvdarxiv} under the same processing procedure. Both methods exhibit comparable ciphertext statistics and differential sensitivity, while the QT-SVD introduces less additional distortion under the tested input perturbations.

Related

  1. A Fast Algorithm for Quaternion Tensor Singular Value Decomposition under the T-product
    Daochang Zhang, Yue Zhao, Jingqian Li
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  2. Order-Specified Quaternion CP Decomposition: Models, Algorithms, and Applications
    Jifei Miao, Niansheng Tang, Michael K. Ng +2
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  3. On trace-zero norm forms of orders of rational quaternion algebras with applications
    Yifan Luo, Tianze Wang, Haigang Zhou
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  4. At last, an explicit singular value decomposition for electrical impedance tomography
    William R B Lionheart, Michael Pidcock, Cristiana Sebu
    arXivPreprintarXiv licenceFull textAnalysis & PDEsBiological & medical physicsarXiv
  5. Singular value decomposition of unbounded operators
    Rongbiao Thomas Wang, Haoming Wang, Lek-Heng Lim
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
BibTeX
@misc{zhang2026fast,
  title = {{A Fast Algorithm for Quaternion Tensor Singular Value Decomposition under the QT-Product with Applications to Color Video Processing}},
  author = {Daochang Zhang and Yue Zhao and Jingqian Li},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.36550},
  eprint = {2610.36550},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.36550},
}
RIS
TY  - UNPB
TI  - A Fast Algorithm for Quaternion Tensor Singular Value Decomposition under the QT-Product with Applications to Color Video Processing
AU  - Daochang Zhang
AU  - Yue Zhao
AU  - Jingqian Li
PY  - 2026
DA  - 2026/10/27
PB  - arXiv
DO  - 10.48550/arxiv.2610.36550
UR  - https://arxiv.org/abs/2610.36550
AB  - Based on the complex representation of quaternion matrices, this paper revisits the quaternion tensor singular value decomposition (QT-SVD) under the QT-product and establishes the corresponding z-block circulant matrix decomposition. We develop an efficient implementation of the QT-SVD. Numerical experiments show that this implementation is substantially faster than QT-SVD based on the quaternion matrix SVD approach \cite[Theorem~2.3]{AMLzhang2022} while maintaining high numerical accuracy. We further apply the QT-SVD to color video encryption and reconstruction. Experiments on five DAVIS video sequences show that the QT-SVD achieves higher reconstruction quality and shorter decomposition times than the quaternion T-SVD \cite{tsvdarxiv} under the same processing procedure. Both methods exhibit comparable ciphertext statistics and differential sensitivity, while the QT-SVD introduces less additional distortion under the tested input perturbations.
ER  -