Segmentation Algorithm [message #18031] |
Fri, 26 November 1999 00:00  |
menafe
Messages: 3 Registered: November 1999
|
Junior Member |
|
|
Dear all,
I'm new to IDL and as such I hope you excuse my ignorance. My problem is
not really a problem but more of a question really. We've been trying to
develop an application which reads in stacks of Magnetic Resonance
Images (i.e. volume data) and then binarizes the image to leave only the
required identifiable structure and from it generates a 3D STL surface
file.
For this we use SEARCH3D, but unfortunately this uses the Marching Cubes
algorithm, which is not very good (i.e. not a smooth surface) or
economical generating polygons. Is there any other available algorithm
for this in IDL?
The "growing balloon" algorithm would be ideal for this, but we found no
mention of it on the documentation. Anyone has tried to implement this
before? I much more experienced in C than I am in IDL, so I was hoping
someone had something similar already developed. If not... oh well!
Cheerio!
AL
--
Alfonso Ferrandez | menafe@leeds.ac.uk
http://www.mech-eng.leeds.ac.uk/~ferrandez/
Bio-Engineering Research Group
The University of Leeds, UK
|
|
|
|
|
Re: Segmentation Algorithm [message #18167 is a reply to message #18031] |
Thu, 02 December 1999 00:00  |
menafe
Messages: 3 Registered: November 1999
|
Junior Member |
|
|
In article <81p5s8$bns$1@nnrp1.deja.com>,
Ronn Kling <ronn@rlkling.com> wrote:
> Al,
>
> If no one else has done this, the "growing
balloon" algorithm sounds
> like something I could use. If you have an
example in C I could turn it
> into a DLM (Dynamic Loadable Module) and send
it back to you.
>
> Ronn
>
> --
> Ronn Kling
> Ronn Kling Consulting
> www.rlkling.com
Ronn,
I don't have a C source code but Matlab code is
freely available and so are plenty of papers
about the method. Yesterday I attended a seminar
in Denmark and people have used it in conjuction
with active contours. IMPRESSIVE, I tell you, and
the maths behind it are quite simple!
Contact me by e-mail if you want more details.
Cheers!
AL
P.S. Sorry for not replying earlier, but I'm
still in Denmark, and I had to use DejaNews to
check the group.
Sent via Deja.com http://www.deja.com/
Before you buy.
|
|
|