一种近线性时域保证的数字曲线化简算法

IF 0.7 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING Image Processing On Line Pub Date : 2011-04-06 DOI:10.5201/ipol.2014.70

Isabelle Sivignon

{"title":"一种近线性时域保证的数字曲线化简算法","authors":"Isabelle Sivignon","doi":"10.5201/ipol.2014.70","DOIUrl":null,"url":null,"abstract":"Given a digital curve and a maximum error, we propose an algorithm that computes a simplification of the curve such that the Frechet distance between the original and the simplified curve is less than the error. The algorithm uses an approximation of the Frechet distance, but a guarantee over the quality of the simplification is proved. Moreover, even if the theoretical complexity of the algorithm is in O(n log(n)), experiments show a linear behaviour in practice.","PeriodicalId":54190,"journal":{"name":"Image Processing On Line","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2011-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification Under the Fréchet Distance\",\"authors\":\"Isabelle Sivignon\",\"doi\":\"10.5201/ipol.2014.70\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Given a digital curve and a maximum error, we propose an algorithm that computes a simplification of the curve such that the Frechet distance between the original and the simplified curve is less than the error. The algorithm uses an approximation of the Frechet distance, but a guarantee over the quality of the simplification is proved. Moreover, even if the theoretical complexity of the algorithm is in O(n log(n)), experiments show a linear behaviour in practice.\",\"PeriodicalId\":54190,\"journal\":{\"name\":\"Image Processing On Line\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2011-04-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Image Processing On Line\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5201/ipol.2014.70\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Image Processing On Line","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5201/ipol.2014.70","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}

引用次数: 7

摘要

给定一条数字曲线和一个最大误差，我们提出了一种计算曲线简化的算法，使原始曲线和简化曲线之间的Frechet距离小于误差。该算法使用了Frechet距离的近似值，但证明了对简化质量的保证。此外，即使该算法的理论复杂度为O(n log(n))，实验在实践中也显示出线性行为。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification Under the Fréchet Distance

Given a digital curve and a maximum error, we propose an algorithm that computes a simplification of the curve such that the Frechet distance between the original and the simplified curve is less than the error. The algorithm uses an approximation of the Frechet distance, but a guarantee over the quality of the simplification is proved. Moreover, even if the theoretical complexity of the algorithm is in O(n log(n)), experiments show a linear behaviour in practice.

求助全文

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

来源期刊

Image Processing On Line COMPUTER SCIENCE, SOFTWARE ENGINEERING-

CiteScore

1.90

自引率

0.00%

发文量

审稿时长

16 weeks

期刊介绍： IPOL publishes relevant image processing and image analysis algorithms emphasizing the role of mathematics as a source for algorithm design. The publication is as precise and comprehensive as possible. To this aim, the publication of each algorithm is fourfold and includes: a manuscript containing the detailed description of the published algorithm, of its bibliography, along with commented examples and a failure case analysis; a software implementation of the algorithm in C, C++ or Matlab; an online demo, where the algorithm can be tested on data sets uploaded by the users; an archive containing extensive online experiments. The restricted goal of IPOL is to make accessible the algorithms in their uttermost explicit form to the scientific community. The publication of an algorithm by IPOL is different from, and complementary to a classic journal publication.

期刊最新文献

Accelerating NeRF with the Visual Hull A Brief Evaluation of InSAR Phase Denoising and Coherence Estimation with Phi-Net Survival Forest for Left-Truncated Right-Censored Data A Short Analysis of BigColor for Image Colorization A Brief Analysis of iColoriT for Interactive Image Colorization