Tensor Approximation Algorithm based on High Order Singular Value Decomposition

نویسندگان

  • Yan-li Zhu
  • Jian-ping Wang
  • Xiao-juan Guo
  • Chang Liu
چکیده

To solve some problems which JPEG compression obtains results of poor reconstruction quality and high computational complexity for image containing more high frequency information, a novel tensor approximation algorithm based on high order singular value decomposition has been proposed. The new algorithm respects each image both gray image and color image as a high order tensor. It transforms the image into singular value matrix that contains nonzero singular values to implement image compress and discards singular sub-tensor corresponding smaller singular values in tensor decomposition to reduce the calculation work. The experiment result compared with JPEG shows that the algorithm has better performance than JPEG for color images. It is easy to apply the algorithm to any high order tensor in computer vision.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Randomized Tensor Train Singular Value Decomposition

The hierarchical SVD provides a quasi-best low rank approximation of high dimensional data in the hierarchical Tucker framework. Similar to the SVD for matrices, it provides a fundamental but expensive tool for tensor computations. In the present work we examine generalizations of randomized matrix decomposition methods to higher order tensors in the framework of the hierarchical tensors repres...

متن کامل

Multiscale Analysis for Higher-order Tensors

The widespread use of multisensor technology and the emergence of big datasets have created the need to develop tools to reduce, approximate, and classify large and multimodal data such as higher-order tensors. While early approaches focused on matrix and vector based methods to represent these higher-order data, more recently it has been shown that tensor decomposition methods are better equip...

متن کامل

On the Tensor Svd and Optimal Low Rank Orthogonal Approximations of Tensors

Abstract. It is known that a high order tensor does not necessarily have an optimal low rank approximation, and that a tensor might not be orthogonally decomposable (i.e., admit a tensor SVD). We provide several sufficient conditions which lead to the failure of the tensor SVD, and characterize the existence of the tensor SVD with respect to the Higher Order SVD (HOSVD) of a tensor. In face of ...

متن کامل

A randomized algorithm for a tensor-based generalization of the singular value decomposition

An algorithm is presented and analyzed that, when given as input a d-mode tensor A, computes an approximation Ã. The approximation à is computed by performing the following for each of the d modes: first, form (implicitly) a matrix by “unfolding” the tensor along that mode; then, choose columns from the matrices thus generated; and finally, project the tensor along that mode onto the span of th...

متن کامل

Handwritten digit classification using higher order singular value decomposition

In this paper we present two algorithms for handwritten digit classification based on the higher order singular value decomposition (HOSVD). The first algorithm uses HOSVD for construction of the class models and achieves classification results with error rate lower than 6%. The second algorithm uses the HOSVD for tensor approximation simultaneously in two modes. Classification results for the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012