Accelerator-based implementation of the Harris algorithm - Mines Paris Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Accelerator-based implementation of the Harris algorithm

Claude Tadonki
Lionel Lacassagne
Daoudi El Mostafa
  • Fonction : Auteur
  • PersonId : 932879


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.

Dates et versions

hal-00753803 , version 1 (19-11-2012)



Claude Tadonki, Lionel Lacassagne, Dadi El Wardani, Daoudi El Mostafa. Accelerator-based implementation of the Harris algorithm. The 5th International Conference on Image and Signal Processing (ICISP 2012), Jun 2012, Agadir, Morocco. pp.485-492, ⟨10.1007/978-3-642-31254-0_55⟩. ⟨hal-00753803⟩
136 Consultations
0 Téléchargements



Gmail Facebook X LinkedIn More