Journal article
A new approach to computing the Euler characteristic
Pattern recognition, Vol.28(12), pp.1955-1963
1995
DOI: 10.1016/0031-3203(95)00058-5
Abstract
In this paper we describe a new approach to computing the Euler characteristic of a three dimensional digital image. Our approach is based on computing the change in numbers of black components, tunnels and cavities in 3 × 3 × 3 neighborhood of an object (black) point due to its deletion. The existing algorithms to computing the Euler characteristic of a 3D digital image are based on counting the numbers of all k-dimensional elements (0 ≤ k ≤ 3) in a polyhedral representation of the image. Our approach can be modified for (6,26), (18,6), (6,18) and other connectivity relations of grid points. A parallel implementation of the algorithm is described using the concept of sub-fields.
Details
- Title: Subtitle
- A new approach to computing the Euler characteristic
- Creators
- P. K SAHA - Indian statistical inst., electronics communication sci. unit, Calcutta 700035, IndiaB. B CHAUDHURI - Indian statistical inst., electronics communication sci. unit, Calcutta 700035, India
- Resource Type
- Journal article
- Publication Details
- Pattern recognition, Vol.28(12), pp.1955-1963
- Publisher
- Elsevier Science; Oxford
- DOI
- 10.1016/0031-3203(95)00058-5
- ISSN
- 0031-3203
- eISSN
- 1873-5142
- Language
- English
- Date published
- 1995
- Academic Unit
- Radiology; Electrical and Computer Engineering
- Record Identifier
- 9984051736902771
Metrics
13 Record Views