Suppr超能文献

判别非负张量分解算法

Discriminant nonnegative tensor factorization algorithms.

作者信息

Zafeiriou Stefanos

机构信息

Imperial College London, Department of Electrical and Electronic Engineering, Communications and Signal Processing Research Group, South Kensington Campus, London SW7 2AZ, UK.

出版信息

IEEE Trans Neural Netw. 2009 Feb;20(2):217-35. doi: 10.1109/TNN.2008.2005293. Epub 2009 Jan 13.

Abstract

Nonnegative matrix factorization (NMF) has proven to be very successful for image analysis, especially for object representation and recognition. NMF requires the object tensor (with valence more than one) to be vectorized. This procedure may result in information loss since the local object structure is lost due to vectorization. Recently, in order to remedy this disadvantage of NMF methods, nonnegative tensor factorizations (NTF) algorithms that can be applied directly to the tensor representation of object collections have been introduced. In this paper, we propose a series of unsupervised and supervised NTF methods. That is, we extend several NMF methods using arbitrary valence tensors. Moreover, by incorporating discriminant constraints inside the NTF decompositions, we present a series of discriminant NTF methods. The proposed approaches are tested for face verification and facial expression recognition, where it is shown that they outperform other popular subspace approaches.

摘要

非负矩阵分解(NMF)已被证明在图像分析中非常成功,特别是在对象表示和识别方面。NMF要求对象张量(价数大于一)向量化。由于向量化会导致局部对象结构丢失,此过程可能会导致信息丢失。最近,为了弥补NMF方法的这一缺点,已经引入了可以直接应用于对象集合张量表示的非负张量分解(NTF)算法。在本文中,我们提出了一系列无监督和有监督的NTF方法。也就是说,我们使用任意价数的张量扩展了几种NMF方法。此外,通过在NTF分解中纳入判别约束,我们提出了一系列判别NTF方法。所提出的方法在面部验证和面部表情识别中进行了测试,结果表明它们优于其他流行的子空间方法。

文献AI研究员

20分钟写一篇综述,助力文献阅读效率提升50倍。

立即体验

用中文搜PubMed

大模型驱动的PubMed中文搜索引擎

马上搜索

文档翻译

学术文献翻译模型,支持多种主流文档格式。

立即体验