[Insight-users] fast marching algorithm very time consuming?

[Won-Ki Jeong]

Dear all

Can anyone confirm the performance of Fast Marching in ITK 3.2? I have
tested on 256^3 volume with speed 1.0 everywhere, and put a single
seed at the center of the volume. My PC is Intel Core 2 Duo 2.4GHz
with 3G memory and winXP, and I compiled the code in release mode. I
did not set a threshold nor stopping time because I need the distance
transform. It took about 1 min on my machine, and it is not terribly
slow but seems not fast. Any comment will be appreciated.

Won-Ki


On 8/13/07, Michal Plotkowiak <michal.plotkowiak at bnc.ox.ac.uk> wrote:
> Hi,
>
> I'm segmenting 3D data of a heart using FastMarchingImageFilter program. The
> data size is 256x256x362. Every 5th slice I generate seed points (approximately
> 300 on a slice). My threshold time is 100 and stoping time 2000. When I ran the
> simulation only for 6 slices I get good results but after about an hour. When I
> tried to run the sumulation for all the slices (362) two days wasn't enough...
>
> Has anyone some experience with FastMarching algorithm? The time needed for the
> simulation seems to be far too long. Should I somehow change my approach to the
> problem?
>
> many thanks
> michal
>
>
> --
> Michal Plotkowiak
> Doctoral Researcher
> Oxford University LSI DTC
>
> _______________________________________________
> Insight-users mailing list
> Insight-users at itk.org
> http://www.itk.org/mailman/listinfo/insight-users
>