While I have to agree that many things cannot be parallelized, picture processing is not the counter-example I would choose. Most picture analysis algorithms use a divide-and-conquer approach in order to gain high levels of parallelism and both FF and matrix transforms are embarrassingly parallelizeable (which means blur, recolor, sharpen, filter, grayscale, morph, clone, etc are all parallelizeable)
A better example of something that is non-parallelizable is disk access on a single disk head. While there are certainly algorithms for disk access that are better than others, because the data can only be read from the point where the head is, it's intrinsically not parallelisable to read it. (Note that some file systems scatter large files across multiple heads to sort-of get around this, but the point stands)