Tucker factorization with missing data with application to low-\(n\)-rank tensor completion

DOI10.1007/s11045-013-0269-9zbMath1435.94066OpenAlexW2033560557MaRDI QIDQ335961

Marko Filipović, Ante Jukić

Publication date: 10 November 2016

Published in: Multidimensional Systems and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11045-013-0269-9

zbMATH Keywords

missing datatensor completionlow-\(n\)-rank tensorTucker factorization

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (10)

Low tubal rank tensor recovery using the Bürer-Monteiro factorisation approach. Application to optical coherence tomography ⋮ Tensor train rank minimization with hybrid smoothness regularization for visual data recovery ⋮ Parallel active subspace decomposition for tensor robust principal component analysis ⋮ Recompression of Hadamard Products of Tensors in Tucker Format ⋮ HTR-CTO algorithm for wireless data recovery ⋮ Nonconvex tensor rank minimization and its applications to tensor recovery ⋮ Block tensor train decomposition for missing data estimation ⋮ A non-convex tensor rank approximation for tensor completion ⋮ Low-rank tensor completion via smooth matrix factorization ⋮ An iterative method for tensor inpainting based on higher-order singular value decomposition

Uses Software

• Poblano
• N-way Toolbox
• BSDS

Cites Work

• Tensor Decompositions and Applications
• Exact matrix completion via convex optimization
• Tensor completion and low-n-rank tensor recovery via convex optimization
• Tensor rank is NP-complete
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• A Multilinear Singular Value Decomposition

This page was built for publication: Tucker factorization with missing data with application to low-\(n\)-rank tensor completion