Operations on binary images encoded as minimized Boolean functions

被引：6

作者：

Sarkar, D

机构：

[1] Variable Energy Cyclotron Centre, Calcutta 700 064, I/AF Bidhan Nagar

来源：

PATTERN RECOGNITION LETTERS | 1997年 / 18卷 / 05期

关键词：

encoding of binary image; minimization of Boolean functions; set operations; geometric operations;

D O I：

10.1016/S0167-8655(97)00033-0

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

A novel scheme has been devised to represent binary images as minimized Boolean functions. The blocks corresponding to the essential prime implicants are stored as ternary numbers. The scheme has been shown to be simple and very much storage-saving. Based on this new scheme, the present paper describes the formula, computational techniques and algorithms of various set operations (viz. intersection, union, complement) and geometric operations (viz. area and centroid) on binary images. The computational complexities of the algorithms are also discussed. (C) 1997 Published by Elsevier Science B.V.

引用

页码：455 / 463

页数：9

共 16 条

[1]

[Anonymous], ACM COMP SURV, DOI DOI 10.1145/356924.356930

[2]

BRAYTON RK, 1984, LOGIC MINIMIZATION A

[3] Finding neighbours on bincode-based images in O(n log log n) time [J].