Showing papers in "Computer Graphics and Image Processing in 1972"

TL;DR: An approximation algorithm is presented which uses an iterative method to produce polygons with a small—but not minimum—number of vertices that lie on the given curve that justifies the abandonment of the minimum-vertices criterion.

TL;DR: This paper presents a method for detecting edges in a digitized picture that has great flexibility because of the global approach and some experimental results are given, which show the performance of this method with noisy pictures.

TL;DR: A linguistic model to generate matrices (arrays of terminals) is presented and immediate application is shown in picture processing by generating a wide class of interesting pictures.

TL;DR: An up to date account of Coons methods and extensions thereof, drawing mainly on unpublished material is provided, from the stand point of the computer scientist or engineer who wishes to implement or use such methods.

TL;DR: In this article, the picture segmentation problem is formulated within the framework of numerical analysis as an optimization problem of functional approximation, and a suboptimal solution is presented together with examples of its application on the segmentation of maps and pictures from a scanning electron microscope.

TL;DR: Topics covered include picture compression; image enhancement; matched filtering, edge and curve detection; picture processing implementations; pictorial pattern recognition; picture properties; picture parts and picture description; and picture automata and grammars.

TL;DR: This paper describes an investigation of the practicality of describing pictures using linguistic structures other than strings-in particular, using labelled directed graphs (“webs”).

TL;DR: Several new extensions of quantizing space into cells which are filled with different sizes and shapes of black areas on a white background are reported here, raising intriguing questions about the physiology and psychology of vision.

TL;DR: Two algorithms for reconstructing pictures from their projections are compared, one of which is substantially improved compared to previously published versions and the results are discussed from the point of view of the applicability of the two methods.

TL;DR: An approach to pattern recognition by computer, using analysis of pattern structure, is explored using a set of Chinese characters and a method has been devised for producing a numeric code for each character.

TL;DR: This paper deals with the analysis of convex blobs, the aim of the analysis is to extract fragments of a blob which are perceptually meaningful by attributing to each point a set of boring points and finding the significant sets.

TL;DR: This paper treats the problem of determining the structure of a picture—in particular, detecting the same structure in two different pictures, by extracting line elements that reflect enough information about the original pictures that the presence of the same topological substructures in the two pictures is detected.

TL;DR: A major problem in picture processing is to detect all the contrast boundaries (or edges) in a picture, independently of the particular gray levels involved, so that nonsystematic search algorithms can be sped up.

TL;DR: The first steps towards linear-least-mean-squares techniques which can be used to develop rapid reconstruction algorithms that are also applicable to asymmetric objects with any number of electron micrographs are discussed.

TL;DR: The image restoration problem in a linear imaging system is formulated as the problem of minimizing the effective radius of the system point spread function subject to a constraint on relative noise gain by reducing the imaging system under consideration to an equivalent sampled system and subsequently optimizing the sampled system by algebraic techniques.

TL;DR: It is shown that 4-way nondeterministic finite automata (4NFAs) cannot recognize simple topological properties of twodimensional patterns, whereas 4NFAs with a finite number of markers (pebbles) available can recognize many such properties.

TL;DR: The class of stochastic context-free programmed grammars is shown to be quite effective in characterizing the structures of some pictorial patterns and to be better than that of the nondeterministic syntactic analyzer proposed earlier.

TL;DR: A parallel shrinking algorithm that operates on three-dimensional binary patterns is introduced that is obtained from the superposition of already known shrinking algorithms for two-dimensional patterns.

TL;DR: A method aimed at obtaining descriptors of textural scenes is described, based upon the spatial relationship between grey levels at picture points neighboring one another, which results in the generation of a small set of 2×2 matrices which can be used to describe the texture.

TL;DR: A description is given of the FORTRAN typographic system, which makes it possible for programmers and scientists to do their own printing of chemical, electronic, or mathematical material.

TL;DR: A method of operation which forms “good” descriptions of the drawings and has the capability of generating alternative descriptions is outlined, the descriptions formed being ordered in approximate correspondence with the relative ease of humans perceiving the particular articulation.

TL;DR: It is shown that the framework provided by COMPAX and PAX II continue to be of great value in picture parsing and identification of individual objects in a scene, as well as in the regeneration of the scene after individual objects are removed from it.

TL;DR: A high-level extensible language that allows the user to define new data types and new operations to suit his needs and to simplify subsequent programming.

TL;DR: A mathematical model of the common display data structure is given so that it may be considered independently of any particular implementation, and a method for applying this model to determine the implementation of the data structure which minimizes response time to user inputs for a given application of a given hard-ware configuration is presented.