IEEE Transactions on Pattern Analysis and Machine Intelligence· 2017Q1
Kronecker-Basis-Representation Based Tensor Sparsity and Its Applications to Tensor Recovery
- 315citations
- Q1SCImago
- 2017year
Short summary
A novel Kronecker-basis-representation (KBR) measure for tensor sparsity is introduced, encoding insights from both Tucker and CP decompositions, and an efficient ADMM algorithm is developed for KBR regularization minimization.
AI-generated from the title and abstract; the full text is not read.
TakeawaysIn the app
Key pointsIn the app
Ask the paperIn the app
The rest is in the Pofolia app
Takeaways, key points and questions to the paper; new summaries every day for your field. Free.
Sign in on the web to openField: Computational Mathematics
Computational MathematicsMathematics