G. Cortelazzo, Giovanni Deretta, G. Mian, P. Zamperoni
{"title":"On the application of geometrical form description techniques to automatic key-sections recognition","authors":"G. Cortelazzo, Giovanni Deretta, G. Mian, P. Zamperoni","doi":"10.1109/ICPR.1992.201590","DOIUrl":null,"url":null,"abstract":"Automatic key-section recognition is approached by a two-step procedure. The first step is a screening based on arc/straight-segment classification, which associates to each key section a morphological pattern. The second step measures the string distances by means of nonlinear elastic matching among the key-sections possessing the same morphological description. Arc/straight-segment classification, a typical geometrical form description problem, is studied by two techniques, one based on Euclidean geometry notions and the other based on discrete geometry. The results achieved by the second technique appear superior. The performance of the recognition procedure on key-section databases of practical significance are very satisfactory.<<ETX>>","PeriodicalId":410961,"journal":{"name":"[1992] Proceedings. 11th IAPR International Conference on Pattern Recognition","volume":"157 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","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.201590","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Automatic key-section recognition is approached by a two-step procedure. The first step is a screening based on arc/straight-segment classification, which associates to each key section a morphological pattern. The second step measures the string distances by means of nonlinear elastic matching among the key-sections possessing the same morphological description. Arc/straight-segment classification, a typical geometrical form description problem, is studied by two techniques, one based on Euclidean geometry notions and the other based on discrete geometry. The results achieved by the second technique appear superior. The performance of the recognition procedure on key-section databases of practical significance are very satisfactory.<>