arrow
返回

Fast transformation-invariant component analysis

delete2007-11-28
delete3
PRE
AI
A
Anitha Kannan *
N
Nebojša Jojić
B
Brendan J. Frey
DOI:10.1007/s11263-007-0094-4delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Dimensionality reduction techniques such as principal component analysis and factor analysis are used to discover a linear mapping between high-dimensional data samples and points in a lower-dimensional subspace. Previously, Frey and Jojic introduced transformation-invariant component analysis (TCA) to learn a linear mapping, invariant to a set of known form of global transformations. However, parameter estimation in that model using the previously-proposed expectation maximization (EM) algorithm required scalar operations in the order of N-2 where N is the dimensionality of each training example. This is prohibitive for many applications of interest such as modeling mid-to large-size images, where, for instance, N may be as high as 786432 (512 x 512 RGB image). In this paper, we present an efficient algorithm that reduces the computational requirements to order of N log N. With this speedup, we show the effectiveness of transformation-invariant component analysis in various applications including tracking, learning video textures, clustering, object recognition and object detection in images. Software for TCA can be downloaded from http://www.psi.toronto.edu/ fastTCA.htm.
Keyword:
TCA
patch
EM algorithm
dimensionality reduction
clustering
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

International Journal of Computer Vision 封面图
International Journal of Computer Vision
IF:
9.3
论文数:
3.9K
被引数:
2.8W

机构

M
Microsoft
学者数:
3.0K
论文数: 2.7K
被引数: 7
U
university of toronto
学者数:
14.7W
论文数: 12.0W
被引数: 165
引用论文

引用论文

err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
err分享
err收藏
学者 查看更多内容