{"title":"边缘长度比:用于遮挡识别的仿射不变形状表示","authors":"T. Glauser, H. Bunke","doi":"10.1109/ICPR.1992.201594","DOIUrl":null,"url":null,"abstract":"The authors propose a set of local shape descriptors for polygons based on edge length ratios. These descriptors are invariant under any affine transformation, i.e. translation, scaling, rotation and projection from 3D to any 2D plane. Furthermore, they are complete in the sense that they allow the reconstruction of any polygon in 3D space given at least three consecutive vertices. The authors then consider the recognition of 2D polygonal objects under any affine transformation and in the presence of occlusion. they introduce a recognition procedure that is based on the matching of edge length ratios, using a simplified version of the standard dynamic programming procedure commonly employed for string matching.<<ETX>>","PeriodicalId":410961,"journal":{"name":"[1992] Proceedings. 11th IAPR International Conference on Pattern Recognition","volume":"351 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Edge length ratios: an affine invariant shape representation for recognition with occlusions\",\"authors\":\"T. Glauser, H. Bunke\",\"doi\":\"10.1109/ICPR.1992.201594\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors propose a set of local shape descriptors for polygons based on edge length ratios. These descriptors are invariant under any affine transformation, i.e. translation, scaling, rotation and projection from 3D to any 2D plane. Furthermore, they are complete in the sense that they allow the reconstruction of any polygon in 3D space given at least three consecutive vertices. The authors then consider the recognition of 2D polygonal objects under any affine transformation and in the presence of occlusion. they introduce a recognition procedure that is based on the matching of edge length ratios, using a simplified version of the standard dynamic programming procedure commonly employed for string matching.<<ETX>>\",\"PeriodicalId\":410961,\"journal\":{\"name\":\"[1992] Proceedings. 11th IAPR International Conference on Pattern Recognition\",\"volume\":\"351 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-08-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1992] Proceedings. 11th IAPR International Conference on Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPR.1992.201594\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1992] Proceedings. 11th IAPR International Conference on Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPR.1992.201594","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Edge length ratios: an affine invariant shape representation for recognition with occlusions
The authors propose a set of local shape descriptors for polygons based on edge length ratios. These descriptors are invariant under any affine transformation, i.e. translation, scaling, rotation and projection from 3D to any 2D plane. Furthermore, they are complete in the sense that they allow the reconstruction of any polygon in 3D space given at least three consecutive vertices. The authors then consider the recognition of 2D polygonal objects under any affine transformation and in the presence of occlusion. they introduce a recognition procedure that is based on the matching of edge length ratios, using a simplified version of the standard dynamic programming procedure commonly employed for string matching.<>
![[1992] Proceedings. 11th IAPR International Conference on Pattern Recognition](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
