Page 645 - 8th European Congress of Mathematics ∙ 20-26 June 2021 ∙ Portorož, Slovenia ∙ Book of Abstracts
P. 645
MATHEMATICS IN SCIENCE AND TECHNOLOGY
performance with respect to other well-known image completion methods, such as NMCSA,
TMac, TCTF, SiLRTC, FaLRTC, and HaLRTC. Its computational complexity can be upper-
bounded by O(ξ N InJn) for incomplete tensor M ∈ RI1×...×IN given the multi-linear rank
n=1
(J1, . . . , JN ).
643
performance with respect to other well-known image completion methods, such as NMCSA,
TMac, TCTF, SiLRTC, FaLRTC, and HaLRTC. Its computational complexity can be upper-
bounded by O(ξ N InJn) for incomplete tensor M ∈ RI1×...×IN given the multi-linear rank
n=1
(J1, . . . , JN ).
643
