Name
Title | ||
|---|---|---|
Contour chain-coding and topological hierarchy analysis in a 2×3 window single-pass raster scan |
Abstract | ||
|---|---|---|
This paper presents a fast and effective method for generating chain-encoded representations of arbitrary contours of connected regions in a binary image. Furthermore, an optional method is presented allowing the additional concurrent extraction of the topological hierarchy tree within the image. Both parts of the algorithm are executed by means of a single raster scan with a 2×3 neighborhood convolution window. This not only allows the reduction of the pixel buffer to a single image line, it furthermore enables fast neighborhood evaluation by means of a moderately sized look-up-table with 64 entries, to be directly addressed by the six pixel in window focus. With these main characteristics, the algorithm is well suited for efficient parallel processing implementations in streaming applications. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/TSP.2013.6614067 | Telecommunications and Signal Processing |
Keywords | Field | DocType |
convolution,image coding,binary image,concurrent extraction,connected region,contour chain coding,contour representation,fast neighborhood evaluation,moderately sized look up table,neighborhood convolution window,parallel processing implementations,pixel buffer,single image line,single pass raster scan,streaming application,topological hierarchy analysis,topological hierarchy tree,binary image coding,boundary extraction,chain coding,topological analysis,trees | Topology,Computer vision,Computer science,Convolution,Effective method,Free boundary condition,Binary image,Coding (social sciences),Raster scan,Artificial intelligence,Pixel,Neighborhood operation | Conference |
ISBN | Citations | PageRank |
978-1-4799-0402-0 | 0 | 0.34 |
References | Authors | |
5 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marco Scheffler | 1 | 1 | 0.73 |
| Frank Schumacher | 2 | 1 | 1.05 |
| Thomas Greiner | 3 | 34 | 7.48 |