The number of cores per cpu is predicted to double every second year. Therefore, the opportunity to parallelise currently used algorithms in computer vision and image processing needs to be addressed sooner rather than later. A parallel feature matching approach is proposed and evaluated in Matlab. The key idea is to use different interest point detectors so that each core can work on its own subset independently of the others. However, since the image pairs are the same, the homography will be essentially the same and can therefore be distributed by the process that first finds a solution. Nevertheless, the speedup is not linear and reasons why is discussed.