{"title":"广义模式识别中的多尺度曲线平滑","authors":"K. Kpalma, J. Ronsin","doi":"10.1109/ISSPA.2003.1224905","DOIUrl":null,"url":null,"abstract":"In this paper, we introduce a new method for pattern characterisation in the context of pattern recognition. This method is based on the analysis of the contour of planar objects like the CSS (curvature scale space) method that uses the maxima of the curvature zero-crossing. The input contour is separated into two signals according to its coordinates x and y which are progressively low-pass filtered by decreasing the filter bandwidth. The output signals are then amplified so that the reconstructed contour and the input one have the same scale. By doing so, we detect the intersection points between both contours and then generate the intersection points map that defines features for pattern recognition. Since this method deals only with curve smoothing, it needs only a convolution operation. This way, one can reasonably hope that this method is faster than the CSS one with equivalent performances.","PeriodicalId":264814,"journal":{"name":"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A multi-scale curve smoothing for generalised pattern recognition (MSGPR)\",\"authors\":\"K. Kpalma, J. Ronsin\",\"doi\":\"10.1109/ISSPA.2003.1224905\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we introduce a new method for pattern characterisation in the context of pattern recognition. This method is based on the analysis of the contour of planar objects like the CSS (curvature scale space) method that uses the maxima of the curvature zero-crossing. The input contour is separated into two signals according to its coordinates x and y which are progressively low-pass filtered by decreasing the filter bandwidth. The output signals are then amplified so that the reconstructed contour and the input one have the same scale. By doing so, we detect the intersection points between both contours and then generate the intersection points map that defines features for pattern recognition. Since this method deals only with curve smoothing, it needs only a convolution operation. This way, one can reasonably hope that this method is faster than the CSS one with equivalent performances.\",\"PeriodicalId\":264814,\"journal\":{\"name\":\"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSPA.2003.1224905\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSPA.2003.1224905","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A multi-scale curve smoothing for generalised pattern recognition (MSGPR)
In this paper, we introduce a new method for pattern characterisation in the context of pattern recognition. This method is based on the analysis of the contour of planar objects like the CSS (curvature scale space) method that uses the maxima of the curvature zero-crossing. The input contour is separated into two signals according to its coordinates x and y which are progressively low-pass filtered by decreasing the filter bandwidth. The output signals are then amplified so that the reconstructed contour and the input one have the same scale. By doing so, we detect the intersection points between both contours and then generate the intersection points map that defines features for pattern recognition. Since this method deals only with curve smoothing, it needs only a convolution operation. This way, one can reasonably hope that this method is faster than the CSS one with equivalent performances.