{"title":"确定任意二维形状之间的相似性及其在生物物体上的应用","authors":"P. Perner","doi":"10.15344/2456-4451/2018/139","DOIUrl":null,"url":null,"abstract":"Generalized shape models of objects are necessary to match and identify an object in an image. To acquire these kind of models special methods are necessary that allow to learn the similarity pair-wise similarity between shapes. They mainly concern is the establishment of point correspondences between two shapes and the detection of outlier. Known algorithm assume that the aligned shapes are quite similar in a way. But special problems arise if we have to align shapes that are very different, for example aligning concave to convex shapes. In such cases it is indispensable to take into account the order of the pointsets and to enforce legal sets of correspondences; otherwise the calculated distances are incorrect. We present our novel shape alignment algorithm which can also handle such cases. The algorithm establishes symmetric and legal one-to-one point correspondences between arbitrary shapes, represented as ordered sets of 2D-points and returns a distance measure which runs between 0 and 1.","PeriodicalId":31240,"journal":{"name":"International Journal of Software Engineering and Computer Systems","volume":"81 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2018-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Determining the Similarity Between Two Arbitrary 2-D Shapes and Its Application to Biological Objects\",\"authors\":\"P. Perner\",\"doi\":\"10.15344/2456-4451/2018/139\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Generalized shape models of objects are necessary to match and identify an object in an image. To acquire these kind of models special methods are necessary that allow to learn the similarity pair-wise similarity between shapes. They mainly concern is the establishment of point correspondences between two shapes and the detection of outlier. Known algorithm assume that the aligned shapes are quite similar in a way. But special problems arise if we have to align shapes that are very different, for example aligning concave to convex shapes. In such cases it is indispensable to take into account the order of the pointsets and to enforce legal sets of correspondences; otherwise the calculated distances are incorrect. We present our novel shape alignment algorithm which can also handle such cases. The algorithm establishes symmetric and legal one-to-one point correspondences between arbitrary shapes, represented as ordered sets of 2D-points and returns a distance measure which runs between 0 and 1.\",\"PeriodicalId\":31240,\"journal\":{\"name\":\"International Journal of Software Engineering and Computer Systems\",\"volume\":\"81 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Software Engineering and Computer Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.15344/2456-4451/2018/139\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Software Engineering and Computer Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15344/2456-4451/2018/139","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Determining the Similarity Between Two Arbitrary 2-D Shapes and Its Application to Biological Objects
Generalized shape models of objects are necessary to match and identify an object in an image. To acquire these kind of models special methods are necessary that allow to learn the similarity pair-wise similarity between shapes. They mainly concern is the establishment of point correspondences between two shapes and the detection of outlier. Known algorithm assume that the aligned shapes are quite similar in a way. But special problems arise if we have to align shapes that are very different, for example aligning concave to convex shapes. In such cases it is indispensable to take into account the order of the pointsets and to enforce legal sets of correspondences; otherwise the calculated distances are incorrect. We present our novel shape alignment algorithm which can also handle such cases. The algorithm establishes symmetric and legal one-to-one point correspondences between arbitrary shapes, represented as ordered sets of 2D-points and returns a distance measure which runs between 0 and 1.