An Efficient Parallel SURF Algorithm for Multi-core Processor
In this paper, we propose an efficient parallel SURF algorithm for multi-core processor, which adopts data-level parallel method to implement parallel keypoints extraction and matching. The computing tasks are assigned to four DSP cores for parallel processing. The multi-core processor utilizes QLink and SDP respectively to deal with data communication and synchronization among DSP cores, which fully develops the multi-level parallelism and the strong computing power of multi-core processor. The parallel SURF algorithm is fully tested based on 5 different image samples with scale change, rotation, change in illumination, addition of noise and affine transformation The experimental results show that the parallel SURF algorithm has good adaptability for various distorted images, good image matching ability close to the sequential algorithm and the average speedup is 3.61.
Keywordsparallel SURF image matching multi-core processor
Unable to display preview. Download preview PDF.
- 1.Todorovic, S., Ahuja, N.: Scale-invariant Region-based Hierarchical Image Matching. In: Proc. 19th International Conference on Pattern Recognition (ICPR), Tampa, FL (December 2008)Google Scholar
- 4.Bay, H., Tuytelaars, T., van Gool, L.: Speeded-up Robust Features (SURF). Computer Vision and Image Understanding (2007)Google Scholar
- 6.Viola, P., Jones, M.: Rapid object detection using a boosted cascade of simple features. In: IEEE Conference on Computer Vision and Pattern Recognition, pp. 511–518 (2001)Google Scholar
- 7.Simard, P., Bottou, L., Haffner, P.: Boxlets: a fast convolution algorithm for signal processing and neural networks. In: Advances in Neural Information Processing Systems (1999)Google Scholar