An architecture for calculation of the distance transform based on mathematical morphology
(2009) Norchip Conference, 2009- Abstract
- This paper presents a hardware architecture for calculating the city-block and chessboard distance transform on binary images. It is based on applying multiple morphological erosions and adding the result, enabling both processing pixels in raster scan order and a deterministic execution time. Which distance metric to be calculated is determined by the shape of the structuring element, i.e. diamonds for the city-block and squares for the chessboard. These properties together with a low memory requirement make the architecture applicable in any streaming data real-time embedded system environment with hard timing constraints, e.g. set by the frame rate. Depending on the application, a priori knowledge of the maximum size of
the... (More) - This paper presents a hardware architecture for calculating the city-block and chessboard distance transform on binary images. It is based on applying multiple morphological erosions and adding the result, enabling both processing pixels in raster scan order and a deterministic execution time. Which distance metric to be calculated is determined by the shape of the structuring element, i.e. diamonds for the city-block and squares for the chessboard. These properties together with a low memory requirement make the architecture applicable in any streaming data real-time embedded system environment with hard timing constraints, e.g. set by the frame rate. Depending on the application, a priori knowledge of the maximum size of
the clusters may be used to reduce execution time and memory requirement even further. The architecture has been implemented for both FPGA and ASIC in an embedded system environment with an image resolution of 320×240 at a frame rate of 25 fps, running at 100 MHz and 454 MHz, respectively. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1487428
- author
- Hedberg, Hugo and Öwall, Viktor LU
- organization
- publishing date
- 2009
- type
- Contribution to conference
- publication status
- published
- subject
- conference name
- Norchip Conference, 2009
- conference location
- Trondheim, Norway
- conference dates
- 2009-11-16 - 2009-11-17
- external identifiers
-
- scopus:77949634282
- language
- English
- LU publication?
- yes
- id
- b3512431-a6d4-4352-94f5-8662ff1820e8 (old id 1487428)
- date added to LUP
- 2016-04-04 13:18:02
- date last changed
- 2022-01-30 00:02:46
@misc{b3512431-a6d4-4352-94f5-8662ff1820e8,
abstract = {{This paper presents a hardware architecture for calculating the city-block and chessboard distance transform on binary images. It is based on applying multiple morphological erosions and adding the result, enabling both processing pixels in raster scan order and a deterministic execution time. Which distance metric to be calculated is determined by the shape of the structuring element, i.e. diamonds for the city-block and squares for the chessboard. These properties together with a low memory requirement make the architecture applicable in any streaming data real-time embedded system environment with hard timing constraints, e.g. set by the frame rate. Depending on the application, a priori knowledge of the maximum size of<br/><br>
the clusters may be used to reduce execution time and memory requirement even further. The architecture has been implemented for both FPGA and ASIC in an embedded system environment with an image resolution of 320×240 at a frame rate of 25 fps, running at 100 MHz and 454 MHz, respectively.}},
author = {{Hedberg, Hugo and Öwall, Viktor}},
language = {{eng}},
title = {{An architecture for calculation of the distance transform based on mathematical morphology}},
year = {{2009}},
}