Implementation of a Labeling Algorithm based on Contour Tracing with Feature Extraction
Authors:
- 1 May 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02714302,p. 1101-1104
Abstract
This paper describes an architecture of a connected-cluster labeling algorithm for binary images based on contour tracing with feature extraction. The implementation is intended as a hardware accelerator in a self contained real-time digital surveillance system. The algorithm has lower memory requirements compared to other labeling techniques and can guarantee labeling of a predefined number of clusters independent of their shape. In addition, features especially important in this particular application are extracted during the contour tracing with little increase in hardware complexity. The implementation is verified on an FPGA in an embedded system environment with an image resolution of 320 times 240 at a frame rate of 25 fps. The implementation supports labeling of 61 independent clusters, extracting their location, size and center of gravity.Keywords
This publication has 5 references indexed in Scilit:
- A Low Complexity Architecture for Binary Image Erosion and Dilation using Structuring Element Decomposition2005
- A linear-time component-labeling algorithm using contour tracing techniqueComputer Vision and Image Understanding, 2004
- Linear-time connected-component labeling based on sequential local operationsComputer Vision and Image Understanding, 2003
- A general approach to connected-component labeling for arbitrary image representationsJournal of the ACM, 1992
- Sequential Operations in Digital Picture ProcessingJournal of the ACM, 1966