Xiongjun Zhang

Orcid: 0000-0002-5387-4129

According to our database1, Xiongjun Zhang authored at least 26 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Tensor factorization via transformed tensor-tensor product for image alignment.
Numer. Algorithms, March, 2024

2023
Robust Low Transformed Multi-Rank Tensor Completion With Deep Prior Regularization for Multi-Dimensional Image Recovery.
IEEE Trans. Big Data, October, 2023

A Learnable Group-Tube Transform Induced Tensor Nuclear Norm and Its Application for Tensor Completion.
SIAM J. Imaging Sci., September, 2023

Tensor completion via convolutional sparse coding with small samples-based training.
Pattern Recognit., September, 2023

2022
Sparse Nonnegative Tensor Factorization and Completion With Noisy Observations.
IEEE Trans. Inf. Theory, 2022

Low Rank Tensor Completion With Poisson Observations.
IEEE Trans. Pattern Anal. Mach. Intell., 2022

Robust tensor train component analysis.
Numer. Linear Algebra Appl., 2022

Nonlinear Transform Induced Tensor Nuclear Norm for Tensor Completion.
J. Sci. Comput., 2022

Sparse Nonnegative Tucker Decomposition and Completion under Noisy Observations.
CoRR, 2022

2021
Orthogonal Nonnegative Tucker Decomposition.
SIAM J. Sci. Comput., 2021

Robust Low Transformed Multi-Rank Tensor Methods for Image Alignment.
J. Sci. Comput., 2021

Auto-weighted robust low-rank tensor completion via tensor-train.
Inf. Sci., 2021

Robust low-rank tensor completion via transformed tensor nuclear norm with total variation regularization.
Neurocomputing, 2021

2020
Patched-tube unitary transform for robust tensor completion.
Pattern Recognit., 2020

Robust tensor completion using transformed tensor singular value decomposition.
Numer. Linear Algebra Appl., 2020

Fast algorithm with theoretical guarantees for constrained low-tubal-rank tensor recovery in hyperspectral images denoising.
Neurocomputing, 2020

On O( max {n<sub>1</sub>, n<sub>2</sub>} log ( max {n<sub>1</sub>, n<sub>2</sub>} n<sub>3</sub>)) Sample Entries for n<sub>1</sub> × n<sub>2</sub> × n<sub>3</sub> Tensor Completion via Unitary Transformation.
CoRR, 2020

2019
A Nonconvex Relaxation Approach to Low-Rank Tensor Completion.
IEEE Trans. Neural Networks Learn. Syst., 2019

A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion.
SIAM J. Imaging Sci., 2019

A Fast Algorithm for Solving Linear Inverse Problems with Uniform Noise Removal.
J. Sci. Comput., 2019

Robust Tensor Completion Using Transformed Tensor SVD.
CoRR, 2019

2018
A Fast Algorithm for Deconvolution and Poisson Noise Removal.
J. Sci. Comput., 2018

An Implementable Accelerated Alternating Direction Method of Multipliers for Low-Rank Tensor Completion.
Proceedings of the IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, 2018

Structured Convex Optimization Method for Orthogonal Nonnegative Matrix Factorization.
Proceedings of the 24th International Conference on Pattern Recognition, 2018

2017
Nonconvex-TV Based Image Restoration with Impulse Noise Removal.
SIAM J. Imaging Sci., 2017

2016
An Adaptive Correction Approach for Tensor Completion.
SIAM J. Imaging Sci., 2016


  Loading...