采用增量型非负矩阵分解建模的目标跟踪算法

建立鲁棒的外观模型是目标跟踪中的关键问题,为此提出一种基于增量型非负矩阵分解的目标跟踪算法.首先根据转移概率模型在当前帧中预测得到一组图像样本;随后利用非负矩阵分解获取样本在子空间中的坐标向量;在此基础上计算样本与前一帧视频中目标图像在低维坐标向量上的相关性,以具有最大相关性的图像样本作为目标在当前帧中的图像区域;最后以增量的方式完成子空间的在线更新,提高了外观模型的更新效率,且所要求的存储空间大小恒定.实验结果表明,该算法对目标物的外观变化具有良好的自适应性,能够在视频序列中对目标进行稳定的跟踪.     

适用于小样本问题的具有类内保持的正交特征提取算法

在人脸识别中, 具有正交性的特征提取算法是一类有效的特征提取算法, 但受到小样本问题的制约. 本文在正交判别保局投影的基础上, 提出了一种适用于小样本问题的具有类内保持的正交特征提取算法. 算法根据同类样本之间的空间结构信息, 重新定义了类内散度矩阵与类间散度矩阵, 进而给出了一个新的目标函数. 然而新的目标函数对于人脸识别问题, 同样存在着小样本问题. 为此本文将原始数据空间降到一个低维的子空间, 从而避免了总体散度矩阵奇异, 并在理论上证明了在该子空间中求解判别矢量集, 等价于在原空间中求解判别矢量集. 人脸库上的实验结果表明本文算法的有效性.     

核判别随机近邻嵌入分析方法

为了有效地解决非线性特征提取中存在的鉴别效率和样本外问题,最大限度地保持观测信息,并进一步提高相关方法的降维性能,将核学习的方法应用到判别随机近邻嵌入分析方法中,提出一种核判别随机近邻嵌入分析方法.通过引入核函数,将原空间中的样本映射到高维核空间中,构建了用于反映同类和异类数据间相似度的联合概率表达式;在此基础上,引入线性投影矩阵生成对应子空间数据;最后在类内Kullback-Leiber(KL)散度最小和类间KL散度最大的准则下建立目标泛函.该方法突出了异类样本间的特征差异,使样本变得线性可分,从而提高了分类性能.在COIL-20图像库和ORL,Yale经典人脸库上进行实验,验证了文中方法的分类鉴别能力.     

采用稀疏和平滑双约束的增量正交映射非负矩阵分解目标跟踪

针对目标跟踪在遮挡和尺度变化等复杂背景下跟踪性能下降问题,联合稀疏约束、时间平滑约束以及增量投影非负矩阵分解,提出一种在线目标跟踪算法.首先利用非负矩阵分解学习一个基于部分表示的子空间,在此基础上添加稀疏约束提高处理遮挡能力,添加时间平滑约束提高算法的稳定性;然后用增量方式完成子空间的在线更新,减少算法计算量、提高外观模型更新效率;最后在粒子滤波框架下,以重构误差为基础改进了观测似然函数,将具有最大后验概率的候选目标作为目标在当前帧的图像区域.实验结果表明,在各种含有遮挡和尺度变化的视频中,该算法可以更稳定地跟踪目标.     

基于图像矩阵判别局部保持投影的人脸识别

提出一种基于图像矩阵判别局部保持投影的人脸识别方法。图像矩阵判别局部保持投影是在局部保持投影基础上进行了扩展,考虑了类标签信息并在其目标函数中增加类间散度约束,使得求解的特征更具判别性。另外,图像矩阵判别局部保持投影是直接处理图像矩阵而不需要将矩阵转化为向量,保留了像素间的空间位置关系,避免了奇异性问题。实验结果表明该方法是有效的。     

基于最小二乘回归的分块加权子空间聚类*

传统子空间聚类算法向量化时忽略样本的自然结构信息,并且容易造成高维度小样本问题,从而导致聚类信息损失.为了弥补该缺陷,文中提出基于最小二乘回归的分块加权子空间聚类(WB-LSR).首先,将样本按维度分成若干块,并求得各个块对应的仿射矩阵.然后,通过相互投票方式对各仿射矩阵设置权重,将加权和作为最终的仿射矩阵.在图像数据和视频数据上的实验表明,文中方法能有效提升聚类准确率.     

特征融合与视觉目标跟踪 *

针对跟踪过程中各类图像特征分离背景和目标能力的变化 ,提出一种基于增量判别分析的特征融合算法。该算法首先计算各特征图像的似然图 ,然后通过增量判别分析计算各特征分类性能 ,得到相应权重 ,并在此基础上求取融合似然图 ,通过粒子滤波算法确定待跟踪目标状态。通过对可见光及红外成像视频序列的仿真表明,该算法对环境光照变化、视角变化以及局部遮挡等均具有一定的鲁棒性。     

基于特征组合的人脸跟踪方法

针对复杂背景下的彩色视频序列图像,提出一种基于多特征组合的人脸跟踪方法.该方法采用肤色特征与运动特征来描述视频序列图像中的人脸,分别构造特征似然作为区分人脸目标与背景的置信度,并利用粒子滤波框架原理,用组合的特征似然来表征粒子权重.该方法中提出的自肤色检测算法避免了光线与类肤色像素对肤色特征的影响.在跟踪过程中根据分类...     

类依赖的线性判别分析

线性判别分析(LDA)是一种常用的特征提取方法,其目标是提取特征后样本的类间离散度和类内离散度的比值最大,即各类样本在特征空间中有最佳的可分离性.该方法利用同一个准则将所有类的样本投影到同一个特征空间中,忽略了各类样本分布特征的差异.本文提出类依赖的线性判别方法(Class-Specific LDA,CSLDA),对每一类样本寻找最优的投影矩阵,使得投影后能够更好地把该类样本与所有其他类的样本尽可能分开,并将该方法与经验核相结合,得到经验核空间中类依赖的线性判别分析.在人工数据集和UCI数据集上的实验结果表明,在输入空间和经验核空间里均有CSLDA特征提取后的识别率高于LDA.     

基于多任务混合噪声分布模型表示的视频跟踪

视觉跟踪中,目标信息是不确定的非线性变化过程。随时间和空间而变化的复杂动态数据中学习出较为精确的目标模板并用它来线性表示候选样本外观模型,从而使跟踪器较好地适应跟踪作业中内在或外在因素所引起的目标外观变化是视觉目标跟踪研究的重点。提出一种新颖的多任务混合噪声分布模型表示的视频跟踪算法,将候选样本外观模型假设为由一组目标模板和最小重构误差组成的多任务线性回归问题。利用经典的增量主成分分析法从高维数据中学习出一组低维子空间基向量（模板正样本）,并在线实时采样一些特殊的负样本加以扩充目标模板,再利用扩充后的新模板和独立同分布的高斯-拉普拉斯混合噪声来线性拟合当前时刻的候选目标外观模型,最后计算候选样本和真实目标之间的最大似然度,从而准确捕捉当前时刻的真实目标。在一些公认测试视频上的实验结果表明,该算法将能够在线学习较为精准的目标模板并定期更新目标在不同状态时的特殊信息,使得跟踪器始终保持最佳的状态,从而良好地适应不断发生变化的视觉信息（姿态、光照、遮挡、尺度、背景扰乱及运动模糊等）,表现出更好的鲁棒性能。     

基于核对称散布矩阵空间的特征抽取方法

为解决传统Fisher鉴别分析方法中非线性小样本的特征抽取问题,从核线性子空间角度出发,构造一种矩阵变换,得到核空间中类内散布矩阵的另一个对称核子空间,通过对2个核子空间分别求解,从而得到样本的有效鉴别信息。在NUST603和ORL人脸数据库上的实验结果验证了该算法的有效性。     

Incremental Tensor Subspace Learning and Its Applications to Foreground Segmentation and Tracking

Appearance modeling is very important for background modeling and object tracking. Subspace learning-based algorithms have been used to model the appearances of objects or scenes. Current vector subspace-based algorithms cannot effectively represent spatial correlations between pixel values. Current tensor subspace-based algorithms construct an offline representation of image ensembles, and current online tensor subspace learning algorithms cannot be applied to background modeling and object tracking. In this paper, we propose an online tensor subspace learning algorithm which models appearance changes by incrementally learning a tensor subspace representation through adaptively updating the sample mean and an eigenbasis for each unfolding matrix of the tensor. The proposed incremental tensor subspace learning algorithm is applied to foreground segmentation and object tracking for grayscale and color image sequences. The new background models capture the intrinsic spatiotemporal characteristics of scenes. The new tracking algorithm captures the appearance characteristics of an object during tracking and uses a particle filter to estimate the optimal object state. Experimental evaluations against state-of-the-art algorithms demonstrate the promise and effectiveness of the proposed incremental tensor subspace learning algorithm, and its applications to foreground segmentation and object tracking.     

Tracking While Zooming Using Affine Transfer and Multifocal Tensors

This paper presents algorithms for tracking unknown objects in the presence of zoom. Since prior models are unavailable, point and line matches in affine views are used to characterize the structure and to transfer a fixation point into new images in a sequence. Because any affine projection matrix is permitted, the intrinsic camera parameters such as focal length may change freely. Also, since the techniques do not require long feature tracks, a further desirable property is insensitivity to partial occlusion caused, for instance, by part of the object falling off the image plane while zooming in. If only point matches are available, a previous method based on factorization is applied. When also incorporating lines, the affine trifocal and quadrifocal tensors are used for tracking in monocular and stereo systems respectively. Methods for computing the tensors, minimizing algebraic error, are developed. In comparison with their projective counterparts, the affine tensors offer significant advantages in terms of computation time and convenience of parameterization, and the relations between the different tensors are shown to be much simpler. Successful tracking is demonstrated on several real image sequences.     

一种对称散布矩阵空间的人脸识别方法

为有效解决小样本问题 ,从线性子空间的角度出发 ,构造了一种矩阵变换 ,得到了类内散布矩阵的另一个对称线性子空间 ;通过对两个子空间的分别求解 ,从而得到样本有效的鉴别信息。该方法有效地解决了传统 Fisher鉴别分析方法中的最终特征维数受类别数限制的问题。在 NUST603和 ORL人脸数据库上的实验结果验证了算法的有效性。     

Incremental two-dimensional linear discriminant analysis with applications to face recognition

Two dimensional linear discriminant analysis (2DLDA) has been verified as an effective method to solve the small sample size (SSS) problem in linear discriminant analysis (LDA). However, most of the existing 2DLDA techniques do not support incremental subspace analysis for updating the discriminant eigenspace. Incremental learning has proven to enable efficient training if large amounts of training data have to be processed or if not all data are available in advance as, for example, in on-line situations. Instead of having to re-training across the entire training data whenever a new sample is added, this paper proposed an incremental two-dimensional linear discriminant analysis (I2DLDA) algorithm with closed-form solution to extract facial features of the appearance image on-line. The proposed I2DLDA inherits the advantages of the 2DLDA and the Incremental LDA (ILDA) and overcomes the number of the classes or chunk size limitation in the ILDA because the size of the between-class scatter matrix and the size of the within-class scatter matrix in the I2DLDA are much smaller than the ones in the ILDA. The results on experiments using the ORL and XM2VTS databases show that the I2DLDA is computationally more efficient than the batch 2DLDA and can achieve better recognition results than the ILDA.     

基于核的双子空间方法及其快速求解算法

针对现有的双子空间方法中存在的问题,提出一种基于核的双子空间判别分析(KDS-DA)方法。此外,还提出一种基于镶边矩阵求逆运算的快速KDS-DA特征求解算法。该算法运用高阶镶边矩阵的求逆运算可转化为低阶镶边矩阵的求逆运算这一性质,使得当顺序求解样本类内散射矩阵主空间中第r+1个KDS-DA判别矢量时,可充分利用求解第r个判别矢量时所得到的计算结果来减少算法复杂度。通过在ORL和AR人脸库上的实验证实文中方法的有效性。     

Discriminative common vectors for face recognition

In face recognition tasks, the dimension of the sample space is typically larger than the number of the samples in the training set. As a consequence, the within-class scatter matrix is singular and the linear discriminant analysis (LDA) method cannot be applied directly. This problem is known as the "small sample size" problem. In this paper, we propose a new face recognition method called the discriminative common vector method based on a variation of Fisher's linear discriminant analysis for the small sample size case. Two different algorithms are given to extract the discriminative common vectors representing each person in the training set of the face database. One algorithm uses the within-class scatter matrix of the samples in the training set while the other uses the subspace methods and the Gram-Schmidt orthogonalization procedure to obtain the discriminative common vectors. Then, the discriminative common vectors are used for classification of new faces. The proposed method yields an optimal solution for maximizing the modified Fisher's linear discriminant criterion given in the paper. Our test results show that the discriminative common vector method is superior to other methods in terms of recognition accuracy, efficiency, and numerical stability.     

Enhanced algorithm for high-dimensional data classification

Minimum class variance support vector machine (MCVSVM) and large margin linear projection (LMLP) classifier, in contrast with traditional support vector machine (SVM), take the distribution information of the data into consideration and can obtain better performance. However, in the case of the singularity of the within-class scatter matrix, both MCVSVM and LMLP only exploit the discriminant information in a single subspace of the within-class scatter matrix and discard the discriminant information in the other subspace. In this paper, a so-called twin-space support vector machine (TSSVM) algorithm is proposed to deal with the high-dimensional data classification task where the within-class scatter matrix is singular. TSSVM is rooted in both the non-null space and the null space of the within-class scatter matrix, takes full advantage of the discriminant information in the two subspaces, and so can achieve better classification accuracy. In the paper, we first discuss the linear case of TSSVM, and then develop the nonlinear TSSVM. Experimental results on real datasets validate the effectiveness of TSSVM and indicate its superior performance over MCVSVM and LMLP.     

Eigenfeature regularization and extraction in face recognition

This work proposes a subspace approach that regularizes and extracts eigenfeatures from the face image. Eigenspace of the within-class scatter matrix is decomposed into three subspaces: a reliable subspace spanned mainly by the facial variation, an unstable subspace due to noise and finite number of training samples and a null subspace. Eigenfeatures are regularized differently in these three subspaces based on an eigenspectrum model to alleviate problems of instability, over-fitting or poor generalization. This also enables the discriminant evaluation performed in the whole space. Feature extraction or dimensionality reduction occurs only at the final stage after the discriminant assessment. These efforts facilitate a discriminative and stable low-dimensional feature representation of the face image. Experiments comparing the proposed approach with some other popular subspace methods on the FERET, ORL, AR and GT databases show that our method consistently outperforms others.     

Discriminative learning and recognition of image set classes using canonical correlations

We address the problem of comparing sets of images for object recognition, where the sets may represent variations in an object's appearance due to changing camera pose and lighting conditions. canonical correlations (also known as principal or canonical angles), which can be thought of as the angles between two d-dimensional subspaces, have recently attracted attention for image set matching. Canonical correlations offer many benefits in accuracy, efficiency, and robustness compared to the two main classical methods: parametric distribution-based and nonparametric sample-based matching of sets. Here, this is first demonstrated experimentally for reasonably sized data sets using existing methods exploiting canonical correlations. Motivated by their proven effectiveness, a novel discriminative learning method over sets is proposed for set classification. Specifically, inspired by classical linear discriminant analysis (LDA), we develop a linear discriminant function that maximizes the canonical correlations of within-class sets and minimizes the canonical correlations of between-class sets. Image sets transformed by the discriminant function are then compared by the canonical correlations. Classical orthogonal subspace method (OSM) is also investigated for the similar purpose and compared with the proposed method. The proposed method is evaluated on various object recognition problems using face image sets with arbitrary motion captured under different illuminations and image sets of 500 general objects taken at different views. The method is also applied to object category recognition using ETH-80 database. The proposed method is shown to outperform the state-of-the-art methods in terms of accuracy and efficiency