comp.lang.idl-pvwave archive: archive » Re: Fast Marching Algorithm

Home » Public Forums » archive » Re: Fast Marching Algorithm

Show: Today's Messages :: Show Polls :: Message Navigator
E-mail to friend

Re: Fast Marching Algorithm [message #70928]

Fri, 21 May 2010 12:56

Juggernaut
Messages: 83
Registered: June 2008

Member

On May 21, 12:20 pm, James <donje...@gmail.com> wrote:
> Has anyone implemented (or attempted to implement) Sethian's Fast
> Marching Method in IDL? I'd like to use it to compute wave front
> propagation in a scalar field. Here's a description:http://math.berkeley.edu/~sethian/2006/Explanati ons/fast_marching_exp...
>
> The algorithm generally uses a binary heap to keep track of the narrow
> band of neighbor *xels for the current wave front boundary. It also
> loops around the list of current boundary *xels. With all that
> looping and linked data structures, it seems like IDL might not run it
> so quickly.
>
> Matlab has this, and it seems like a pretty widely used algorithm.
> I'm surprised IDL doesn't have it built in. If there's no preexisting
> IDL implementation, I'll write a C program and post it here for anyone
> who's interested.
>
> (*xels = {pixels, voxels})

Intel's IPP library has this in a highly optimized form if you have
access. Simply wrap it and use call_external. Alas not everyone has
access....but if you're lucky enough...

Report message to a moderator

[Message index]

		Re: Fast Marching Algorithm By: Juggernaut on Fri, 21 May 2010 12:56
		Re: Fast Marching Algorithm By: James[2] on Sat, 22 May 2010 17:38

Previous Topic:	Re: how to retain header info even after writefits
Next Topic:	Help with envi_output_to_external_file

-=] Back to Top [=-

[ Syndicate this forum (XML) ] [

] [

]

Current Time: Wed Oct 08 15:06:28 PDT 2025

Total time taken to generate the page: 0.00389 seconds