Efficient neighborhood-based computations on regions using scans

9 years 9 months ago
Efficient neighborhood-based computations on regions using scans
Many basic computations can be done by means of iterative neighborhood-based calculations, including threshold, optimum, distance transform, contour closing, mathematical morphology... Some of them can be performed using rowsper-rows scans [1, 2]. Such regular computations allow to optimize the use of caches on standard architecture, and to achieve computations in good times. However, these basic computations are also useful inside the regions of the images. When applied on some regions instead of the whole image, more scans could be necessary because of the irregular shape of the regions. In this paper, we show that row-per-row scans can be used for a large class of operators, so-called idempotent r-operators (including the previously cited computations). Moreover, we give conditions on the use of scans to perform neighborhood-based computations inside any regions. Among other results, we show that only two scans allow to compute a distance transform in every regions used in classica...
Alain Mérigot, Bertrand Ducourthial, Nicola
Added 23 Oct 2009
Updated 14 Nov 2009
Type Conference
Year 2005
Where ICIP
Authors Alain Mérigot, Bertrand Ducourthial, Nicolas Sicard
Comments (0)