How to calculate the computational complexity
97 次查看(过去 30 天)
显示 更早的评论
hi,
I am segmenting images using region growing, Otsu methods, Fuzzy c mean methods, I wondering that how can i calculate the computational complexity of these methods? and how I can categorize in terms of performance using computational complexity? I have seen many links talking about complexity like O(n), O(n^2) Whats the difference and How I can know the complexity for my above listed methods.
Please Suggest !
1 个评论
VELAMMAL SHIVSHANKAR
2020-2-18
编辑:VELAMMAL SHIVSHANKAR
2020-2-18
Hello
https://in.mathworks.com/matlabcentral/fileexchange/43707-computational-complexity
Refer This Link. It may help you!!
采纳的回答
更多回答(2 个)
Walter Roberson
2013-12-3
There is no mechanical way to calculate computational complexity.
You should refer to papers for the complexity analysis. See for example http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.219.4060&rep=rep1&type=pdf
2 个评论
Walter Roberson
2013-12-4
See also any of the foundational books by Aho and Ullman, including http://infolab.stanford.edu/~ullman/focs/ch03.pdf
Sean
2014-3-25
I too am interested in calculating the computational complexity of a sequence of code executed in Matlab as I wish to do protyping in Matlab and then transfer it to embedded.
Ideally, the number of floating point operations or mathematical operations would be helpful.
Does Matlab have a feature such as this?
S
1 个评论
Walter Roberson
2014-3-25
No, it is not possible to calculate in general.
There are some quite simple code sequences that no-one has been able to find the computational complexity of despite many many people trying. See for example the Colatz Conjecture.
另请参阅
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!