Robust low transformed multi-rank tensor methods for image alignment
From MaRDI portal
Publication:2660687
DOI10.1007/s10915-021-01437-8zbMath1464.65020OpenAlexW3133941073MaRDI QIDQ2660687
Xiong-Jun Zhang, Duo Qiu, Min-Ru Bai, Michael Kwok-Po Ng
Publication date: 31 March 2021
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-021-01437-8
Computing methodologies for image processing (68U10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Multilinear algebra, tensor calculus (15A69)
Related Items
Tensor completion via fully-connected tensor network decomposition with regularized factors, Approximation strategy based on the T-product for third-order quaternion tensors with application to color video compression, Tensor factorization via transformed tensor-tensor product for image alignment, Tensor Robust Principal Component Analysis via Tensor Fibered Rank and \({\boldsymbol{{l_p}}}\) Minimization, Provable stochastic algorithm for large-scale fully-connected tensor network decomposition
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Nearly unbiased variable selection under minimax concave penalty
- Tensor-Train Decomposition
- The Adaptive Lasso and Its Oracle Properties
- A proximal method for composite minimization
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
- Factorization strategies for third-order tensors
- Tensor-tensor products with invertible linear transforms
- Strong uniqueness and second order convergence in nonlinear discrete approximation
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- On gradients of functions definable in o-minimal structures
- An invitation to 3-D vision. From images to geometric models.
- A Gauss-Newton method for convex composite optimization
- TILT: transform invariant low-rank textures
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction
- Strong oracle optimality of folded concave penalized estimation
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Image manifolds which are isometric to Euclidean space
- Robust Low-Rank Tensor Recovery: Models and Algorithms
- Nonconvex-TV Based Image Restoration with Impulse Noise Removal
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Robust tensor completion using transformed tensor singular value decomposition
- Variational Analysis
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- On $l_q$ Optimization and Matrix Completion
- Efficient Tensor Completion for Color Image and Video Recovery: Low-Rank Tensor Train
- Exact Tensor Completion Using t-SVD
- Fundamental Limits in Multi-Image Alignment
- On $\ell_1$ Data Fitting and Concave Regularization for Image Recovery
- An Order-$p$ Tensor Factorization with Applications in Imaging
- Online Subspace Learning from Gradient Orientations for Robust Image Alignment
- Third-Order Tensors as Operators on Matrices: A Theoretical and Computational Framework with Applications in Imaging
- Matrix Analysis and Applications
- Most Tensor Problems Are NP-Hard
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Nonlocal robust tensor recovery with nonconvex regularization *
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
- A Corrected Tensor Nuclear Norm Minimization Method for Noisy Low-Rank Tensor Completion
