As an extension to prior work by the authors in the area of photometric normalisation for face verification, we apply these algorithms in a component-based framework. In particular, we investigate how the requirement for complexity of the normalisation changes when smaller image patches are used. We show that for smaller image patches, a simpler normalisation can out-perform a more complicated method. In addition, we show that a method that applies a simpler normalisation to a number of smaller face image components that are then fused, out-performs a more complicated method applied to the full face image.