{"title":"Recognition of anatomically relevant objects with binary partition trees","authors":"T. Blaffert","doi":"10.1109/ICIP.2001.958044","DOIUrl":null,"url":null,"abstract":"In this paper we demonstrate the application of a binary partition tree to the watershed segmentation with graph merging. An adjacency graph is used to represent the regions found in a watershed transform, merging of these regions is required to combine these regions for further processing. Each node in the binary partition tree represents a larger region that results from the merging of two small regions. Starting from the root node, image areas of child nodes can successively be investigated whether they belong to a certain class of objects. In our application we are e.g. interested in finding anatomical objects such as skull, lung, or heart in an X-ray image. The outlined classification strategy considers only a few, relevant region combinations and thus permits the introduction of sophisticated classification rules without compromising overall computation time. The use of rules improves the recognition rate over simpler linear or box-type classifiers.","PeriodicalId":291827,"journal":{"name":"Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 2001 International Conference on Image Processing (Cat. No.01CH37205)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIP.2001.958044","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
In this paper we demonstrate the application of a binary partition tree to the watershed segmentation with graph merging. An adjacency graph is used to represent the regions found in a watershed transform, merging of these regions is required to combine these regions for further processing. Each node in the binary partition tree represents a larger region that results from the merging of two small regions. Starting from the root node, image areas of child nodes can successively be investigated whether they belong to a certain class of objects. In our application we are e.g. interested in finding anatomical objects such as skull, lung, or heart in an X-ray image. The outlined classification strategy considers only a few, relevant region combinations and thus permits the introduction of sophisticated classification rules without compromising overall computation time. The use of rules improves the recognition rate over simpler linear or box-type classifiers.