On Jul 23, 9:55=A0am, J <ja...@[EMAIL PROTECTED]
> wrote:
> Hi Giulio
>
> Efficient clustering and connected components algorithms often end up
> looking extremely cryptic. =A0Connected components algorithms tend to
> look like run-length encoders with line equivalence tables, or
> optimised clustering algorithms. =A0 I have had some success and fast
> execution times developing an algorithm based on this paper, which is
> somewhere in between.
>
> "Optimising connected components labelling algorithms"
>
> http://crd.lbl.gov/~kewu/ps/LBNL-56864.pdf
>
> Regards
>
> Jason
I had a look at the paper you linked, but, if I've understand well,
the algorithms are developed for binary images, while I need to do
segmentation on 8-bit gray-level images directly (without
thresholding), to identify homogeneous zones
--> something like this:
http://spie.org/Images/Graphics/Newsroom/Im****ted/=
0016/16_fig1.jpg
PS: For binary image connected-components labelling, I implemented an
algorithm based on this paper: "A linear-time component-labeling
algorithm using contour tracing technique", i think that's very good!
|
