Showing papers in "Pattern Recognition Letters in 1982"

TL;DR: Several techniques are presented for measuring 'cornerity' values in gray-level images, without prior segmentation, so that corners can be detected by thresholding these values.

TL;DR: An earlier convex hull finder of the authors' is limited to polygons which remain simple when locally non-convex vertices are removed, so this paper amended its earlier algorithm so that it finds with complexity O(m) the convex Hull of any simple polygon, while retaining much of the simplicity of the earlier algorithm.

TL;DR: The efficiency of the feature vector is demonstrated through experimental results obtained with some natural texture data and a simpler quadratic mean classifier.

TL;DR: A new method for achieving this goal in an abstract metric space by selecting those models that are closest to an unknown relational description in a database of relational models.

TL;DR: The Wigner distribution can be used to rigorously define a local power-spectrum at each point of an image and an invariant representation of a given image can be obtained by applying a complex-logarithmic conformal mapping to the spatial-frequency domain of the WD.

TL;DR: Recent developments in the areas of displacement vector estimation as well as dissimilarity grading by a maximum likelihood ratio can be related to each other quantitatively in such a way that dissimilarities grading is reduced to interframe displacement estimation.

TL;DR: A simple O(n log n) algorithm is presented for computing the maximum Euclidean distance between two finite planar sets of n points when the n points form the vertices of simple polygons.

TL;DR: Two reference points of a region are defined which do not depend on the position, size and orientation of the region.

TL;DR: A parametrically-directed nearest neighbor procedure is developed to reduce the error between asymptotic and finite sample risk.

TL;DR: An implementation of digitized picture rotation and magnification based on Weiman's algorithm is presented in a programmable array machine routines to perform small transformations code efficiently.

TL;DR: This note points out that texture analysis techniques are applicable, in principle, to three-dimensional data arrays and to arrays of range (or terrain elevation) data.

TL;DR: A summary is given of the various pattern recognition situations in which continuous variables may be used for labeling objects, and solutions are discussed and an example is given.

TL;DR: Besides reducing thick responses to thin, the application of non-maximum suppression to digital gradient magnitudes also improves the form of the edge response histogram, making the choice of thresholds easier.

TL;DR: This paper addresses the problem of combining range and intensity data for scene analysis by using edge maps of the range image and of the intensity image to place both sources of information in the same form.

TL;DR: Two algorithms are described, Insert and Delete, which permit to maintain a dynamic Delaunay triangulation of the training set and argue that, from the viewpoint of computational complexity, an iterative approach using a dynamic Triangulation is most desirable.

TL;DR: Low accuracy of selection of the best version of a pattern recognition system in small test sample case is demonstrated, and it is suggested to solve several similar pattern recognition problems simultaneously simultaneously.

TL;DR: A Semantic Syntax-Directed Translation is presented, its rules are used to segment continuous speech and, at the same time, to produce phonetic interpretations.

TL;DR: Hueckel-type edge operators find the best-fitting step function to a given image neighborhood to derive some basic properties of such operators for various classes of neighborhoods.

TL;DR: It is demonstrated that it may be sufficient to use only the components of the motion vectors in the gradient direction (called the normal components) to perform the enhancement.

TL;DR: A simple proof is given that the minimum-area triangle inscribed in a convex polygon has two sides which are edges of the polygon.

TL;DR: It is shown that segmentation and extraction of motion information becomes computationally simpler in the Ego-Motion Polar (EMP) frame sequence.

TL;DR: This article presents an overview of the mathematical Theory of Shape and hints upon its application to Shape Analysis and Pattern Recognition in general.

TL;DR: A dynamic scene analysis system for the derivation of volumetric descriptions and the structures that implement the representation are described along with several techniques to modify and use the representation.