Showing papers in "Pattern Recognition in 1968"
••
TL;DR: Algorithms for computing various functions on a digital picture which depend on the distance to a given subset of the picture, which involve local operations which are performed repeatedly, "in parallel”, on every picture element and its immediate neighbors are described.
855 citations
••
TL;DR: This paper considers halfplanes as primitives and their intersections form convex polygons and the unions of the latter are arbitrary polygons, which can be then considered as approximations for arbitrary plane figures.
62 citations
••
TL;DR: This paper discusses the selection of mathematical features on the basis of entropy minimization and introduces the concept of extracting statistical features by the method of kernel approximation.
23 citations
••
TL;DR: A method was developed for automatically performing rapid measurements of the area, maximum diameter, maximum parallel radii, and degree of eccentricities of the perpendicular radii of neurons for both nucleus and perikaryon of neurons.
21 citations
••
TL;DR: A technique is described in which it is able to trade some of the potential performance of a pure two-dimensional correlator for the achievement of registration tolerance, resulting in a modified two- dimensional cross-correlation scheme that offers a significant degree of translation tolerance.
16 citations
••
TL;DR: Examples have been given to show how the description language can be used to describe complex patterns in the “character-recognition” environment by comparatively simple statements.
14 citations
••
TL;DR: The attributes of a modified discriminant function approach to evolutionarily reflective taxonomies are discussed, applied to two sets of data pertaining to species of the genus Froelichia and Centaurium.
9 citations
••
IBM1
TL;DR: A general theoretical solution to the pattern classification problem is given by a recursive Bayesian estimation procedure and several non-linear and non-normal cases are also considered.
7 citations
••
TL;DR: A general structure of an “ascending hierarchy” of sequential machines which transduce the input word to a set of pattern description vectors and a descending hierarchy of finite state pattern recognizers (automata) is proposed.
4 citations
••
TL;DR: A survey of selected non-numeric data processing projects in Western Europe was conducted in August-September, 1966 and details are given of an operational character recognition system in the U.S.R.S., as well as some of the projects active in various areas of pattern recognition research and development.
3 citations