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

TL;DR: A method for the determination of lightness from image intensity is presented, which is two-dimensional and depends on the different spatial distribution of these two components of image intensity.

TL;DR: An extension of the algorithm to generate 3-D curves is described, along with techniques for their application to surface representation, nonlinear interpolation, and direction of numerically controlled milling machines and similar devices.

TL;DR: This report discusses an algorithm for converting the point-sequence description to an analytic description using conic arcs and straight-line segments.

TL;DR: This paper describes the construction of strings representing straight lines in an arbitrary direction on a grid and compares some grammatical systems that generate these strings and compares them to Lindenmayer grammars, which are quite useless but still very convenient.

TL;DR: The purpose of this paper is to describe briefly the feature evaluation, the system design and implementation, and some techniques of picture processing used in the CYBEST system.

TL;DR: Kolam designs of South Indian folk art are treated as examples of two-dimensional picture languages, and many of the complicated kolain patterns are seen to be generable by context-free array grammars.

TL;DR: Various versions of unsharp masking are described together with the related dynamic exposure control techniques.

TL;DR: The results indicate that the concepts of neighborhood and neighborhood angle are adequate for simulation at a local level, but that global properties relating to shape require further investigation.

TL;DR: This algorithm has been tested to locate the heart boundary on PA chest x-ray pictures and it is found that this algorithm will successfully extract theheart boundary even in very noisy backgrounds.

TL;DR: This paper states that there is a four-pebble automaton that halts on the leftmost point of the row of its input pattern containing its starting point, and a five-Pebble Automaton thatHalts after traversing arbitrary patterns.

TL;DR: A sufficient condition is given in order that a simple arc of the contour be concave and a parallel process is shown by means of which one point of concavity is detected in correspondence to every concave arc.

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

TL;DR: The results obtaining by the present method on hand printed alphanumerics are better than those obtained by the existing methods, the extraction of turning and end points also facilitates coding and easy recognition of the given patterns.

TL;DR: A computer program which can distinguish printed text from photographs, line drawings, and other nontext material is discussed.

TL;DR: A preliminary implementation of a new language, IMPROC, for performing many of the “routine” but complicated tasks of image processing in the electron microscopical context is described, based on a library of precompiled routines written in a high level language.

TL;DR: This paper describes a technique for the reconstruction of an arbitrary straight-edge, wire-frame object from two or more central projections and shows that for any particular configuration of projection planes (and centers), it is possible to specify an object which cannot be reconstructed.

TL;DR: The application of generalized inverses of matrices for reconstruction of objects from their projections is considered to recursively improve the reconstructed estimate using a stream of additional projection data.

TL;DR: A frequency-domain method is presented for the prediction of the characteristics of moire patterns in sampled halftone pictures and it is demonstrated that conventional efficient coding methods such as run length coding are not particularly suitable for halftones.

TL;DR: Run length encoding seems to be superior for pictures of high detail and significant increase in compaction ratios is not achieved till one uses polygonal approximations of boundaries, if then.

TL;DR: A program is described for recovering the postulated representation of shape from simple closed boundaries and the results and implications for simulating human shape perception are briefly discussed.

TL;DR: The new technique is based on the use of preprocessing procedures for determining the existence of "primitive" properties and relations which hold for or between objects in a picture and the unique application of the rules to a sequence of thresholded versions of the input picture.

TL;DR: The textural aspects of the gray-scale character sets, picture normalization, simplicity of operation, and efficient machine utilization are investigated in the use of the lineprinter.

TL;DR: A solution to the Swimmer Problem is described in this note and the result can be applied to the locating of boundary curves in automated pictorial information processing.

TL;DR: This paper describes a system which applies interactive computer graphics to the drafting of highly complex telephone office engineering drawings, and the characteristics of the problem and its solution are outlined.

TL;DR: Two digital methods for data compression of gray tone pictures of human faces by dividing the picture into many sub pictures and transmitting the statistics of the subpictures, assuming a uniform or truncated gaussian distribution for the video values are presented.

TL;DR: A program for automatic analysis of wheat chromosomes is presented whose last stage recognizes homologous pairs by means of an optimal matching procedure in the pattern space.