IF WE USE 4-CONNECTEDNESS OR 8-CONNECTEDNESS FOR BOTH THE OBJECTS AND THE BACKGROUND, THE EULER CHARACTERISTIC IS NOT LOCALLY COMPUTABLE

被引：14

作者：

KONG, TY ^{[1
]}

ROSENFELD, A ^{[1
]}

机构：

[1] UNIV MARYLAND,CTR AUTOMAT RES,COLLEGE PK,MD 20742

来源：

PATTERN RECOGNITION LETTERS | 1990年 / 11卷 / 04期

关键词：

D O I：

10.1016/0167-8655(90)90060-F

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

It is well known that when we use 4-connectedness for the 1's in a binary digital image, we should use 8-connectedness for the 0's, and vice versa. Doing this insures that the connected components of 1's and 0's are 'well-behaved' in various respects; for example, the complement of a nondegenerate simple closed curve has exactly two components. It is also well known that the Euler characteristic of a binary digital image-the number of components (of 1's) minus the number of holes (components of 0's surrounded by 1's)-is locally computable; in fact, it can be computed by counting the numbers of occurrences of various local patterns of 1's in the image. The purpose of this note is to show that this property too breaks down if we use 4- or 8-connectedness for both the 0's and the 1's. © 1990.

引用

页码：231 / 232

页数：2