This article is within the scope of WikiProject Robotics, a collaborative effort to improve the coverage of Robotics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.RoboticsWikipedia:WikiProject RoboticsTemplate:WikiProject RoboticsRobotics articles
Is it worth adding text about doing connected component labeling in a distributed parallel setting? There are significant scientific challenges to do doing this. SeanAhern (talk) 14:23, 6 October 2009 (UTC)[reply]
This is definitely not MATLAB: := is not a thing, and neither is end for. It could be Octave, but I doubt it. The end for would have to be endfor at the very least. I don't know if there's a := in Octave either. Mr. Neo Anderson (talk) 15:55, 5 May 2020 (UTC)[reply]
The pseudocode for the one-pass algorithm could be improved by linking to the union/find algorithm and by de-matlabing it (bsxfun). The goal should be that people can really understand how it works without running into "magic black box" functions. 87.149.159.77 (talk) 14:33, 11 March 2015 (UTC)[reply]
Thank you, I added the "one component at a time" section. I was originally trying to implement the algorithms in this page, but they were very hard to implement and understand. Some time later, while I was reading Vincent and Soille's 1991 paper on Watershed segmentation, I saw that in one of their steps they had used this algorithm. It was fascinatingly easy to implement, fast and most importantly very easy to understand. So I added it here. I should have added the reference at that time. I am sorry for that. I will add it tomorrow. http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=87344&url=http%3A%2F%2Fieeexplore.ieee.org%2Fiel1%2F34%2F2845%2F00087344Mohammad Akhlaghi (talk) 14:58, 16 February 2015 (UTC)[reply]
The "One-pass version" is (algorithmically) identical to the graph traversal (BFS or DFS). Deleting it would be a first step towards making this article better. 141.3.24.81 (talk) 15:37, 19 February 2016 (UTC)[reply]
I believe the author of this graphic is trying to show that the CCL proceeds with preferred directions. What is missing it that pixel connectivity is limited to euclidean (up/down, left/right) vs allowing diagonals. I think that is too many concepts at once. I only guess the preferred direction from having seen an algorithm in ImageJ. For example Wand.java. 206.223.175.102 (talk) 12:47, 8 May 2020 (UTC)[reply]