基于最近特征线的图像特征提取算法分析-analysis of image feature extraction algorithm based on nearest feature line.docxVIP

基于最近特征线的图像特征提取算法分析-analysis of image feature extraction algorithm based on nearest feature line.docx

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
基于最近特征线的图像特征提取算法分析-analysis of image feature extraction algorithm based on nearest feature line

若 干 子 方 向,然 后 利 用 二 维 线 性 判 别 分 析 对 每 个 子 方 向 降 维,此 外,采 用 自 适应的方法计算每个子方向的判别力,增强算法的鲁棒性。4. 针对二维线性判别分析和邻域判别最近特征线分析直接无法应用在单 样 本 问 题 上 的 缺 陷,提 出 了 利 用 轮 廓 波 变 换 构 造 新 训 练 样 本 的 算 法,为 单 样 本问题的解决提供新的思路。关 键 词: 特 征 提 取;子 空 间 学 习;最 近 特 征 线;轮 廓 波 变 换;离 散 分 数 阶 余 弦变换AbstractImage Recognition is applied in many areas and has become a hot research topic recent years. Image feature extraction is a key step of image recognition. In statisti- cal pattern recognition, generally, the main idea of feature extraction is to project the original samples data to a low-dimension feature space, in which the samples should be distinguished easily. Most existing feature extraction algorithms are based on Euclidean distance. Because of the complexity of the distribution of image samples data, Euclidean distance may be not the optimal when it is used to measure the scatter of the image sam- ples. Nearest feature line (NFL) is a feature line measure based classifier, which has good performance in image classification and retrieval. However, it is only a classifier. In or- der to improve the learning ability, novel NFL based subspace learning algorithms are needed. This dissertation focusses on the NFL based image feature extraction algorithms and try to solve the high computational complexity and the unstablility of the NFL based algorithms to improve the feature extraction. The main contributions are as follows:For the problems of the existing NFL based subspace learning algorithms, the dissertation proposed a Simplified Nflspace algorithm and a Neighborhood Discriminant Nearest Feature Line Analysis (NDNFLA). The Simplified Nflspace only minimizes the distance between the sample and the corresponding feature line constructed by its two nearest neighbors in the same class, rather than the distance between the sample and all feature lines in the same class, so the computational complexity is reduced. NDNFLA aims to minimize the distance between sample and the feature lines constructed by its seve

您可能关注的文档

文档评论(0)

xyz118 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档