基于遗传算法能量最小化的有理b样条书法字符边界编码

P. Bao, S. Lam
{"title":"基于遗传算法能量最小化的有理b样条书法字符边界编码","authors":"P. Bao, S. Lam","doi":"10.1109/DCC.1997.582076","DOIUrl":null,"url":null,"abstract":"Summary form only given. Traditional salient point based approaches fail in coding calligraphic characters as noisy boundaries make the extraction of the salient points a difficult task. We propose an alternative solution based on genetic algorithm which searches through the space of possible parameter values until a global optimal solution is found. The objective function we employed is a modified version of the total energy function found in the active contour literature.","PeriodicalId":403990,"journal":{"name":"Proceedings DCC '97. Data Compression Conference","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Calligraphic character boundary coding with rational B-spline based on energy minimization using genetic algorithm\",\"authors\":\"P. Bao, S. Lam\",\"doi\":\"10.1109/DCC.1997.582076\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Summary form only given. Traditional salient point based approaches fail in coding calligraphic characters as noisy boundaries make the extraction of the salient points a difficult task. We propose an alternative solution based on genetic algorithm which searches through the space of possible parameter values until a global optimal solution is found. The objective function we employed is a modified version of the total energy function found in the active contour literature.\",\"PeriodicalId\":403990,\"journal\":{\"name\":\"Proceedings DCC '97. Data Compression Conference\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings DCC '97. Data Compression Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.1997.582076\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings DCC '97. Data Compression Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.1997.582076","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

只提供摘要形式。传统的基于显著点的方法无法对书法字符进行编码,因为边界噪声使得显著点的提取变得困难。我们提出了一种基于遗传算法的替代解决方案,该算法在可能的参数值空间中搜索,直到找到全局最优解。我们采用的目标函数是在活动轮廓文献中发现的总能量函数的修改版本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Calligraphic character boundary coding with rational B-spline based on energy minimization using genetic algorithm
Summary form only given. Traditional salient point based approaches fail in coding calligraphic characters as noisy boundaries make the extraction of the salient points a difficult task. We propose an alternative solution based on genetic algorithm which searches through the space of possible parameter values until a global optimal solution is found. The objective function we employed is a modified version of the total energy function found in the active contour literature.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信