Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Novel Factorization Strategies for Higher Order Tensors: Implications for Compression and Recovery of Multi-linear Data (1307.0805v3)

Published 2 Jul 2013 in cs.IT, cs.CV, and math.IT

Abstract: In this paper we propose novel methods for compression and recovery of multilinear data under limited sampling. We exploit the recently proposed tensor- Singular Value Decomposition (t-SVD)[1], which is a group theoretic framework for tensor decomposition. In contrast to popular existing tensor decomposition techniques such as higher-order SVD (HOSVD), t-SVD has optimality properties similar to the truncated SVD for matrices. Based on t-SVD, we first construct novel tensor-rank like measures to characterize informational and structural complexity of multilinear data. Following that we outline a complexity penalized algorithm for tensor completion from missing entries. As an application, 3-D and 4-D (color) video data compression and recovery are considered. We show that videos with linear camera motion can be represented more efficiently using t-SVD compared to traditional approaches based on vectorizing or flattening of the tensors. Application of the proposed tensor completion algorithm for video recovery from missing entries is shown to yield a superior performance over existing methods. In conclusion we point out several research directions and implications to online prediction of multilinear data.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Zemin Zhang (5 papers)
  2. Gregory Ely (6 papers)
  3. Shuchin Aeron (72 papers)
  4. Ning Hao (52 papers)
  5. Misha Kilmer (14 papers)
Citations (17)

Summary

We haven't generated a summary for this paper yet.