最佳多分辨率多边形近似

2004 International Conference on Image Processing, 2004. ICIP '04. Pub Date : 2004-10-24 DOI:10.1109/ICIP.2004.1421753

Alexander Kolesnikov, P. Fränti

{"title":"最佳多分辨率多边形近似","authors":"Alexander Kolesnikov, P. Fränti","doi":"10.1109/ICIP.2004.1421753","DOIUrl":null,"url":null,"abstract":"We propose optimal and near-optimal algorithm for multiresolution polygonal approximation of digital curves. The solution with minimum number of segments is constructed as the shortest path in a weighted graph where the weights are recursively defined as the number of segments of all embedded layers.","PeriodicalId":184798,"journal":{"name":"2004 International Conference on Image Processing, 2004. ICIP '04.","volume":"97 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Optimal multiresolution polygonal approximation\",\"authors\":\"Alexander Kolesnikov, P. Fränti\",\"doi\":\"10.1109/ICIP.2004.1421753\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose optimal and near-optimal algorithm for multiresolution polygonal approximation of digital curves. The solution with minimum number of segments is constructed as the shortest path in a weighted graph where the weights are recursively defined as the number of segments of all embedded layers.\",\"PeriodicalId\":184798,\"journal\":{\"name\":\"2004 International Conference on Image Processing, 2004. ICIP '04.\",\"volume\":\"97 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2004 International Conference on Image Processing, 2004. ICIP '04.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIP.2004.1421753\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 International Conference on Image Processing, 2004. ICIP '04.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIP.2004.1421753","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

提出了数字曲线多分辨率多边形逼近的最优和近最优算法。将具有最小段数的解构造为加权图中的最短路径，其中权重递归定义为所有嵌入层的段数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Optimal multiresolution polygonal approximation

We propose optimal and near-optimal algorithm for multiresolution polygonal approximation of digital curves. The solution with minimum number of segments is constructed as the shortest path in a weighted graph where the weights are recursively defined as the number of segments of all embedded layers.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2004 International Conference on Image Processing, 2004. ICIP '04.

自引率

0.00%

发文量