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

TL;DR: It is shown that skeletons can be produced by simple procedures and since these are based on Euclidean distances it is assumed that they are superior to skeletons based on d4−, d8−, and even octagonal metrics.

TL;DR: In this article, a set of color features, (R + G + B) 3, R − B, and (2G − R− B) 2, were derived by systematic experiments of region segmentation.

TL;DR: In this paper, a technique of edge detection and line finding for linear feature extraction is described, where edge detection is by convolution with small edge-like masks, and the resulting output is thinned and linked by using edge positions and orientations and approximated by piecewise linear segments.

TL;DR: Oct-Trees are developed as a three-dimensional analog of quad-trees to be used in geometric modeling and space planning and a fast algorithm is given for 90° rotation of oct-tree representations of objects.

TL;DR: The new algorithms resulting from the new theory lead to a unification of the display model, the analysis model, and other needed models into a single geometric model from which other necessary models are easily derived.

TL;DR: This paper presents a technique for normalizing Fourier descriptors which retains all shape information, and is computationally efficient, and combined with certain others relating to accurate contour representation in a complete three-dimensional aircraft recognition algorithm.

TL;DR: A statistical approach to finding those spatial (or other) relations that best capture the structure of textures when the co-occurrence matrix representation is used is presented.

TL;DR: In this article, the authors introduce a characterization of skeletal pixels in terms of how many arcs of the boundary pass through a pixel and a new algorithm is proposed which proceeds by peeling off successive contours of the set to be thinned while identifying pixels where disjoint parts of boundary have been mapped.

TL;DR: An algorithm that generates an MRF on a finite toroidal square lattice from an independent identically distributed (i.i.d.) array of random variables and a given set of independent real-valued statistical parameters is presented.

TL;DR: In this article, a unified view of edge and region analysis is provided based on the sloped-facet model which assumes that regions of image segments are maximal areas which are sloped planes.

TL;DR: The intrinsic economy of a human retina-like structure is demonstrated in terms of an optimum compromise among large visual field, acceptable resolution, and information reduction, in the scene analysis of man-oriented environments.

TL;DR: In this paper, a self-contained review of the perspective transformation governing 2D images taken of a 3D world is presented, using coordinates of points, direction cosines of lines on the image, or 3D models of objects.

TL;DR: An algorithm is presented for constructing a quadtree from the array representation of a binary image that examines each pixel in the image once and only once, and never requires temporary nodes.

TL;DR: To mathematically verify that the features used with the SGLDM can be used to characterize the unit pattern and placement rules of a periodic texture, a mathematical tiling theory model is proposed and allows one to develop the mathematical machinery necessary to prove the result.

TL;DR: A model of image understanding is presented to provide a paradigm in which the problem of region segmentation can be discussed, and the importance of exploiting the physical level of knowledge, the bridge between a picture and a scene, is emphasized.

TL;DR: The local property-counting techniques used with an array representation are generalized to counting local node configurations in a quadtree and the average running time of the algorithm is proportional to the product of the number of the leaf nodes in the quadtree.

TL;DR: In this article, a split-and-merge algorithm is used for image segmentation, where the regions of an arbitrary initial segmentation are tested for uniformity and if not uniform they are subdivided into smaller regions, or set aside if their size is below a given threshold.

TL;DR: In this paper, the B-spline surface formulation is used to describe a surface initially defined by a completely specified network of points to be interpolated, and an appropriate set of control vertices which will generate an interpolating surface can be determined by solving a set of simultaneous linear equations.

TL;DR: The main theorems which govern random set theory are presented by studying one particular random set, namely the Boolean model, and how Boolean sets may be handled in view of constructing more sophisticated models (tessellations, n-phased sets, hierarchical sets, etc.).

TL;DR: Tree- and pyramid-type data structures are described which may be used for storing and processing binary images that have been sampled on a hexagonal grid, and the “septtree”, formed with 7 branches per node, promises to be particularly interesting since each node “covers” a roughly hexagonal region of the image.

TL;DR: A survey of statistical models that have led to restoration methods which overcome to various degrees the ill-conditioned nature of the Inversion of the image formation equation.

TL;DR: This is the first texture model to be implemented in hardware in a real-time image generation system and designed specifically for the purpose of image analysis and synthesis.

TL;DR: This chapter reviews stochastic boundary estimation and object recognition and includes analysis of limiting boundary estimation accuracy; tools for partially analyzing algorithm accuracy; insights into algorithm design based on experimentation and on use of these tools.

TL;DR: A C1 vector-valued interpolation scheme for a triangle is described which is compatible with Coons' rectangular interpolation patches and could be useful in the field of computer-aided geometric design.

TL;DR: The Markov Mesh model is more useful for the generation of images than in the estimation of image parameters for the classification of real images, for which other simpler procedures seem to work equally well or better as mentioned in this paper.

TL;DR: Handwritten words are read by applying hierarchical relaxation labeling procedures to a hierarchical description of the word it reads, which is contextually disambiguated and thus simplified by the application of relaxation procedures.

TL;DR: This chapter discusses the problem of detecting edges in cellular textures, an important first step in the solution of many image analysis tasks and depends on the reliability with which edges can be detected in textures.

TL;DR: The error-correcting technique is combined with the primitive-extraction-embedding parser to recognize partially distorted shapes and the recognition of several distorted airplane shapes is demonstrated.

TL;DR: A variety of transforms based on local operators have been successfully employed on images of medical importance, principally as an aid to scene segmentation, and two of the most general purpose transforms—median smoothing and extremum sharpening—are described in detail.

TL;DR: This paper shows how a simple label propagation technique, in conjunction with some novel ideas about how labels can be applied to an image to express semantic knowledge, leads to the simplification of a number of diverse and difficult image analysis tasks.