Least-squares smoothing of 3D digital curves

Ján Glasa
{"title":"Least-squares smoothing of 3D digital curves","authors":"Ján Glasa","doi":"10.1016/j.rti.2005.06.002","DOIUrl":null,"url":null,"abstract":"<div><p><span>In this paper an efficient procedure for 3D digital curve smoothing is presented. It is described by linear operators<span> which allow to perform the constrained, position invariant, least-squares smoothing of 3D digital curves minimizing the undersampling, digitizing and quantizing error and to calculate various curve characteristics and invariants related to the original digitized curve. They are represented by sparse symmetric circulant </span></span>Toeplitz matrices<span> with integer coefficients which can be efficiently realized in serial as well as in parallel manner.</span></p></div>","PeriodicalId":101062,"journal":{"name":"Real-Time Imaging","volume":"11 5","pages":"Pages 465-473"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.rti.2005.06.002","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Real-Time Imaging","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1077201405000434","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper an efficient procedure for 3D digital curve smoothing is presented. It is described by linear operators which allow to perform the constrained, position invariant, least-squares smoothing of 3D digital curves minimizing the undersampling, digitizing and quantizing error and to calculate various curve characteristics and invariants related to the original digitized curve. They are represented by sparse symmetric circulant Toeplitz matrices with integer coefficients which can be efficiently realized in serial as well as in parallel manner.

三维数字曲线的最小二乘平滑
本文提出了一种有效的三维数字曲线平滑方法。它是用线性算子来描述的,它允许对三维数字曲线进行约束、位置不变、最小二乘平滑,使欠采样、数字化和量化误差最小化,并计算与原始数字化曲线相关的各种曲线特征和不变量。它们用整数系数的稀疏对称循环Toeplitz矩阵表示,可以有效地串行和并行实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信