Abstract
Real-time implementations of corner detection is crucial as it is a key ingredient for other image processing kernels like pattern recognition and motion detection. Indeed, motion detection requires the analysis of a continuous flow of images, thus a real-time processing implies the use of highly optimized subroutines. We consider a tiled implementation of the Harris corner detection algorithm on the CELL processor. The algorithm is a chain of local operators applied to each pixel and its periphery. Such a special memory access pattern clearly exacerbates on the hierarchy transition penalty. In order to reduce the consequent time overhead, tiling is a commonly considered way. When it comes to image processing filters, incoming tiles are overdimensioned to include their neighborhood, necessary to update border pixels. As the volume of ”extra data” depends on the tile shape, we need to find a good tiling strategy. On the CELL, such investigation is not directly possible with native DMA routines. We overcome the problem by enhancing the DMA mechanism to operate with non conventional requests. Based on this extension, we proceed with experiments on the CELL with a wide range of tile sizes and shapes, thus trying to confirm our intuition on the optimal configuration.
Work jointly supported by ANR projects Ocelle and PetaQCD, also by the Excellence Grant of Moroccan Ministry of Higher Education. Grant No. G 08/004.
Chapter PDF
References
Cell SDK 3.0, www.ibm.com/developerworks/power/cell
Kurzak, J., Dongarra, J.: QR factorization for the Cell Broadband Engine. Scientific Programming 17(1-2), 31–42 (2009)
Harris, C., Stephens, M.: A combined corner and edge detector. In: 4th ALVEY Vision Conference (1988)
Peter Hofstee, H.: Power Efficient Processor Design and the Cell Processor, http://www.hpcaconf.org/hpca11/slides/Cell_Public_Hofstee.pdf
Saidani, T., Lacassagne, L., Falcou, J., Tadonki, C., Bouaziz, S.: Parallelization Schemes for Memory Optimization on the Cell Processor: A Case Study on the Harris Corner Detector. HIPEAC Journal (2009)
Moravec, H.: Obstacle avoidance and navigation in the real world by a seeing robot rover. In: Tech. report CMU-RI-TR-80-03, Robotics Institute, Carnegie Mellon University & doctoral dissertation, Stanford University (September 1980)
Sen, S., Chatterjee, S.: Towards a theory of cache-efficient algorithms. In: SODA (2000)
Williams, S., Shalf, J., Oliker, L., Kamil, S., Husbands, P., Yelick, K.: Scientific Computing Kernels on the Cell Processor. International Journal of Parallel Programming (2007)
Xue, J.: Loop tiling for parallelism. Kluwer (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tadonki, C., Lacassagne, L., Dadi, E., El Daoudi, M. (2012). Accelerator-Based implementation of the Harris Algorithm. In: Elmoataz, A., Mammass, D., Lezoray, O., Nouboud, F., Aboutajdine, D. (eds) Image and Signal Processing. ICISP 2012. Lecture Notes in Computer Science, vol 7340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31254-0_55
Download citation
DOI: https://doi.org/10.1007/978-3-642-31254-0_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31253-3
Online ISBN: 978-3-642-31254-0
eBook Packages: Computer ScienceComputer Science (R0)