凸区域矩的数字逼近

Reinhard Klette , Joviša Žunić
{"title":"凸区域矩的数字逼近","authors":"Reinhard Klette ,&nbsp;Joviša Žunić","doi":"10.1006/gmip.1999.0501","DOIUrl":null,"url":null,"abstract":"<div><p>Representation of real regions by corresponding digital pictures causes an inherent loss of information. There are infinitely many different real regions with an identical corresponding digital picture. So, there are limitations in the reconstruction of the originals and their properties from digital pictures. The problem which will be studied here is the impact of a digitization process on the efficiency in the reconstruction of the basic geometric properties of a planar convex region from the corresponding digital picture: position (usually described by the gravity center or centroid), orientation (usually described by the axis of the least second moment), and elongation (usually calculated as the ratio of the minimal and maximal second moments values w.r.t. the axis of the least second moment). Note that the size (area) estimation of the region (mostly estimated as the number of digital points belonging to the considered region) is a problem with an extensive history in number theory. We start with smooth convex regions, i.e., regions, whose boundaries have a continuous third-order derivative and positive curvature (at every point), and show that if such a planar convex region is represented by a binary picture with resolution <em>r</em>, then the mentioned features can be reconstructed with an absolute upper error bound of <span><math><mtext>O</mtext><mtext>(</mtext><mtext>1</mtext><mtext>r</mtext><msup><mi></mi><mn>15/11−ϵ</mn></msup><mtext>)≈</mtext><mtext>O</mtext><mtext>(</mtext><mtext>1</mtext><mtext>r</mtext><msup><mi></mi><mn>1.3636...</mn></msup><mtext>),</mtext></math></span> in the worst case. Since <em>r</em> is the number of pixels per unit, <span><math><mtext>1</mtext><mtext>r</mtext></math></span> is the pixel size. This result can be extended to regions which may be obtained from the previously described convex regions by finite applications of unions, intersections, or set differences. The upper error bound remains the same and converges to zero with increases in grid resolution. The given description of the speed of convergence is very sharp. Only smooth, curved regions are studied because if the considered region contains a straight section, the worst-case errors in the above estimations have <span><math><mtext>1</mtext><mtext>r</mtext></math></span> as their order of magnitude. This is a trivial result—The derivation is based on the estimation of the difference between the real moments (of the first and second order) and the corresponding discrete moments. The derived estimation can be a necessary mathematical tool in the evaluation of other procedures in the area of digital image analysis based on moment calculations.</p></div>","PeriodicalId":100591,"journal":{"name":"Graphical Models and Image Processing","volume":"61 5","pages":"Pages 274-298"},"PeriodicalIF":0.0000,"publicationDate":"1999-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1006/gmip.1999.0501","citationCount":"24","resultStr":"{\"title\":\"Digital Approximation of Moments of Convex Regions\",\"authors\":\"Reinhard Klette ,&nbsp;Joviša Žunić\",\"doi\":\"10.1006/gmip.1999.0501\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Representation of real regions by corresponding digital pictures causes an inherent loss of information. There are infinitely many different real regions with an identical corresponding digital picture. So, there are limitations in the reconstruction of the originals and their properties from digital pictures. The problem which will be studied here is the impact of a digitization process on the efficiency in the reconstruction of the basic geometric properties of a planar convex region from the corresponding digital picture: position (usually described by the gravity center or centroid), orientation (usually described by the axis of the least second moment), and elongation (usually calculated as the ratio of the minimal and maximal second moments values w.r.t. the axis of the least second moment). Note that the size (area) estimation of the region (mostly estimated as the number of digital points belonging to the considered region) is a problem with an extensive history in number theory. We start with smooth convex regions, i.e., regions, whose boundaries have a continuous third-order derivative and positive curvature (at every point), and show that if such a planar convex region is represented by a binary picture with resolution <em>r</em>, then the mentioned features can be reconstructed with an absolute upper error bound of <span><math><mtext>O</mtext><mtext>(</mtext><mtext>1</mtext><mtext>r</mtext><msup><mi></mi><mn>15/11−ϵ</mn></msup><mtext>)≈</mtext><mtext>O</mtext><mtext>(</mtext><mtext>1</mtext><mtext>r</mtext><msup><mi></mi><mn>1.3636...</mn></msup><mtext>),</mtext></math></span> in the worst case. Since <em>r</em> is the number of pixels per unit, <span><math><mtext>1</mtext><mtext>r</mtext></math></span> is the pixel size. This result can be extended to regions which may be obtained from the previously described convex regions by finite applications of unions, intersections, or set differences. The upper error bound remains the same and converges to zero with increases in grid resolution. The given description of the speed of convergence is very sharp. Only smooth, curved regions are studied because if the considered region contains a straight section, the worst-case errors in the above estimations have <span><math><mtext>1</mtext><mtext>r</mtext></math></span> as their order of magnitude. This is a trivial result—The derivation is based on the estimation of the difference between the real moments (of the first and second order) and the corresponding discrete moments. The derived estimation can be a necessary mathematical tool in the evaluation of other procedures in the area of digital image analysis based on moment calculations.</p></div>\",\"PeriodicalId\":100591,\"journal\":{\"name\":\"Graphical Models and Image Processing\",\"volume\":\"61 5\",\"pages\":\"Pages 274-298\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1006/gmip.1999.0501\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Graphical Models and Image Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1077316999905014\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Graphical Models and Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1077316999905014","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24

摘要

用相应的数字图像表示真实区域会造成固有的信息丢失。有无限多个不同的实数区域具有相同的对应数字图像。因此,从数字图像中重建原物及其属性存在局限性。这里要研究的问题是数字化过程对从相应的数字图像重建平面凸区域的基本几何性质的效率的影响:位置(通常由重心或质心描述),方向(通常由最小第二矩轴描述)和伸长(通常计算为最小第二矩轴的最小和最大第二矩值的比值)。请注意,区域的大小(面积)估计(主要估计为属于所考虑区域的数字点的数量)是数论中具有广泛历史的问题。我们从光滑凸区域开始,即边界具有连续三阶导数和正曲率的区域(在每个点),并表明如果这样的平面凸区域由分辨率为r的二值图像表示,那么在最坏的情况下,上述特征可以用O(1r15/11−λ)≈O(1r1.3636…)的绝对上误差界来重建。因为r是每单位的像素数,所以1r是像素大小。这个结果可以推广到从前面描述的凸区域中通过有限应用并、交或集差得到的区域。误差上限保持不变,并随着网格分辨率的增加收敛为零。给出的收敛速度的描述是非常尖锐的。只研究光滑、弯曲的区域,因为如果考虑的区域包含直线部分,则上述估计中的最坏情况误差的数量级为1r。这是一个微不足道的结果——推导是基于对实矩(一阶和二阶)和相应的离散矩之间差的估计。在基于矩计算的数字图像分析领域中,所导出的估计可以作为评价其他方法的必要数学工具。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Digital Approximation of Moments of Convex Regions

Representation of real regions by corresponding digital pictures causes an inherent loss of information. There are infinitely many different real regions with an identical corresponding digital picture. So, there are limitations in the reconstruction of the originals and their properties from digital pictures. The problem which will be studied here is the impact of a digitization process on the efficiency in the reconstruction of the basic geometric properties of a planar convex region from the corresponding digital picture: position (usually described by the gravity center or centroid), orientation (usually described by the axis of the least second moment), and elongation (usually calculated as the ratio of the minimal and maximal second moments values w.r.t. the axis of the least second moment). Note that the size (area) estimation of the region (mostly estimated as the number of digital points belonging to the considered region) is a problem with an extensive history in number theory. We start with smooth convex regions, i.e., regions, whose boundaries have a continuous third-order derivative and positive curvature (at every point), and show that if such a planar convex region is represented by a binary picture with resolution r, then the mentioned features can be reconstructed with an absolute upper error bound of O(1r15/11−ϵ)≈O(1r1.3636...), in the worst case. Since r is the number of pixels per unit, 1r is the pixel size. This result can be extended to regions which may be obtained from the previously described convex regions by finite applications of unions, intersections, or set differences. The upper error bound remains the same and converges to zero with increases in grid resolution. The given description of the speed of convergence is very sharp. Only smooth, curved regions are studied because if the considered region contains a straight section, the worst-case errors in the above estimations have 1r as their order of magnitude. This is a trivial result—The derivation is based on the estimation of the difference between the real moments (of the first and second order) and the corresponding discrete moments. The derived estimation can be a necessary mathematical tool in the evaluation of other procedures in the area of digital image analysis based on moment calculations.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信