Recognizing Convex Blobs
Proceedings of the First International Joint Conference on Artificial Intelligence. Pictorial Pattern Recognition. Pages 107-116.
Abstract
Because of the discrete nature of the memory and logic of a digital computer, a digital computer "sees" pictures in cellular form, each cell containing a number that represents the density of the viewed object at that cell. In particular, when the picture is binary, each cell holds a 1 or 0, depending on whether or not the viewed object is projected onto that cell. The convexity of cellular blobs- i.e., binary singly connected cellular figures - is discussed and defined in terms of the continuous blobs of which the cellular blobs are images. A theory of convex cellular blobs is sketched, and the use of the "minimum-perimeter polygon" in an algorithm for testing the convexity of cellular blobs is described.
@inproceedings{ijcai1969p12,
title = {Recognizing Convex Blobs},
author = {Sklansky, Jack},
booktitle = {Proceedings of the First International Joint Conference on
Artificial Intelligence, {IJCAI-69}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Donald E. Walker and David C. Cooper},
pages = {107--116},
year = {1969},
month = {5},
note = {Pictorial Pattern Recognition},
url = {https://ijcai.org/proceedings/1969/12},
}
TY - CPAPER TI - Recognizing Convex Blobs AU - Sklansky, Jack T2 - Proceedings of the First International Joint Conference on Artificial Intelligence, IJCAI-69 PB - International Joint Conferences on Artificial Intelligence PY - 1969 SP - 107 EP - 116 UR - https://ijcai.org/proceedings/1969/12 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: