{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T13:52:26Z","timestamp":1707832346612},"reference-count":8,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T00:00:00Z","timestamp":1188950400000},"content-version":"vor","delay-in-days":6456,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp; Computers in Japan"],"published-print":{"date-parts":[[1990,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper describes a fast labeling algorithm which separates regions lying all over an image based on a pipeline method. In the previous labeling algorithm of raster\u2010scan type, a bottleneck for fast processing was the label classification process to classify temporarily assigned labels based on the connectivity. To cope with this problem, consideration was given to how to reduce the number of connectivities input to the labeling process, and how to make the labeling process efficient.<\/jats:p><jats:p>For the problem of the number of connectivities, a method was developed for reducing the number of connectivities due to reshaping of a region, and a fast method for reducing the number of duplicate connectivities by introduction of a dividing process. Also, for the problem of label classification, a label classification method was developed using direct search for connectivities. Moreover, the relationship between the number of provisional labels in the labeling process and the number of connectivities was investigated. As a result, it was shown that the label classification process can be implemented in time proportional to the number of provisional labels and the effectiveness of the algorithm presented here was verified by simulation.<\/jats:p>","DOI":"10.1002\/scj.4690210507","type":"journal-article","created":{"date-parts":[[2009,11,19]],"date-time":"2009-11-19T23:28:47Z","timestamp":1258673327000},"page":"74-84","source":"Crossref","is-referenced-by-count":6,"title":["High\u2010Speed Algorithm for Component Labeling"],"prefix":"10.1002","volume":"21","author":[{"given":"Toshiyuki","family":"Gotoh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiyuki","family":"Ohta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masumi","family":"Yoshida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiaki","family":"Shirai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2007,9,6]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"ShigeruSasaki TatsuyaSatoh HiromichiIwase andToshiyukiGotoh Variable\u2010structure\u2010type video rate image processing system IDATEN. Technical Report of SIGCV of Information Processing Society of Japan CV37\u20101 (1985)."},{"key":"e_1_2_1_3_2","volume-title":"Perceptron","author":"Minsky M.","year":"1969"},{"key":"e_1_2_1_4_2","volume-title":"Digital Picture Processing","author":"Rosenfeld A.","year":"1976"},{"key":"e_1_2_1_5_2","unstructured":"YoshiakiShiraiandKokichiSugihara A method for finding connected regions and its hardware. Technical Report I.E.I.C.E. Japan IE78\u20109(1978)."},{"key":"e_1_2_1_6_2","unstructured":"YoshiyukiOkuyama YoshikiKobayashi HiroshiTakenaga KazuyoshiAsada andKazunoriFujiwara Architecture of High\u2010Performance Labeling Processor. The 31st Domestic Conf. of Information Processing Society of Japan 5P\u20107 (1985)."},{"key":"e_1_2_1_7_2","volume-title":"Graph Theory","author":"Harary F.","year":"1974"},{"key":"e_1_2_1_8_2","first-page":"662","article-title":"On topological properties of operational system for sampled figures","volume":"56","author":"Yokoi Shigeki","year":"1973","journal-title":"Trans. (D), I.E.C.E., Japan"},{"key":"e_1_2_1_9_2","first-page":"349","article-title":"Automatic Thresholding Based on Discrimination and Minimum Square Criterion","volume":"63","author":"Ohtsu Nobuyuki","year":"1980","journal-title":"Trans. (D), I.E.C.E., Japan"}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690210507","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690210507","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T02:38:07Z","timestamp":1698028687000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690210507"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":8,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["10.1002\/scj.4690210507"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690210507","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,1]]}}}