On the Minimization of a Circular Function on the Isomorphic Shrunk Subset

L. Domakhina
{"title":"On the Minimization of a Circular Function on the Isomorphic Shrunk Subset","authors":"L. Domakhina","doi":"10.1109/ICCSA.2010.34","DOIUrl":null,"url":null,"abstract":"In this paper a circular shape representation isused to define a circular set for a pair of fixed shapes. This paper is an extension of an approach to shape comparison based on skeleton isomorphism proposed in [5]. The main advantage over existing approaches is mathematically correctly defined shape metrics via Hausdorff distance with the concurrent use of topology features of a shape. The circular function is proposed on the defined circular set. It has two parametersas two given shapes and two variables as two circulars. Thecircular set could be reduced to a special shrunk isomorphicsubset. The minimization of a circular function problem on ashrunk subset for a pair of shapes is proposed. The existence and reachability of minimum on this shrunk subset is proved.Effective monotone subsets are constructed to reduce thesearching of an optimal problem’s solution. The latter reduces the number of all possible subgraphs where to search the best pair to logarithmic (by skeleton edges) computational complexity comparing to the exponential total number of possible subgraphs. All the results are mathematically correct and may be useful in shape comparison and shape analysis applications where pairs of shapes are considered.","PeriodicalId":405597,"journal":{"name":"2010 International Conference on Computational Science and Its Applications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Computational Science and Its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSA.2010.34","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper a circular shape representation isused to define a circular set for a pair of fixed shapes. This paper is an extension of an approach to shape comparison based on skeleton isomorphism proposed in [5]. The main advantage over existing approaches is mathematically correctly defined shape metrics via Hausdorff distance with the concurrent use of topology features of a shape. The circular function is proposed on the defined circular set. It has two parametersas two given shapes and two variables as two circulars. Thecircular set could be reduced to a special shrunk isomorphicsubset. The minimization of a circular function problem on ashrunk subset for a pair of shapes is proposed. The existence and reachability of minimum on this shrunk subset is proved.Effective monotone subsets are constructed to reduce thesearching of an optimal problem’s solution. The latter reduces the number of all possible subgraphs where to search the best pair to logarithmic (by skeleton edges) computational complexity comparing to the exponential total number of possible subgraphs. All the results are mathematically correct and may be useful in shape comparison and shape analysis applications where pairs of shapes are considered.
关于同构收缩子集上圆函数的极小化
本文用圆形表示来定义一对固定形状的圆形集。本文是对[5]中提出的基于骨架同构的形状比较方法的扩展。与现有方法相比,该方法的主要优点是通过Hausdorff距离在数学上正确定义形状度量,并同时使用形状的拓扑特征。在定义的循环集上给出了循环函数。它有两个参数,两个给定的形状和两个变量,两个圆。圆集可以约简为一个特殊的收缩同构子集。提出了一类形状对的收缩子集上的圆函数最小化问题。证明了该缩子集上最小值的存在性和可达性。构造有效的单调子集以减少对最优问题解的搜索。后者将搜索最佳对的所有可能子图的数量减少到与可能子图的指数总数相比的对数(通过骨架边)计算复杂度。所有结果在数学上都是正确的,在考虑形状对的形状比较和形状分析应用中可能是有用的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信