首页> 外文期刊>International Journal of Computer Vision >A Tensor Approximation Approach to Dimensionality Reduction
【24h】

A Tensor Approximation Approach to Dimensionality Reduction

机译:降维的张量逼近方法

获取原文
获取原文并翻译 | 示例
           

摘要

Dimensionality reduction has recently been extensively studied for computer vision applications. We present a novel multilinear algebra based approach to reduced dimensionality representation of multidimensional data, such as image ensembles, video sequences and volume data. Before reducing the dimensionality we do not convert it into a vector as is done by traditional dimensionality reduction techniques like PCA. Our approach works directly on the multidimensional form of the data (matrix in 2D and tensor in higher dimensions) to yield what we call a Datum-as-Is representation. This helps exploit spatio-temporal redundancies with less information loss than image-as-vector methods. An efficient rank-R tensor approximation algorithm is presented to approximate higher-order tensors. We show that rank-R tensor approximation using Datum-as-Is representation generalizes many existing approaches that use image-as-matrix representation, such as generalized low rank approximation of matrices (GLRAM) (Ye, Y. in Mach. Learn. 61:167–191, 2005), rank-one decomposition of matrices (RODM) (Shashua, A., Levin, A. in CVPR’01: Proceedings of the 2001 IEEE computer society conference on computer vision and pattern recognition, p. 42, 2001) and rank-one decomposition of tensors (RODT) (Wang, H., Ahuja, N. in ICPR ’04: ICPR ’04: Proceedings of the 17th international conference on pattern recognition (ICPR’04), vol. 1, pp. 44–47, 2004). Our approach yields the most compact data representation among all known image-as-matrix methods. In addition, we propose another rank-R tensor approximation algorithm based on slice projection of third-order tensors, which needs fewer iterations for convergence for the important special case of 2D image ensembles, e.g., video. We evaluated the performance of our approach vs. other approaches on a number of datasets with the following two main results. First, for a fixed compression ratio, the proposed algorithm yields the best representation of image ensembles visually as well as in the least squares sense. Second, proposed representation gives the best performance for object classification.
机译:降维最近已被广泛研究用于计算机视觉应用。我们提出了一种新颖的基于多线性代数的方法来减少多维数据(例如图像集合,视频序列和体数据)的维数表示。在降低维数之前,我们不会像传统的降维技术(如PCA)那样将其转换为向量。我们的方法直接作用于数据的多维形式(二维矩阵和高维张量),以产生所谓的“按原样”表示。与以图像为载体的方法相比,这有助于利用时空冗余来减少信息丢失。提出了一种有效的rank-R张量逼近算法来逼近高阶张量。我们表明,使用“按原样”表示的Rank-R张量逼近概括了许多使用以矩阵表示的现有方法,例如矩阵的广义低阶逼近(GLRAM)(Ye,Y. in Mach。Learn。61 :167–191,2005年),矩阵的一阶分解(RODM)(CVPR'01中的Shashua,A.,Levin,A.:2001 IEEE计算机学会计算机视觉和模式识别会议论文集,第42页) (2001年)和张量的秩分解(RODT)(Wang,H.,Ahuja,N. in ICPR '04:ICPR '04:第17届国际模式识别会议论文集(ICPR'04),第1卷,第44-47页,2004年)。在所有已知的图像矩阵方法中,我们的方法产生了最紧凑的数据表示形式。此外,我们提出了另一种基于三阶张量的切片投影的Rank-R张量逼近算法,对于2D图像集成的重要特殊情况(例如视频),它需要较少的迭代收敛。我们评估了我们的方法与其他方法在许多数据集上的性能,得出以下两个主要结果。首先,对于固定的压缩率,所提出的算法在视觉上以及最小二乘意义上都能产生图像集合的最佳表示。其次,建议的表示方式为对象分类提供了最佳性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号