{"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}
引用次数: 0
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.