Showing papers in "Pattern Recognition in 1982"

TL;DR: In this paper, a multilayered network consisting of neuron-like cells is proposed for pattern recognition, which is self-organized by unsupervised learning, and acquires the ability to recognize stimulus patterns according to the differences in their shapes.

TL;DR: The method is locally sensitive, hierarchic and based on the concept of limited neighbourhood sets, which means clusters that are either disjoint or homogeneous and separable by sharp changes in point density may be detected.

TL;DR: A computer method is proposed for the extraction of blood vessels from the retinal background; the recognition of arteries and veins; the detection and analysis of peculiar regions such as hemorrhages, exudates, optic discs and arterio-venous crossings.

TL;DR: It is shown that the frequently used algorithm for finding the convex hull of a simple polygon in linear running time does in fact work for a family of simple polygons known as weakly externally visible polygons.

TL;DR: Two extensions to generalized Hough transforms are described, the first allows for matching hierarchically organized point patterns, and the second concerns matching patterns of simple geometric objects, such as line segments, rather than patterns of points.

TL;DR: The procedure was tested with randomly generated synthetic data developed to simulate the frequency distribution of cover type components for four land use classes and it was found that the accuracy in discriminating between the four test classes depends upon the size of the pixel neighborhood used to compute the component frequency distribution.

TL;DR: A new method is presented, based on the discrete Fourier transform of an ordered sequence of boundary points, for measuring the circularity and ellipticity of object boundaries, together with a parametric description of their best-fitting circles or ellipses.

TL;DR: This paper introduces a new procedure, based on probability profiles, for judging the validity of clusters established from rank-order proximity data, and explains the background from graph theory and cluster analysis needed to treat cluster validity.

TL;DR: A method for stroke segmentation, i.c. a way of breaking down a character to a set of consecutive partial strokes, is proposed, which works well owing to the favourable properties of the proposed thinning technique.

TL;DR: A new algorithm for estimating motion from image sequences is presented, which is based on a least-squares solution to a set of independent linear constraints on the motion at a pixel and improved by a nonlinear smoothing operation.

TL;DR: It is shown that a chi-square test based upon a two-dimensional autore progressive model can be derived and can be used to test for differences between certain types of micro-textures and another autoregressive-based distance measure is derived which is more suitable for these cases.

TL;DR: A hybrid “split-and link” approach that combines features of both the split-and-merge and the overlapped “pyramid” approaches to segmentation is proposed.

TL;DR: This ‘tile’-based approach organizes the computation of a segmentation in such a way that parallel processors can readily be applied to cut the time required, an important advantage over previous methods, however, is this method's space-efficiency.

TL;DR: The purpose of this paper is to discuss the problem of finding a lower dimension q p which in some sense best fits the range space generated by the matrix M and provide a partial solution.

TL;DR: This technique has the potential for a more automated method of generating a near-harvest crop inventory from the satellite data in comparison to the inventory method in current use.

TL;DR: In this article, a bibliography of publications, reports and articles dealing with automated visual inspection for industry, arranged in categories by subject matter, is presented, including the visual inspection of printed circuit boards, IC chips, semiconduction photomasks, automobile parts, fabric and other electrical assemblies.

TL;DR: The letter-skeletal and skeletal-character links are presented followed by an example wherein one begins with an abstract letter description, proceeds to formulate a skeleton, and finally generates a character.

TL;DR: It is shown that Bentley's range query data structures may be used to improve the speed of the best known RNG algorithm in the L ∞ ( for k ⩾ 2) and L 1 (for k = 2) metrics.

TL;DR: A number of methods are presented for finding clusters in collinear collections of line segments using merging methods and splitting methods that make use of an evaluation function.

TL;DR: An introduction to statistical estimation and hypothesis testing methodology, which can be employed in analyzing the performance of various classifiers in a breast cancer detection task is presented.

TL;DR: Figures of merit are defined for possible linking of pairs of edge segments that continue one another or are anti-parallel to each other based on both the geometrical configuration of the segments and the gray levels associated with them.

TL;DR: The Korean alphabet is a set of phonetic symbols which are combined to form characters, somewhat in the Chinese style, which is perfect for carefully drawn characters and nearly so for characters written at an unhurried rate, provided the system is tuned to the writer's style.

TL;DR: An expression for normalization is derived using a Euclidean distance function based on the underlying continuous boundaries of the objects and their prototypes and an analysis of errors due to the quantization introduced by using a discrete grid is given.

TL;DR: A method of weighting the variables is suggested which is a part of the classification procedure and thus guarantees an improvement of the cluster clarity and is compared with such popular weighting procedures as equal variance and Mahalanobis distance.

TL;DR: The concept of bounded variation quantity is proposed as a local feature of patterns, especially waveform patterns and picture patterns, which is closely connected with the mathematically complicated concepts of total variation and distribution, but the result is shown by a simplified form for concrete calculations.

TL;DR: The application of face pattern as a medium to illustrate to man complex computer-processed medical diagnosis and a separate application of the method was performed to indicate a possible effect of corticosteroid on idiopathic nephrotic syndrome.

TL;DR: The simulation cluster analysis procedure is a method of summarizing the results of the computer simulations in order to estimate the number of groups and the group membership through the use of computer simulations.

TL;DR: Two methods for tracing the contour line of a digitized grey-scale object by following the estimated contour path directly on thegrey-scale image are described.

TL;DR: A new form of theoretical error probability is proposed which compares very favorably with the experimental error probability for Fisher's linear discriminant in object isolation of infrared images.

TL;DR: An approach to unsupervised pattern classification is discussed, based on an approximation of the probability densities of each class under the assumption that the input patterns are of a normal mixture.