ラン情報を用いた高速連結成分ラベリング
Digital data available（科学技術振興機構）
Begin reading now
J-STAGE
Holdings of Libraries in Japan
This page shows libraries in Japan other than the National Diet Library that hold the material.
Please contact your local library for information on how to use materials or whether it is possible to request materials from the holding libraries.
other
J-STAGE
DigitalCiNii Research
Search ServiceDigitalYou can check the holdings of institutions and databases with which CiNii Research is linked at the site of CiNii Research.
Bibliographic Record
You can check the details of this material, its authority (keywords that refer to materials on the same subject, author's name, etc.), etc.
- Material Type
- 記事
- Title
- Author/Editor
- 東海林 健二宮道 壽一
- Periodical title
- 電気学会論文誌. C, 電子・情報・システム部門誌 = IEEJ transactions on electronics, information and systems
- No. or year of volume/issue
- 121(2) 2001.2
- Volume
- 121
- Issue
- 2
- Pages
- 392～400
- Publication date of volume/issue (W3CDTF)
- 2001-02
- ISSN (Periodical Title)
- 0385-4221
- ISSN-L (Periodical Title)
- 0385-4221
- Publication (Periodical Title)
- 東京 : 電気学会
- Place of Publication (Country Code)
- JP
- Text Language Code
- jpn
- NDLC
- Target Audience
- 一般
- Holding library
- 国立国会図書館
- Call No.
- Z16-795
- Data Provider (Database)
- 国立国会図書館 : 国立国会図書館雑誌記事索引
- Bibliographic ID (NDL)
- 5657296
- Bibliographic Record Category (NDL)
- 632
- Summary, etc.
- This paper proposes two methods for connected component (CC) labeling with run-based way in binary images. In one method of the two, called method A, a binary image is transformed into run representation, and then each run is labeled in raster scan order. Labeled runs are transformed into a label image, finally. Labeling in raster scan order produces equivalent labels. We use the union-find algorithm with path compression and weight balancing for equivalent label maintenance. In another method, called method B, transforming of a binary image into runs and labeling of runs proceed simultaneously in raster scan order. The method B has a merit of saving memory space because only current two lines are required as run information. In the general case where both of input binary images and output label images are two-dimensional array representation, both of proposed methods are faster than the pixelwise CC labeling standard method and rnn-based label nrnnacation methods.
- DOI
- 10.1541/ieejeiss1987.121.2_392
- Access Restrictions
- インターネット公開
- Data Provider (Database)
- 科学技術振興機構 : J-STAGE
- Summary, etc.
- This paper proposes two methods for connected component (CC) labeling with run-based way in binary images. In one method of the two, called method A, a binary image is transformed into run representation, and then each run is labeled in raster scan order. Labeled runs are transformed into a label image, finally. Labeling in raster scan order produces equivalent labels. We use the union-find algorithm with path compression and weight balancing for equivalent label maintenance. In another method, called method B, transforming of a binary image into runs and labeling of runs proceed simultaneously in raster scan order. The method B has a merit of saving memory space because only current two lines are required as run information. In the general case where both of input binary images and output label images are two-dimensional array representation, both of proposed methods are faster than the pixelwise CC labeling standard method and rnn-based label nrnnacation methods.
- DOI
- 10.1541/ieejeiss1987.121.2_392
- Access Restrictions
- インターネット公開
- Related Material (URI)
- Data Provider (Database)
- 国立情報学研究所 : CiNii Research
- Original Data Provider (Database)
- Japan Link Center雑誌記事索引データベースCrossrefCiNii ArticlesCiNii Articles
- Bibliographic ID (NDL)
- 5657296
- NAID
- 13000684575610005317472