{"title":"金字塔图像分割","authors":"H.J Antonisse","doi":"10.1016/0146-664X(82)90022-3","DOIUrl":null,"url":null,"abstract":"<div><p>A method of image segmentation was recently introduced based on defining links between pixels at adjacent levels of a “pyramid” of reduced-resolution versions of the image. This paper studies some of the problems that arise with linked-pyramid segmentation, and proposes a two-stage segmentation process that overcomes these problems.</p></div>","PeriodicalId":100313,"journal":{"name":"Computer Graphics and Image Processing","volume":"19 4","pages":"Pages 367-383"},"PeriodicalIF":0.0000,"publicationDate":"1982-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0146-664X(82)90022-3","citationCount":"0","resultStr":"{\"title\":\"Image segmentation in pyramids\",\"authors\":\"H.J Antonisse\",\"doi\":\"10.1016/0146-664X(82)90022-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>A method of image segmentation was recently introduced based on defining links between pixels at adjacent levels of a “pyramid” of reduced-resolution versions of the image. This paper studies some of the problems that arise with linked-pyramid segmentation, and proposes a two-stage segmentation process that overcomes these problems.</p></div>\",\"PeriodicalId\":100313,\"journal\":{\"name\":\"Computer Graphics and Image Processing\",\"volume\":\"19 4\",\"pages\":\"Pages 367-383\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1982-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/0146-664X(82)90022-3\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Graphics and Image Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/0146664X82900223\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Graphics and Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0146664X82900223","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A method of image segmentation was recently introduced based on defining links between pixels at adjacent levels of a “pyramid” of reduced-resolution versions of the image. This paper studies some of the problems that arise with linked-pyramid segmentation, and proposes a two-stage segmentation process that overcomes these problems.