{"title":"不变几何矩的快速计算:一种给出正确结果的新方法","authors":"Luren Yang, F. Albregtsen","doi":"10.1109/ICPR.1994.576257","DOIUrl":null,"url":null,"abstract":"Invariant geometric moments have been widely used in shape analysis and pattern recognition. Using a discrete version of Green's theorem, the authors propose a method for fast computation of the moments in binary images. The method is similar to-and as efficient as-the previous method of Li and Shen (1991). But the precision is largely improved. The new method gives exactly the same results as if the moments were computed by direct summation over the object area.","PeriodicalId":312019,"journal":{"name":"Proceedings of 12th International Conference on Pattern Recognition","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"72","resultStr":"{\"title\":\"Fast computation of invariant geometric moments: a new method giving correct results\",\"authors\":\"Luren Yang, F. Albregtsen\",\"doi\":\"10.1109/ICPR.1994.576257\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Invariant geometric moments have been widely used in shape analysis and pattern recognition. Using a discrete version of Green's theorem, the authors propose a method for fast computation of the moments in binary images. The method is similar to-and as efficient as-the previous method of Li and Shen (1991). But the precision is largely improved. The new method gives exactly the same results as if the moments were computed by direct summation over the object area.\",\"PeriodicalId\":312019,\"journal\":{\"name\":\"Proceedings of 12th International Conference on Pattern Recognition\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-10-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"72\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 12th International Conference on Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPR.1994.576257\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 12th International Conference on Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPR.1994.576257","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fast computation of invariant geometric moments: a new method giving correct results
Invariant geometric moments have been widely used in shape analysis and pattern recognition. Using a discrete version of Green's theorem, the authors propose a method for fast computation of the moments in binary images. The method is similar to-and as efficient as-the previous method of Li and Shen (1991). But the precision is largely improved. The new method gives exactly the same results as if the moments were computed by direct summation over the object area.