Advanced search
1 file | 653.28 KB

Fast and memory efficient 2-D connected components using linked lists of line segments

Author
Organization
Abstract
In this paper we present a more efficient approach to the problem of finding the connected components in binary images. In conventional connected components algorithms, the main data structure to compute and store the connected components is the region label image. We replace the region label image with a singly-linked list of line segments (or runs) for each region. This enables us to design a very fast and memory efficient connected components algorithm. Most conventional algorithms require (at least) two raster scans. Those that only need one raster scan, require irregular and unbounded image access. The proposed algorithm is a single pass regular access algorithm and only requires access to the three most recently processed image lines at any given time. Experimental results demonstrate that our algorithm is considerably faster than the fastest conventional algorithm. Additionally, our novel region coding data structure uses much less memory in typical cases than the traditional region label image. Even in worst case situations the processing time of our algorithm is linear with the number of pixels in an image.
Keywords
linked lists, linear worst case time, memory efficient, Connected components, OPERATIONS, LABELING ALGORITHM

Downloads

    • full text
    • |
    • UGent only
    • |
    • PDF
    • |
    • 653.28 KB

Citation

Please use this url to cite or link to this publication:

Chicago
De Bock, Johan, and Wilfried Philips. 2010. “Fast and Memory Efficient 2-D Connected Components Using Linked Lists of Line Segments.” Ieee Transactions on Image Processing 19 (12): 3222–3231.
APA
De Bock, Johan, & Philips, W. (2010). Fast and memory efficient 2-D connected components using linked lists of line segments. IEEE TRANSACTIONS ON IMAGE PROCESSING, 19(12), 3222–3231.
Vancouver
1.
De Bock J, Philips W. Fast and memory efficient 2-D connected components using linked lists of line segments. IEEE TRANSACTIONS ON IMAGE PROCESSING. 2010;19(12):3222–31.
MLA
De Bock, Johan, and Wilfried Philips. “Fast and Memory Efficient 2-D Connected Components Using Linked Lists of Line Segments.” IEEE TRANSACTIONS ON IMAGE PROCESSING 19.12 (2010): 3222–3231. Print.
@article{1074605,
  abstract     = {In this paper we present a more efficient approach to the problem of finding the connected components in binary images. In conventional connected components algorithms, the main data structure to compute and store the connected components is the region label image. We replace the region label image with a singly-linked list of line segments (or runs) for each region. This enables us to design a very fast and memory efficient connected components algorithm. Most conventional algorithms require (at least) two raster scans. Those that only need one raster scan, require irregular and unbounded image access. The proposed algorithm is a single pass regular access algorithm and only requires access to the three most recently processed image lines at any given time. Experimental results demonstrate that our algorithm is considerably faster than the fastest conventional algorithm. Additionally, our novel region coding data structure uses much less memory in typical cases than the traditional region label image. Even in worst case situations the processing time of our algorithm is linear with the number of pixels in an image.},
  author       = {De Bock, Johan and Philips, Wilfried},
  issn         = {1057-7149},
  journal      = {IEEE TRANSACTIONS ON IMAGE PROCESSING},
  keyword      = {linked lists,linear worst case time,memory efficient,Connected components,OPERATIONS,LABELING ALGORITHM},
  language     = {eng},
  number       = {12},
  pages        = {3222--3231},
  title        = {Fast and memory efficient 2-D connected components using linked lists of line segments},
  url          = {http://dx.doi.org/10.1109/TIP.2010.2052826},
  volume       = {19},
  year         = {2010},
}

Altmetric
View in Altmetric
Web of Science
Times cited: