Hi,

We have a question about your implementation, what do you implement ? I think you implement V ersion B, did you ever tried to implement Version A ? does it create too many artefacts ?

Is your implementation O(h*w*s) where h= height w=widht and s= number of pixel to delete in one direction (assuming we just reduce in one direction) ? or is it O(h*w) ?

Version A

1- Compute energy

2- Find all paths of least energy

3- Delete the required number of paths

Version B

1- Compute energy

2- Find one path of least energy

3- Delete this path and update energy

4- Find another path of least energy, go to step 3

Thanks for your help.

Julien