SOS tensor decomposition: Theory and applications
نویسندگان
چکیده
منابع مشابه
General tensor decomposition, moment matrices and applications
The tensor decomposition addressed in this paper may be seen as a generalisation of Singular Value Decomposition of matrices. We consider general multilinear and multihomogeneous tensors. We show how to reduce the problem to a truncated moment matrix problem and give a new criterion for flat extension of Quasi-Hankel matrices. We connect this criterion to the commutation characterisation of bor...
متن کاملTensor Voting: Theory and Applications
We present a unified computational framework which properly implements the smoothness constraint to generate descriptions in terms of surfaces, regions, curves, and labelled junctions, from sparse, noisy, binary data in 2-D or 3-D. Each input site can be a point, a point with an associated tangent direction, a point with an associated normal direction, or any combination of the above. The metho...
متن کاملBlock SOS Decomposition
Awidely usedmethod for determiningwhether amultivariate polynomial is a sum of squares of polynomials (SOS), called SOS decomposition, is to decide the feasibility of corresponding semi-definite programming (SDP) problem which can be efficiently solved in theory. In practice, although existing SDP solvers can work out some problems of big scale, the efficiency and reliability of such method dec...
متن کاملEmpirical Mode Decomposition: Theory & Applications
Empirical Mode Decomposition (EMD), introduced by Huang et al, in 1998 is a new and effective tool to analyze non-linear and non-stationary signals. With this method, a complicated and multiscale signal can be adaptively decomposed into a sum of finite number of zero mean oscillating components called as Intrinsic Mode Functions (IMF) whose instantaneous frequency computed by the analytic signa...
متن کاملFast and robust tensor decomposition with applications to dictionary learning
We develop fast spectral algorithms for tensor decomposition that match the robustness guarantees of the best known polynomial-time algorithms for this problem based on the sum-of-squares (SOS) semidefinite programming hierarchy. Our algorithms can decompose a 4-tensor with n-dimensional orthonormal components in the presence of error with constant spectral norm (when viewed as an n2-by-n2 matr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Sciences
سال: 2016
ISSN: 1539-6746,1945-0796
DOI: 10.4310/cms.2016.v14.n8.a1