Lemniscate变换:一种新的高效的形状编码和表示技术

A. Kundu
{"title":"Lemniscate变换:一种新的高效的形状编码和表示技术","authors":"A. Kundu","doi":"10.1109/ICASSP.1987.1169666","DOIUrl":null,"url":null,"abstract":"In this paper, a new algorithm for visual shape coding and representation using a powerful theorem on algebraic curve has been presented. The algorithm codes the closed shape, which does never intersect itself, by means of the foci of the closed curve and a distance parameter 'p' such that the product of distances of any point on the shape from the foci is approximately constant and is equal to 'p'. The computation of the foci co-ordinates and 'p' parameter has been presented as a solution to a linearized least-square problem. The reconstruction algorithm is based on straightforward implementation of the theorem. Some experimental results have also been provided indicating the success of the algorithm.","PeriodicalId":140810,"journal":{"name":"ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing","volume":"100 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1987-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Lemniscate transform: A new efficient technique for shape coding and representation\",\"authors\":\"A. Kundu\",\"doi\":\"10.1109/ICASSP.1987.1169666\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a new algorithm for visual shape coding and representation using a powerful theorem on algebraic curve has been presented. The algorithm codes the closed shape, which does never intersect itself, by means of the foci of the closed curve and a distance parameter 'p' such that the product of distances of any point on the shape from the foci is approximately constant and is equal to 'p'. The computation of the foci co-ordinates and 'p' parameter has been presented as a solution to a linearized least-square problem. The reconstruction algorithm is based on straightforward implementation of the theorem. Some experimental results have also been provided indicating the success of the algorithm.\",\"PeriodicalId\":140810,\"journal\":{\"name\":\"ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing\",\"volume\":\"100 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1987-04-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICASSP.1987.1169666\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICASSP '87. IEEE International Conference on Acoustics, Speech, and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASSP.1987.1169666","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文利用代数曲线上的一个强大定理,提出了一种视觉形状编码和表示的新算法。该算法通过封闭曲线的焦点和距离参数p对不与自身相交的封闭形状进行编码,使得形状上任何一点到焦点的距离积近似为常数,等于p。焦点坐标和p参数的计算是线性化最小二乘问题的一种解决方法。重建算法基于定理的直接实现。实验结果表明,该算法是成功的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Lemniscate transform: A new efficient technique for shape coding and representation
In this paper, a new algorithm for visual shape coding and representation using a powerful theorem on algebraic curve has been presented. The algorithm codes the closed shape, which does never intersect itself, by means of the foci of the closed curve and a distance parameter 'p' such that the product of distances of any point on the shape from the foci is approximately constant and is equal to 'p'. The computation of the foci co-ordinates and 'p' parameter has been presented as a solution to a linearized least-square problem. The reconstruction algorithm is based on straightforward implementation of the theorem. Some experimental results have also been provided indicating the success of the algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信