A Boolean characterization of three-dimensional simple points

被引：23

作者：

Bertrand, G

机构：

[1] Laboratoire PSI, ESIEE, 93162 Noisy-le-Grand Cedex, Cité Descartes

来源：

PATTERN RECOGNITION LETTERS | 1996年 / 17卷 / 02期

关键词：

simple points; three-dimensional; cubic grids; thinning algorithms; discrete topology;

D O I：

10.1016/0167-8655(95)00100-X

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

A simple point in a binary digital picture is a point belonging to the object whose removal does not change the basic connectivity features of the image. In this paper, we propose a Boolean characterization of three-dimensional simple points in cubic grids. This characterization requires the checking of 5 basic configurations in the neighborhood of the point considered.

引用

页码：115 / 124

页数：10

共 18 条

[1]

[Anonymous], 1969, Perceptrons

[2] A NEW CHARACTERIZATION OF 3-DIMENSIONAL SIMPLE POINTS [J].

BERTRAND, G ;

MALANDAIN, G .

PATTERN RECOGNITION LETTERS, 1994, 15 (02) :169-175

[3] A PARALLEL THINNING ALGORITHM FOR MEDIAL SURFACES [J].

BERTRAND, G .

PATTERN RECOGNITION LETTERS, 1995, 16 (09) :979-986

[4]

BERTRAND G, 1994, P SPIE C VISION GEOM, V2356, P113

[5]

BERTRAND G, 1992, CHARACTERIZATIONS 3

[6]

HALL RW, 1995, UNPUB TIME EFFICIENT

[7]

HALL RW, 1995, IN PRESS P IEEE INT

[8] A DIGITAL FUNDAMENTAL GROUP [J].

KONG, TY .

COMPUTERS & GRAPHICS, 1989, 13 (02) :159-166

[9] DIGITAL-TOPOLOGY - INTRODUCTION AND SURVEY [J].

KONG, TY ;

ROSENFELD, A .

COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1989, 48 (03) :357-393

[10] SIMPLE CONNECTIVITY IS NOT LOCALLY COMPUTABLE FOR CONNECTED 3D IMAGES [J].

LEE, CN ;

ROSENFELD, A .

COMPUTER VISION GRAPHICS AND IMAGE PROCESSING, 1990, 51 (01) :87-95

← 1 2 →