人体运动的函数数据分析与合成

在许多虚拟现实的应用中,虚拟人作为人在计算机中的表示,是提高其交互能力和沉浸感的重要因素之一.然而,对于虚拟人建模而言,合成逼真、可控的虚拟人运动仍然是具有挑战性的课题.为此,提出了一种基于函数数据分析的人体运动合成方法.通过对一组样本运动进行函数主成分分析,构建出一个由特征运动构成的低维函数子空间.该低维子空间不仅能够有效地刻画样本序列内在的变化规律,而且也为有目的的运动合成提供了方法.在该空间中,通过控制各特征运动的系数即可合成出逼真、平滑的运动序列.该合成过程没有耗时的计算,因此能够满足各种实时应用     

基于分块双向二维主成分分析的步态识别

提出了一种基于步态能量图和分块双向二维主成分分析进行步态特征的算法。首先对图像序列预处理提取运动轮廓,通过分析区域分布直方图检测出运动周期,生成步态能量图描述步态的空间和时间特性,继而使用分块双向二维主成分提取步态特征用以分类,最后在USF步态数据库上测试,并与其它几个算法进行比较。实验结果显示,该方法有更高的识别率和更低的计算复杂度。     

一种改进的人脸识别算法

分块主成分分析算法(PCA)在提取人脸特征时是按照分块进行的,它获得的特征矩阵的维数大于PCA方法得到特征的维数。针对这种情况,本文提出了一种改进的分块主成分分析算法,该算法首先对每个子图像集分别求解散布矩阵,并根据此散布矩阵求出投影矩阵;然后将子图像投影到对应投影矩阵上得到特征向量,由此特征向量进而求出相应子图像间的子距离;最后将图像的所有子距离相加得到图像间的距离,根据最近邻分类器进行分类识别。实验表明,本文方法不仅提高了识别率,而且减少了所需的鉴别矢量,具有很好的识别效果。     

基于非线性流形学习的3维人体运动合成

为了实现3维人体运动的有效合成,提出了一种基于非线性流形学习的3维人体运动合成框架及算法,并可应用于方便、快捷、用户可控的3维人体运动合成。该合成算法框架先采用非线性流形降维方法将高维运动样本映射到低维流形上,同时求解其本征运动语义参数空间的表达,然后将用户在低维运动语义参数空间中交互生成的样本通过逆向映射重建得到具有新运动语义特征的3维运动序列。实验结果表明该方法不仅能够对运动物理参数（如特定关节的运动位置、物理运动特征）进行较为精确的控制,还可用于合成具有高层运动语义（运动风格）的新运动数据。与现有运动合成方法比较,该方法具有用户可控、交互性强等优点,能够应用于常见3维人体运动数据的高效生成。     

人体运动的稀疏语义参数化模型与交互式合成

为了解决参数化运动合成方法中普遍存在的参数结构不统一和可理解性差的问题,提出一种稀疏语义参数化模型.该模型对预处理后的运动样本进行时序成组的稀疏主成分分析,得到若干个稀疏基向量；将运动参数表示为原始变量的稀疏线性组合,而组合系数对应着稀疏基向量的分量,因此运动参数具有鲜明语义.实验结果表明,采用文中模型只需简单地修改运动参数的数值,就能够实时地控制如摆臂幅度、肘部弯曲程度、行走路径、步幅、跳跃距离等运动属性,从而直观、高效地合成出符合用户要求的逼真运动.     

基于双向二维主成分分析的运动目标跟踪

为克服二维主成分分析（2DPCA）跟踪效率低的缺点,提出一种基于双向二维主成分分析（Bi-2DPCA）的运动目标跟踪算法。采用双向二维主成分分析作为目标表示的方法建立目标图像子空间,同时在图像均值与协方差矩阵的更新中引入基于目标图像匹配程度的自适应增量因子的增量学习的方法进一步提高算法效率。在多个包含动态背景的图像序列上的对比实验结果表明算法能在目标处于部分遮挡的情况下准确跟踪目标,同时算法在效率上高于基于二维主成分分析的目标跟踪算法。     

基于图像分块的二维投影特征提取能力研究

人脸识别研究的主要目的是提高识别率,关键技术在于提取有效的人脸特征。提出了分块多投影和分块双向多投影二维特征提取方法。分块多投影特征提取方法,针对现有分块单投影特征提取方法中每一子图均采用相同投影矩阵,而对人脸局部信息不加以区别,利用二维主成分分析方法,构造了分块多投影矩阵,使不同的子图投影到不同的子空间,与传统二维主成分方法和分块单投影方法相比,有效地利用人脸局部信息,降低了特征维数,提高了识别率,在ORL人脸库上实验表明了其有效性。     

基于鲁棒主成分分析的人脸子空间重构方法

子空间方法是人脸识别中的经典方法,其基本假设是人脸图像处于高维图像空间的低维子空间中.但是,由于光照变化、阴影、遮挡、局部镜面反射、图像噪声等因素的影响,使得子空间假设难以满足.为此,提出一种基于鲁棒主成分分析的人脸子空间重构方法.该方法将人脸图像数据矩阵表示为满足子空间假设的低秩矩阵和表征光照变化、阴影、遮挡、局部镜面反射、图像噪声等因素的误差矩阵之和,利用鲁棒主成分分析法求解低秩矩阵和误差矩阵.实验结果表明,文中方法能够有效地重构人脸图像的低维子空间.     

一种局部加权的二维主成分分析算法及其在人脸识别中的应用

提出了一种将局部特征加权与二维主成分分析相结合的局部加权的二维主成分分析方法．引入了二维局部加权特征子空间的概念，将各类样本映射到这个局部加权特征子空间，再通过计算测试样本到加权子空间的距离进行样本的分类．使用这种方法在ORL人脸库上进行测试，结果表明，经过局部特征加权的二维主成分分析方法比普通的二维主成分分析方法具有更优的性能，并且在提高识别率的同时算法的复杂程度并没有明显增加．     

分块二维主成分分析鉴别特征抽取能力研究

基于二维主成分分析(2DPCA),文章提出了分块二维主成分分析(M2DPCA)人脸识别方法。M2DPCA从模式的原始数字图像出发,先对图像进行分块,对分块得到的子图像矩阵采用2DPCA方法进行特征抽取,从而实现模式的分类。新方法的特点是能有效地抽取图像的局部特征,正是这些特征使此类模式区别于彼类。在ORL人脸数据库上测试了该方法的鉴别能力。实验的结果表明,M2DPCA在鉴别性能上优于通常的2DPCA和PCA方法,也优于基于Fisher鉴别准则的鉴别分析方法:Fisherfaces方法、F-S方法和J-Y方法。     

Multiscale motion saliency for keyframe extraction from motion capture sequences

Motion capture is an increasingly popular animation technique; however data acquired by motion capture can become substantial. This makes it difficult to use motion capture data in a number of applications, such as motion editing, motion understanding, automatic motion summarization, motion thumbnail generation, or motion database search and retrieval. To overcome this limitation, we propose an automatic approach to extract keyframes from a motion capture sequence. We treat the input sequence as motion curves, and obtain the most salient parts of these curves using a new proposed metric, called 'motion saliency'. We select the curves to be analysed by a dimension reduction technique, Principal Component Analysis (PCA). We then apply frame reduction techniques to extract the most important frames as keyframes of the motion. With this approach, around 8% of the frames are selected to be keyframes for motion capture sequences. Copyright © 2010 John Wiley & Sons, Ltd.     

基于SOM 特性和PCA 索引的三维运动检索

提出了一种基于自组织特征映射(SOM)和PCA 索引的三维运动数据检索方法.首先利用每一个运动序列来进行拓扑特性加强的SOM 的学习,其运动特性被映射到一个主曲面,然后利用主成分分析方法(PCA)提取主曲面的主成分来建立一个基于主成分的索引机制,加快检索速率.SOM 的引入避免了与原始数据的直接接触,后续的工作只是在主曲面的基础上展开,消除了不同骨架长度的位置信息对运动特性的影响.实验结果表明了算法的有效性.     

Robust structure from motion with affine camera via low-rank matrix recovery

We present a novel approach to structure from motion that can deal with missing data and outliers with an affine camera. We model the corruptions as sparse error. Therefore the structure from motion problem is reduced to the problem of recovering a low-rank matrix from corrupted observations. We first decompose the matrix of trajectories of features into low-rank and sparse components by nuclear-norm and l1-norm minimization, and then obtain the motion and structure from the low-rank components by the classical factorization method. Unlike pervious methods, which have some drawbacks such as depending on the initial value selection and being sensitive to the large magnitude errors, our method uses a convex optimization technique that is guaranteed to recover the low-rank matrix from highly corrupted and incomplete observations. Experimental results demonstrate that the proposed approach is more efficient and robust to large-scale outliers.     

Correspondence matching using kernel principal components analysis and label consistency constraints

This paper investigates spectral approaches to the problem of point pattern matching. We make two contributions. First, we consider rigid point-set alignment. Here we show how kernel principal components analysis (kernel PCA) can be effectively used for solving the rigid point correspondence matching problem when the point-sets are subject to outliers and random position jitter. Specifically, we show how the point- proximity matrix can be kernelised, and spectral correspondence matching transformed into one of kernel PCA. Second, we turn our attention to the matching of articulated point-sets. Here we show label consistency constraints can be incorporated into definition of the point proximity matrix. The new methods are compared to those of Shapiro and Brady and Scott and Longuet-Higgins, together with multidimensional scaling. We provide experiments on both synthetic data and real world data.     

基于角点特征分析的车辆排队长度检测方法

针对交通堵塞造成的各种状况,通过视频分析实现实时高效的车辆排队长度检测,从而获取更多的交通信息改善交通状况.本文通过传统的FAST角点检测方法与运动检测的过程相结合得到改进后的FAST算法,使用改进后的FAST角点特征分析技术,不仅可以提取出当前交通道路上表征车辆存在的角点特征图,还可以获取角点位置的运动状态.通过对交通监控下的视频进行预处理后,单一车道内处于静态的角点特征形成车辆排队,并进行PCA处理得到一维向量,最后对一维向量进行形态学处理来检测单一车道内的车辆排队长度.实验表明,本方法检测精度平均98%,满足应用于实际场景.     

关于二维主成分分析方法的研究

The principal component analysis (PCA), or the eigenfaces method, is a de facto standard in human face recognition. Numerous algorithms tried to generalize PCA in different aspects. More recently, a technique called two-dimensional PCA (2DPCA) was proposed to cut the computational cost of the standard PCA. Unlike PCA that treats images as vectors, 2DPCA views an image as a matrix. With a properly defined criterion, 2DPCA results in an eigenvalue problem which has a much lower dimensionality than that of PCA. In this paper, we show that 2DPCA is equivalent to a special case of an existing feature extraction method, i.e., the block-based PCA. Using the FERET database, extensive experimental results demonstrate that block-based PCA outperforms PCA on datasets that consist of relatively simple images for recognition, while PCA is more robust than 2DPCA in harder situations.     

A Unified Algebraic Approach to 2-D and 3-D Motion Segmentation and Estimation

In this paper, we present an analytic solution to the problem of estimating an unknown number of 2-D and 3-D motion models from two-view point correspondences or optical flow. The key to our approach is to view the estimation of multiple motion models as the estimation of a single multibody motion model. This is possible thanks to two important algebraic facts. First, we show that all the image measurements, regardless of their associated motion model, can be fit with a single real or complex polynomial. Second, we show that the parameters of the individual motion model associated with an image measurement can be obtained from the derivatives of the polynomial at that measurement. This leads to an algebraic motion segmentation and estimation algorithm that applies to most of the two-view motion models that have been adopted in computer vision. Our experiments show that the proposed algorithm out-performs existing algebraic and factorization-based methods in terms of efficiency and robustness, and provides a good initialization for iterative techniques, such as Expectation Maximization, whose performance strongly depends on good initialization. This paper is an extended version of [34]. The authors thank Sampreet Niyogi for his help with the experimental section of the paper. This work was partially supported by Hopkins WSE startup funds, UIUC ECE startup funds, and by grants NSF CAREER IIS-0347456, NSF CAREER IIS-0447739, NSF CRS-EHS-0509151, NSF-EHS-0509101, NSF CCF-TF-0514955, ONR YIP N00014-05-1-0633 and ONR N00014-05-1-0836. René Vidal received his B.S. degree in Electrical Engineering (highest honors) from the Universidad Católica de Chile in 1997 and his M.S. and Ph.D. degrees in Electrical Engineering and Computer Sciences from the University of California at Berkeley in 2000 and 2003, respectively. In 2004, he joined The Johns Hopkins University as an Assistant Professor in the Department of Biomedical Engineering and the Center for Imaging Science. He has co-authored more than 70 articles in biomedical imaging, computer vision, machine learning, hybrid systems, robotics, and vision-based control. Dr. Vidal is recipient of the 2005 NFS CAREER Award, the 2004 Best Paper Award Honorable Mention at the European Conference on Computer Vision, the 2004 Sakrison Memorial Prize, the 2003 Eli Jury Award, and the 1997 Award of the School of Engineering of the Universidad Católica de Chile to the best graduating student of the school. Yi Ma received his two bachelors' degree in Automation and Applied Mathematics from Tsinghua University, Beijing, China in 1995. He received an M.S. degree in Electrical Engineering and Computer Science (EECS) in 1997, an M.A. degree in Mathematics in 2000, and a PhD degree in EECS in 2000 all from the University of California at Berkeley. Since August 2000, he has been on the faculty of the Electrical and Computer Engineering Department of the University of Illinois at Urbana-Champaign, where he is now an associate professor. In fall 2006, he is a visiting faculty at the Microsoft Research in Asia, Beijing, China. He has written more than 40 technical papers and is the first author of a book, entitled “An Invitation to 3-D Vision: From Images to Geometric Models,” published by Springer in 2003. Yi Ma was the recipient of the David Marr Best Paper Prize at the International Conference on Computer Vision in 1999 and Honorable Mention for the Longuet-Higgins Best Paper Award at the European Conference on Computer Vision in 2004. He received the CAREER Award from the National Science Foundation in 2004 and the Young Investigator Program Award from the Office of Naval Research in 2005.     

一种基于主成分分析的 Codebook 背景建模算法

混合高斯(Mixture of Gaussian, MOG)背景建模算法和Codebook背景建模算法被广泛应用于监控视频的运动目标检测问题,但 混合高斯的球体模型通常假设RGB三个分量是独立的, Codebook的圆柱体模型假设背景像素值在圆柱体内均匀分布且背景亮度值变化方向指向坐标原点,这 些假设使得模型对背景的描述能力下降. 本文提出了一种椭球体背景模型,该模型克服了混合高斯球体模型和Codebook圆柱体模型假设的局限 性,同时利用主成分分析(Principal components analysis, PCA)方法来刻画椭球体背景模型, 提出了一种基于主成分分析的Codebook背景建模算法.实验表明,本文算法不仅能够更准确地描述背 景像素值在RGB空间中的分布特征,而且具有良好的鲁棒性.     

基于数据场的PCA方法在人脸识别中的应用研究

数据场是一种用定量数据表达不确定概念的的数学模型,具有较强的聚类能力。论文根据数据场理论,引入势函数,提出一种基于无监督学习的模式分类方法,将其作为PCA（Prineipal Component Analysis）方法的后端分类器,应用到人脸识别中。实验表明基于数据场的PCA方法是一种有效的人脸识别算法,具有较好的鲁棒性。     

基于ANN和PCA的多牌号产品生产过程故障检测及诊断

多牌号产品生产过程经常涉及到牌号切换,而切换后新牌号生产过程的变量关系可能随之发生变化,故采用单一的故障检测和诊断方法,无法对多牌号产品连续生产过程出现的异常做出有效的判断.这就需要及时准确地识别出新牌号,并对每个牌号有相应的故障检测和诊断模型.为此,本文引入人工神经网络(ANN),将其用于牌号识别,提出了牌号识别和主成分分析(PcA)相结合的方法,即利用历史数据建立各个牌号的BP神经网络(BPNN)模型和PcA模型,在线数据经过BPNN识别确认牌号类型后,调用对应牌号的PCA模型进行故障检测和诊断.结果表明,BPNN不仅可以准确识别牌号,识别率较规格界限法更高,而且可以对牌号过渡过程进行判断.另外,与不进行牌号识别仅采用单一牌号正常样本或者所有牌号正常样本混合建立的PCA模型相比较,采用牌号识别后进行故障检测时的精度更高,证明了该方法的有效性.