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

DOI10.1109/TIP.2010.2052826zbMATH Open1371.94106DBLPjournals/tip/BockP10OpenAlexW2117041690WikidataQ46697843 ScholiaQ46697843MaRDI QIDQ5366609FDOQ5366609

Authors: Johan de Bock, Wilfried Philips 

Publication date: 9 October 2017

Published in: IEEE Transactions on Image Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tip.2010.2052826

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cited In (1)

• Comparative study and proof of single-pass connected components algorithms

This page was built for publication: Fast and Memory Efficient 2-D Connected Components Using Linked Lists of Line Segments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5366609)