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?
with many thanks in advance Firas ------------------------------------------------------------------------------ Special Offer-- Download ArcSight Logger for FREE (a $49 USD value)! Finally, a world-class log management solution at an even better price-free! Download using promo code Free_Logger_4_Dev2Dev. Offer expires February 28th, so secure your free ArcSight Logger TODAY! http://p.sf.net/sfu/arcsight-sfd2d _______________________________________________ vmtk-users mailing list vmtk-users@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/vmtk-users
