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

IEEE Transactions on Image Processing

Volumn 19, Issue 12, 2010, Pages 3222-3231

  De Bock, Johan ^a   Philips, Wilfried ^a  

^a GHENT UNIVERSITY   (Belgium)

Author keywords

Connected components; linear worst case time; linked lists; memory efficient

Indexed keywords

CONNECTED COMPONENT; CONVENTIONAL ALGORITHMS; IMAGE ACCESS; LABEL IMAGES; LINE SEGMENT; LINKED LISTS; MEMORY EFFICIENT; PROCESSED IMAGES; PROCESSING TIME; RASTER SCANS; REGION CODING; SINGLE PASS; SINGLY-LINKED LIST; WORST CASE;

DATA STRUCTURES; IMAGE CODING;

ALGORITHMS;

ALGORITHM; ARTICLE; FACTUAL DATABASE; IMAGE PROCESSING; METHODOLOGY;

ALGORITHMS; DATABASES, FACTUAL; IMAGE PROCESSING, COMPUTER-ASSISTED;

EID: 78649302247     PISSN: 10577149     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIP.2010.2052826     Document Type: Article

References (16)

1. R. Haralick and L. Shapiro, Computer and Robot Vision (Volume I). Reading, MA: Addison-Wesley, 1992.
2. R. Gonzalez and R. Woods, Digital Image Processing, 3rd ed. Upper Saddle River, NJ: Prentice-Hall, 2008.
3. L. He, Y. Chao, and K. Suzuki, "A run-based two-scan labeling algorithm", IEEE Trans. Image Process., vol. 17, no. 5, pp. 749-756, May 2008.
4. A. Rosenfeld and J. Pfaltz, "Sequential operations in digital picture processing", J. ACM, vol. 13, no. 4, pp. 471-494, 1966.
5. C. Fiorio and J. Gustedt, "Two linear time union-find strategies for image processing", Theor. Comput. Sci., vol. 154, no. 2, pp. 165-181, 1996.
6. K. Wu, E. Otoo, and A. Shoshani, "Optimizing connected component labeling algorithms", in Proc. SPIE Conf. Med. Imag., 2005, vol. 5747, pp. 1965-1976.
7. R. Lumia, L. Shapiro, and O. Zuniga, "A new connected components algorithm for virtual memory computers", Comput. Vis. Graph. Image Process., vol. 22, no. 2, pp. 287-300, 1983.
8. M. Dillencourt, H. Samet, and M. Tamminen, "A general approach to connected-component labeling for arbitrary image representations", J. ACM, vol. 39, no. 2, pp. 253-280, 1992.
9. K. Suzuki, I. Horiba, and N. Sugie, "Linear-time connected-component labeling based on sequential local operations", Comput. Vis. Image Understand., vol. 89, no. 1, pp. 1-23, 2003.
10. R. Haralick, "Some neighborhood operations", Real Time/Parallel Comput. Image Anal., pp. 11-35, 1981.
11. Y. Shima, T. Murakami, M. Koga, H. Yashiro, and H. Fujisawa, "A high speed algorithm for propagation-type labeling based on block sorting of runs in binary images", in Proc. 10th Int. Conf. Pattern Recognit., 1990, vol. 90, pp. 655-658.
12. F. Chang, C. Chen, and C. Lu, "A linear-time component-labeling algorithm using contour tracing technique", Comput. Vis. Image Understand., vol. 93, no. 2, pp. 206-220, 2004.
13. H. Samet, "Connected component labeling using quadtrees", J. ACM, vol. 28, no. 3, pp. 487-501, 1981.
14. J. De Bock and W. Philips, "Line segment based watershed segmentation", in Computer Vision/Computer Graphics Collaboration Techniques. New York: Springer-Verlag, 2007, vol. 4418, pp. 579-586.
15. D. Martin, C. Fowlkes, D. Tal, and J. Malik, "A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics", in Proc. 8th Int. Conf. Comput. Vis., 2001, vol. 2, pp. 416-423.
16. N. Otsu, "A threshold selection method from gray-level histograms", IEEE Trans. Syst., Man, Cybern., vol. SMC-9, no. 1, pp. 62-66, Jan. 1979.