Fast and Memory Efficient 2-D Connected Components Using Linked Lists of Line Segments

IEEE Transactions on Image Processing - Tập 19 Số 12 - Trang 3222-3231 - 2010
Johan De Bock1, Wilfried Philips1
1Dept. of Telecommun. & Inf. Process. (TELIN-IPI-IBBT), Ghent Univ., Ghent, Belgium

Tóm tắt

Từ khóa


Tài liệu tham khảo

haralick, 1981, some neighborhood operations, Real Time/Parallel Computing Image Analysis, 11, 10.1007/978-1-4684-3893-2_2

10.1109/ICPR.1990.118183

10.1016/j.cviu.2003.09.002

10.1145/322261.322267

10.1007/978-3-540-71457-6_53

10.1109/ICCV.2001.937655

otsu, 1979, A threshold selection method from gray-level histograms, IEEE Trans Syst Man Cybern, smc9, 62, 10.1109/TSMC.1979.4310076

10.1145/321356.321357

10.1109/TIP.2008.919369

wu, 2005, optimizing connected component labeling algorithms, Proc SPIE Conf Med Imag, 5747, 1965, 10.1117/12.596105

10.1016/0304-3975(94)00262-2

10.1145/128749.128750

10.1016/0734-189X(83)90071-3

gonzalez, 2008, Digital Image Processing

haralick, 1992, Computer and Robot Vision (Volume I)

10.1016/S1077-3142(02)00030-9