检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]复旦大学计算机科学与工程系,上海200433 [2]上海市智能信息处理重点实验室,上海200433
出 处:《计算机研究与发展》2008年第7期1177-1182,共6页Journal of Computer Research and Development
基 金:国家自然科学基金项目(60635030,60505002);国家“八六三”高技术研究发展计划基金项目(2007AA01Z176);华为公司科技基金项目
摘 要:作为唯一远程生物认证技术,步态识别一方面越来越受到人们的重视,提出了很多相应的算法,另一方面,它又面临着很多挑战,其难点之一是如何从多帧步态中有效地提取步态特征.针对此问题,并基于步态能量图(GEI)在步态特征表示上的效果,提出了一种迭代切距离原型学习算法.假定各人的步态分布在不同流形上面,首先用切距离改进步态能量图的定义,进而用迭代的方法来解一个最优解问题,从而学习出步态原型图,再通过PCA对步态原形进行特征提取,最后进行识别.证明了该方法的收敛性,实验结果表明所提出的方法取得了比GEI更好的识别率,并证明了步态流形的假设的合理性.Being the only biometry certification techniques for remote surveillance,gait recognition,on one hand,is regarded as being of important potential value,hence a lot of algorithms have been proposed,on the other hand,it has encountered a lot of challenges.Among all of the challenges gait recognition encountered,one of them is how to extract features efficiently from a sequence of gait frames.To solve this problem,and also based on the fact that gait energy image(GEI) is effective for feature representation,an iterative prototype algorithm based on tangent distance is proposed.Firstly,it is assumed that different gaits lie in different manifolds.As a result,the proposed algorithm refines the definition of gait energy image(GEI) using tangent distance.Then an iterative algorithm is proposed to learn the prototypes by solving an optimization problem.Finally,principal component analysis(PCA) is performed on the prototypes to obtain gait features for classification.The proposed method is proved converged,and experiment results show the promising results of the proposed algorithm in accuracy compared with the GEI's.The rationality of the assumption that gaits lie in specific manifolds is also validated through experiments.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.138.154.250