2019
DOI: 10.1109/tcyb.2018.2817630
|View full text |Cite
|
Sign up to set email alerts
|

A Sequentially Truncated Higher Order Singular Value Decomposition-Based Algorithm for Tensor Completion

Abstract: The problem of recovering missing data of an incomplete tensor has drawn more and more attentions in the fields of pattern recognition, machine learning, data mining, computer vision, and signal processing. Researches on this problem usually share a common assumption that the original tensor is of low-rank. One of the important ways to capture the low-rank structure of the incomplete tensor is based on tensor factorization. For the traditional tensor factorization algorithms, the tensor ranks should be specifi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
16
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 39 publications
(16 citation statements)
references
References 47 publications
0
16
0
Order By: Relevance
“…• experiments on real video data: In real video dataset, we choose an NBA basketball video of size 144×256×40 (source: YouTube, as used in [49]), with a non-stationary panning camera moving from left to right horizontally following the running players. The proposed ORTP algorithm is compared with 1) low-tubal-rank recovery algorithms including AM, TNM, NM, CO, NO, MM, and 2) low-rank tensor recover algorithms using other rank definitions including high order singular value decomposition (HOSVD) in [37], H-Tucker (HT) algorithm in [38], TT algorithm in [39], Tucker format by Riemannian optimization (RO) in [58] and Bayesian minimum meansquared error estimate framework (BME) in [59]. • experiments on real video SAR data: an analysis of the performance of the proposed ORTP algorithm compared with the existing video SAR imaging algorithms and various low-rank tensor recovery algorithms on real video SAR data.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…• experiments on real video data: In real video dataset, we choose an NBA basketball video of size 144×256×40 (source: YouTube, as used in [49]), with a non-stationary panning camera moving from left to right horizontally following the running players. The proposed ORTP algorithm is compared with 1) low-tubal-rank recovery algorithms including AM, TNM, NM, CO, NO, MM, and 2) low-rank tensor recover algorithms using other rank definitions including high order singular value decomposition (HOSVD) in [37], H-Tucker (HT) algorithm in [38], TT algorithm in [39], Tucker format by Riemannian optimization (RO) in [58] and Bayesian minimum meansquared error estimate framework (BME) in [59]. • experiments on real video SAR data: an analysis of the performance of the proposed ORTP algorithm compared with the existing video SAR imaging algorithms and various low-rank tensor recovery algorithms on real video SAR data.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…In this section, we test our weighted HOSVD algorithm for tensor completion on three videos, see [ 50 ]. The dataset is the tennis-serve data from an Olympic Sports Dataset [ 51 ].…”
Section: Methodsmentioning
confidence: 99%
“…The three videos are color video. In our simulation, we use the same setup as the one in [ 50 ], and choose 30 frames evenly from each video. For each frame, the size is scaled to , so each video is transformed into a 4-D tensor data of size .…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…2) Data: In this part, we have tested our algorithm on three video data, see [14]. The video data are tennisserve data from an Olympic Sports Dataset.…”
Section: A Simulations For Weighted Hosvdmentioning
confidence: 99%