{"title":"An improved linked pyramid for texture segmentation using the fractal Brownian model","authors":"E. J. Eijlers, E. Backer, J. J. Gerbrands","doi":"10.1109/ICPR.1990.118193","DOIUrl":null,"url":null,"abstract":"The usefulness of the fractal Brownian model in combination with pyramidal data structures is discussed. The model enables one to optimize the initialization of the texture pyramid. The ideas which are applied during the initialization phase are also applied during the segmentation. The segmentation algorithm is based on the complete linked pyramid and does not require prior knowledge about the number of segments. The segmentation result is obtained by walking along the links, guided by an error measure. The method does not require any predefined thresholds. All experimental PC program has been developed for the 1-D case.<<ETX>>","PeriodicalId":135937,"journal":{"name":"[1990] Proceedings. 10th International Conference on Pattern Recognition","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","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.118193","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
The usefulness of the fractal Brownian model in combination with pyramidal data structures is discussed. The model enables one to optimize the initialization of the texture pyramid. The ideas which are applied during the initialization phase are also applied during the segmentation. The segmentation algorithm is based on the complete linked pyramid and does not require prior knowledge about the number of segments. The segmentation result is obtained by walking along the links, guided by an error measure. The method does not require any predefined thresholds. All experimental PC program has been developed for the 1-D case.<>