[Insight-users] Conntecting path between two voxels?

[Luis Ibanez]

Hi Zein,

If you dont have to do this operation thousands
of times, a good option could be

1) run the itkConnectedThreshold using one of the seeds,
    and setting the thresholds in such a way that the
    intensity level of your binary image is accepted.

2) Then check if in the output image connected threshold filter,
    the position of the other seed was covered by the
    connected segmentation.

So, this will not be very fast,
but it will be very effective.

Now, shortest path finding is another business,...
this is a variational problem.

One thing you may want to look at is the FuzzyConnectedness
filter. It computes paths between a seed and all the pixels
in the image. The quality of the path is measured on various
criteria, one of them use the inntensity similarity among
the pixels belonging to a path.

http://www.itk.org/Insight/Doxygen/html/classitk_1_1SimpleFuzzyConnectednessScalarImageFilter.html



Hope that helps,


Luis


-----------------------------------------

salah wrote:
> Hello everybody,
> 
> I have a binary image which is a result of a segmentation process.
> 
> I need to determine if two interactively-given voxels are connected 
> or not, and if Yes, I need to find the (if possible shortest) path 
> connecting them.
> 
> Does ITK provide tools for conntectivity checking? shortest path
> finding? ...? 
> Or can anyone please help me doing that?
> 
> Thanks in advanced...
> 
> Zein
> 
> 
> 
> ->8<------------->8<------------->8<------------->8<------------->8<------------->8<-
> Zein I. Salah 
> University of Tübingen, WSI-GRIS, Sand 14, 72076 Tübingen 
> Email: salah@gris.uni-tuebingen.de
> Tel.: (07071) 29 75465 (GRIS),           Fax: (07071) 29 54 66
> 
> _______________________________________________
> Insight-users mailing list
> Insight-users@public.kitware.com
> http://public.kitware.com/mailman/listinfo/insight-users
>