{"title":"使用2-子域方法的并行收缩算法","authors":"Muhittin Gökmen, Richard W Hall","doi":"10.1016/0734-189X(90)90054-Y","DOIUrl":null,"url":null,"abstract":"<div><p>A class of parallel shrinking algorithms is introduced which uses two subfields arranged in a checkerboard pattern. For this class of algorithms sufficient conditions are derived for maintaining image connectivity and guaranteeing algorithm convergence and correct shrinking to single pixel residues. In comparisons with other parallel shrinking algorithms instances of the 2-subfields class are shown to exhibit substantially higher parallel speed for specific artificial and real test images.</p></div>","PeriodicalId":100319,"journal":{"name":"Computer Vision, Graphics, and Image Processing","volume":"52 2","pages":"Pages 191-209"},"PeriodicalIF":0.0000,"publicationDate":"1990-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0734-189X(90)90054-Y","citationCount":"16","resultStr":"{\"title\":\"Parallel shrinking algorithms using 2-subfields approaches\",\"authors\":\"Muhittin Gökmen, Richard W Hall\",\"doi\":\"10.1016/0734-189X(90)90054-Y\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>A class of parallel shrinking algorithms is introduced which uses two subfields arranged in a checkerboard pattern. For this class of algorithms sufficient conditions are derived for maintaining image connectivity and guaranteeing algorithm convergence and correct shrinking to single pixel residues. In comparisons with other parallel shrinking algorithms instances of the 2-subfields class are shown to exhibit substantially higher parallel speed for specific artificial and real test images.</p></div>\",\"PeriodicalId\":100319,\"journal\":{\"name\":\"Computer Vision, Graphics, and Image Processing\",\"volume\":\"52 2\",\"pages\":\"Pages 191-209\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/0734-189X(90)90054-Y\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Vision, Graphics, and Image Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/0734189X9090054Y\",\"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 Vision, Graphics, and Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0734189X9090054Y","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Parallel shrinking algorithms using 2-subfields approaches
A class of parallel shrinking algorithms is introduced which uses two subfields arranged in a checkerboard pattern. For this class of algorithms sufficient conditions are derived for maintaining image connectivity and guaranteeing algorithm convergence and correct shrinking to single pixel residues. In comparisons with other parallel shrinking algorithms instances of the 2-subfields class are shown to exhibit substantially higher parallel speed for specific artificial and real test images.