[otb-users] Time complexity of the LSMS application

[Yazaki]

Hi otb users !

I would like to know an idea of the time complexity of the LSMS application
? Or one of this 4 applications :

i. MeanShiftSmoothing ;

ii. LSMSSegmentation ;

iii. LSMSSmallRegionsMerging ;

iv. LSMSVectorization.

I think it is very high (exponential? n^3) ^^


Thank you,

Yazaki
--
--
Check the OTB FAQ at
http://www.orfeo-toolbox.org/FAQ.html

You received this message because you are subscribed to the Google
Groups "otb-users" group.
To post to this group, send email to otb-***@googlegroups.com
To unsubscribe from this group, send email to
otb-users+***@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/otb-users?hl=en
---
You received this message because you are subscribed to the Google Groups "otb-users" group.
To unsubscribe from this group and stop receiving emails from it, send an email to otb-users+***@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.