I am trying to understand how to calculate the Big O i.e. the spatial complexity of Image steganography Techniques but I did not find enough information to understand this topic, can someone explain me or provide me some good resources for it. Thanks
Dear Faizan,
First you must know how to analyze algorithms, for this you can learn about Asymptotic notation and analysis say from Cormen et al. "Introduction to Algorithms" or any similar resource.
Second, you must analyze a particular technique (algorithm) of your interest. Please refer to the articles that give you a detailed algorithm then analyze its space (or time) requirements. For example, one such technique is explained in: http://ieeexplore.ieee.org/document/4370824/?arnumber=4370824&tag=1
Typically understanding the underlying math (and the corr. complexity) is the challenging part.
I am not sure whether you are interested in the space complexity. To my knowledge, it typically is just the size of the image. The time complexity is the one that varies according to the algorithm.
Hope this helps. Best regards.
- Badges
- Science topic
- Similar topics
- Medicine
- Oncology
- Cancer Research