Efficient representation of 2D contour using non-uniform sampling

Vibhutesh Kumar Singh, N. Rajpal
{"title":"Efficient representation of 2D contour using non-uniform sampling","authors":"Vibhutesh Kumar Singh, N. Rajpal","doi":"10.1109/SPCOM.2004.1458352","DOIUrl":null,"url":null,"abstract":"This paper presents a method of representation of an image boundary using non-uniform sampling technique. The boundary can be reconstructed back by Lagrange's interpolation of the samples. The proposed method uses an iterative procedure, which starts with uniform samples of the boundary. Then these samples are reduced to minimum by split and merge technique, which leads to non-uniform sampling of the boundary. The split and merge technique optimizes the number of control points required to represent a curve, thus achieving high compression ratios. The image boundary contour is optimally sampled to 'n' number of intervals. Then the curve is generated using Lagrange's interpolation method that passes through these n+1 points. The curve regenerated through interpolation is then compared with the original contour by weighted distance transform method Tsang, PWM et al., (1994). If the error is less than the tolerable range, then we merge two sample points to make one point and if the error is more than the tolerable range, then a new sample is added in the middle of two samples. The process is repeated till we get optimum number of sample points to reconstruct the contour. Thus only those sample points are retained which are necessary for reconstruction.","PeriodicalId":424981,"journal":{"name":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 International Conference on Signal Processing and Communications, 2004. SPCOM '04.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPCOM.2004.1458352","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

This paper presents a method of representation of an image boundary using non-uniform sampling technique. The boundary can be reconstructed back by Lagrange's interpolation of the samples. The proposed method uses an iterative procedure, which starts with uniform samples of the boundary. Then these samples are reduced to minimum by split and merge technique, which leads to non-uniform sampling of the boundary. The split and merge technique optimizes the number of control points required to represent a curve, thus achieving high compression ratios. The image boundary contour is optimally sampled to 'n' number of intervals. Then the curve is generated using Lagrange's interpolation method that passes through these n+1 points. The curve regenerated through interpolation is then compared with the original contour by weighted distance transform method Tsang, PWM et al., (1994). If the error is less than the tolerable range, then we merge two sample points to make one point and if the error is more than the tolerable range, then a new sample is added in the middle of two samples. The process is repeated till we get optimum number of sample points to reconstruct the contour. Thus only those sample points are retained which are necessary for reconstruction.
使用非均匀采样的二维轮廓的有效表示
本文提出了一种用非均匀采样技术表示图像边界的方法。通过拉格朗日插值法可以重建出边界。该方法采用迭代方法,从边界的均匀样本开始。然后通过分割合并技术将这些样本减少到最小,从而导致边界的采样不均匀。拆分和合并技术优化了表示曲线所需的控制点的数量,从而实现了高压缩比。图像边界轮廓被最佳采样到“n”个间隔。然后用拉格朗日插值法通过这n+1个点生成曲线。然后用加权距离变换方法将插值生成的曲线与原始轮廓进行比较(Tsang, PWM等,(1994))。如果误差小于可容忍范围,则将两个样本点合并为一个点,如果误差大于可容忍范围,则在两个样本的中间添加一个新样本。重复这个过程,直到我们得到最优的样本点数来重建轮廓。因此,只保留重构所必需的采样点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信