Complexity analysis of algorithms

[lucy_narnia]

Homework Statement

Hello everyone. I am trying to analyse the complexity of an image processing algorithm. I have only the basic block diagram of the algorithm and I am trying to perform the complexity block by block. However, I do not know how to start and would like someone to point me in the right direction. Any help given will be much appreciated as this is part of my undergrad project.
The first step is to load the videos which does not require any operations so I'll move on to the second step which is to convert the frames to grayscale.

Homework Equations

The equation to convert frames to grayscale is 0.299*red + 0.587*green + 0.114*blue

The Attempt at a Solution

I have read numerous documents on complexity but I cannot seem to apply it to my situation. I do not have the number of frames to be converted so I was wondering if I could use a variable instead? Also, how do I go about actually analysing the complexity?

 

[Valkarie]

Do I need to use Big-Oh notation? The complexity of the algorithm will depend on the number of frames that need to be converted. To calculate the complexity, we can use Big-O notation which is a way of expressing the upper bound of the time complexity of an algorithm. In this case, the complexity of converting each frame to grayscale can be expressed using the equation 0.299*red + 0.587*green + 0.114*blue. The complexity of this equation can be expressed as O(1), since it only requires a single operation (addition). Therefore, the overall complexity of the algorithm can be expressed as O(n), where n is the number of frames that need to be converted.