一种快速提取图像几何特征参数的算法

Cheng Yang, Rong Lu, Niannian Chen
{"title":"一种快速提取图像几何特征参数的算法","authors":"Cheng Yang, Rong Lu, Niannian Chen","doi":"10.1109/SOPO.2012.6270950","DOIUrl":null,"url":null,"abstract":"How to extract the features quickly and correctly is the essential precondition for image identification and classification. As there existing large computation problems in the traditional feature extraction algorithms, this paper proposes a faster algorithm. Firstly, the image connected region is encoded by using the Vertex Chain Code to map as a closed area. Then a unified computational framework is developed to combine the Vertex Chain Code and Discrete Green, turning surface integral into line integral. Experimental results show that this algorithm is fast and effective, and can be used for special area.","PeriodicalId":159850,"journal":{"name":"2012 Symposium on Photonics and Optoelectronics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Fast Algorithm for Image Geometric Feature Parameters Extraction\",\"authors\":\"Cheng Yang, Rong Lu, Niannian Chen\",\"doi\":\"10.1109/SOPO.2012.6270950\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"How to extract the features quickly and correctly is the essential precondition for image identification and classification. As there existing large computation problems in the traditional feature extraction algorithms, this paper proposes a faster algorithm. Firstly, the image connected region is encoded by using the Vertex Chain Code to map as a closed area. Then a unified computational framework is developed to combine the Vertex Chain Code and Discrete Green, turning surface integral into line integral. Experimental results show that this algorithm is fast and effective, and can be used for special area.\",\"PeriodicalId\":159850,\"journal\":{\"name\":\"2012 Symposium on Photonics and Optoelectronics\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Symposium on Photonics and Optoelectronics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SOPO.2012.6270950\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Symposium on Photonics and Optoelectronics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOPO.2012.6270950","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

如何快速、正确地提取图像特征是进行图像识别和分类的必要前提。针对传统的特征提取算法存在计算量大的问题,本文提出了一种更快的算法。首先,对图像连通区域进行编码,利用顶点链编码将连通区域映射为封闭区域;然后建立了统一的计算框架,将顶点链码与离散绿码相结合,将曲面积分转化为线积分。实验结果表明,该算法快速有效,可用于特殊区域。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Fast Algorithm for Image Geometric Feature Parameters Extraction
How to extract the features quickly and correctly is the essential precondition for image identification and classification. As there existing large computation problems in the traditional feature extraction algorithms, this paper proposes a faster algorithm. Firstly, the image connected region is encoded by using the Vertex Chain Code to map as a closed area. Then a unified computational framework is developed to combine the Vertex Chain Code and Discrete Green, turning surface integral into line integral. Experimental results show that this algorithm is fast and effective, and can be used for special area.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信