{"title":"二值图像的扩展二叉树表示及其在工程制图录入中的应用","authors":"Bin Yu, Xinggang Lin","doi":"10.1109/ICPR.1990.119339","DOIUrl":null,"url":null,"abstract":"A kind of tree structure called extended binary tree (EBT) is presented to represent the line adjacency graph (LAG) in order to reduce the computational complexities of LAG-based algorithms in binary image processing. The traversal and the storage of the EBT are discussed. Applications of the structure in engineering drawing entry are shown.<<ETX>>","PeriodicalId":135937,"journal":{"name":"[1990] Proceedings. 10th International Conference on Pattern Recognition","volume":"70 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The extended binary tree representation of binary image and its application to engineering drawing entry\",\"authors\":\"Bin Yu, Xinggang Lin\",\"doi\":\"10.1109/ICPR.1990.119339\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A kind of tree structure called extended binary tree (EBT) is presented to represent the line adjacency graph (LAG) in order to reduce the computational complexities of LAG-based algorithms in binary image processing. The traversal and the storage of the EBT are discussed. Applications of the structure in engineering drawing entry are shown.<<ETX>>\",\"PeriodicalId\":135937,\"journal\":{\"name\":\"[1990] Proceedings. 10th International Conference on Pattern Recognition\",\"volume\":\"70 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1990] Proceedings. 10th International Conference on Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPR.1990.119339\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1990] Proceedings. 10th International Conference on Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPR.1990.119339","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The extended binary tree representation of binary image and its application to engineering drawing entry
A kind of tree structure called extended binary tree (EBT) is presented to represent the line adjacency graph (LAG) in order to reduce the computational complexities of LAG-based algorithms in binary image processing. The traversal and the storage of the EBT are discussed. Applications of the structure in engineering drawing entry are shown.<>