首页> 外文会议>International Conference on New Trends in Information Science, Service Science and Data Mining >A New Linear Coding Algorithm for Efficient Multi-dimensional Data Representation without Data Expansion
【24h】

A New Linear Coding Algorithm for Efficient Multi-dimensional Data Representation without Data Expansion

机译:一种新的线性编码算法,用于无数据扩展的有效多维数据表示

获取原文

摘要

Linear coding is used for finding succinct representations of data sets. It also discover basis functions that capture higher-level features in the data. However, finding linear codes for multi-dimensional data remains a very difficult computational problem. Motivated by the work of linear image coding and multilinear algebra, we propose a linear tensor coding algorithm (LTC), which is applied to represent multi-dimensional data succinctly by a linear combination of tensor-formed bases without data expansion. Each basis captures some specific variability. The coefficients of data, which are associated with the bases, can be applied for representation, compression and classification. When we applied LTC algorithm on the phantom data, experimental results illustrate that our algorithm not only produces localized bases but also preserve the information of the input data.
机译:线性编码用于查找数据集的简洁表示。它还发现基础函数,以捕获数据中更高级别的功能。然而,找到用于多维数据的线性码仍然是一个非常困难的计算问题。通过线性图像编码和多线性代数的作用,我们提出了一种线性张量编码算法(LTC),其被施加的迹体形成的基部的线性组合简洁地代表多维数据,而没有数据扩展。每个基础都捕获了一些具体的可变性。与基础相关联的数据系数可以应用于表示,压缩和分类。当我们在幻像数据上应用LTC算法时,实验结果说明了我们的算法不仅产生了本地化基础,还可以保留输入数据的信息。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号