Hi Firas,
I send you a section of my master's thesis which contains the information you
need. To make it short, it is O(n^2) for a three dimensional image.
It was to big to attach so find the file here:
http://dl.dropbox.com/u/9419356/levelset.png
If you need more information, please let me kn
Hi Luca and the others,
assuming we have a 3D volume of size n^3 , is there a complexity term
and memeroy requirement term for levelsetsegmentation. As
levelsetsegmentation is evolving an embedding function in time, is the
complexity something like O(m*n^3) where m is the number of
iterations?
wit
