A Connected Component Labeling Algorithm for Grayscale Images and Application of the Algorithm on Mammograms

SAC '07: Proceedings of the 2007 ACM symposium on Applied computing Page 146-152 published_at 2007
アクセス数 : 951
ダウンロード数 : 271

今月のアクセス数 : 4
今月のダウンロード数 : 0
File
SAC_2007_146.pdf 153 KB 種類 : fulltext
Title ( eng )
A Connected Component Labeling Algorithm for Grayscale Images and Application of the Algorithm on Mammograms
Creator
Yapa Roshan Dharshana
Harada Koichi
Source Title
SAC '07: Proceedings of the 2007 ACM symposium on Applied computing
Start Page 146
End Page 152
Abstract
A new algorithm for connected component labeling is presented in this paper. This algorithm requires only one scan through an image for labeling connected components. Once this algorithm encounters a starting pixel of a component, it completely traces all the contour pixels and all internal pixels of that particular component. This algorithm recognizes components one at a time in the image while scanning in raster order. This property will be very useful in areas such as image matching, image registration and content-based information retrieval etc. This algorithm is also capable of extracting contour pixels of an image and storing them in the order of clock-wise direction which will provide very useful information in many applications. Also this algorithm assigns consecutive label numbers for different components and hence needs a minimum number of labels. As our main research is on mammography image analysis for diagnosing breast cancers, we applied this algorithm to mammograms and measured performance of the algorithm in terms of processing time. This will be a useful algorithm in medical image analysis as a preprocessing tool.
Keywords
Connected component labeling
Contour-tracing
Grayscale image
Binary image
Mammogram
NDC
Electrical engineering [ 540 ]
Language
eng
Resource Type conference paper
Publisher
Assoc Computing Machinery
Date of Issued 2007
Publish Type Author’s Original
Access Rights open access
Source Identifier
[ISBN] 1-59593-480-4
[DOI] 10.1145/1244002.1244040
[DOI] http://dx.doi.org/10.1145/1244002.1244040