分支界定法在特征向量提取中的应用  

The Application of Branch and Bound Algorithm in Eigenvector Selection

作　　者：李博涛 王之琪 王秀彩[3] 

机构地区：[1]河北怀来县住房和城乡规划建设局,河北怀来075400 [2]河北怀来县环保热力公司,河北怀来075400 [3]河北建筑工程学院城建系,河北张家口075000

出　　处：《山西电子技术》2011年第2期37-38,共2页Shanxi Electronic Technology

摘　　要：着重分析了基于搜索树和解数的分支界定算法在特征向量提取中的应用,阐述了搜索树的形成原理、解数的生成过程及可分性判据。通过matlab仿真,验证了该算法在特征提取应用中的有效性和合理性。The application of Branch and Bound Algorithm based on searching tree and solving tree in eigenvector selection is analyzed in this paper.In the same time,the principle of selecting tree solving tree and separability criterion are studied;finally,the efficiency and rationality of this algorithm in eigenvector selection is verified by Matlab.

关 键 词：分支界定法 搜索树和解数 特征向量提取 可分性判据 

分 类 号：TN953[电子电信—信号与信息处理]