Advertisement

Accelerator-Based implementation of the Harris Algorithm

  • Claude Tadonki
  • Lionel Lacassagne
  • Elwardani Dadi
  • Mostafa El Daoudi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7340)

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.

Keywords

Accelerator CELL BE Harris image processing tiling DMA 

References

  1. 1.
  2. 2.
    Kurzak, J., Dongarra, J.: QR factorization for the Cell Broadband Engine. Scientific Programming 17(1-2), 31–42 (2009)Google Scholar
  3. 3.
  4. 4.
    Harris, C., Stephens, M.: A combined corner and edge detector. In: 4th ALVEY Vision Conference (1988)Google Scholar
  5. 5.
    Peter Hofstee, H.: Power Efficient Processor Design and the Cell Processor, http://www.hpcaconf.org/hpca11/slides/Cell_Public_Hofstee.pdf
  6. 6.
    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)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Sen, S., Chatterjee, S.: Towards a theory of cache-efficient algorithms. In: SODA (2000)Google Scholar
  9. 9.
    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)Google Scholar
  10. 10.
    Xue, J.: Loop tiling for parallelism. Kluwer (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Claude Tadonki
    • 1
  • Lionel Lacassagne
    • 2
  • Elwardani Dadi
    • 3
  • Mostafa El Daoudi
    • 3
  1. 1.Centre de Recherche en informatique, Mathématiques et systèmesMines ParisTechFontainebleau CedexFrance
  2. 2.Institute of Fundamendal Electronics, Faculty of Sciences, Bat. 220University of OrsayOrsay CedexFrance
  3. 3.Université Mohamed Premier OujdaOujdaMorocco

Personalised recommendations