Chapter 11 – Representation

Publisher Summary Segmentation decomposes a picture into subsets or regions. The geometrical properties of these subsets—connectedness, size, shape—are often important in picture description. There are many methods of measuring such properties; the preferred method usually depends on how the subsets are represented. This chapter discusses various representation schemes and their application to geometric property measurement. Each row of a picture consists of a sequence of maximal runs of points such that the points in each run all have the same value. Thus, the row is completely determined by specifying the lengths and values of these runs. The run length coding is sometimes used for picture compression. The set of centers and radii (and values) of the maximal blocks is called the medial axis (or symmetric axis) transformation. It also explains that the maximal connected regions of constant value are analogous to runs; however, they are not good primitive elements for representation purposes as they themselves cannot be specified compactly; a block, on the other hand, is defined by specifying its center and radius.

[1]  Kenneth Steiglitz,et al.  Operations on Images Using Quad Trees , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Azriel Rosenfeld,et al.  Piecewise Approximation of Pictures Using Maximal Neighborhoods , 1978, IEEE Transactions on Computers.

[3]  L Lipkin,et al.  The circle transform, an articulable shape descriptor. , 1977, Computers and biomedical research, an international journal.

[4]  Azriel Rosenfeld,et al.  Angle Detection on Digital Curves , 1973, IEEE Transactions on Computers.

[5]  Hannan Samet,et al.  Region representation: Quadtrees from binary arrays , 1980 .

[6]  Larry S. Davis,et al.  A Corner-Finding Algorithm for Chain-Coded Curves , 1977, IEEE Transactions on Computers.

[7]  Larry S. Davis,et al.  Understanding Shape: Angles and Sides , 1977, IEEE Transactions on Computers.

[8]  Giorgio Levi,et al.  A Grey-Weighted Skeleton , 1970, Inf. Control..

[9]  Charles R. Dyer,et al.  Experiments on Picture Representation Using Regular Decomposition , 1976 .

[10]  C. V Kameswara Rao,et al.  A parallel shrinking algorithm for binary patterns , 1976 .

[11]  Azriel Rosenfeld,et al.  An Improved Method of Angle Detection on Digital Curves , 1975, IEEE Transactions on Computers.

[12]  Carlo Arcelli A condition for digital points removal , 1979 .

[13]  S. Nishikawa,et al.  Area properties of television pictures , 1965, IEEE Trans. Inf. Theory.

[14]  Azriel Rosenfeld,et al.  A Note on the Use of Local MIN and MAX Operations in Digital Picture Processing , 1977 .

[15]  Hanan Samet,et al.  Computing Perimeters of Images Represented by Quadtrees , 1979 .

[16]  Azriel Rosenfeld,et al.  Curve Segmentation by Relaxation Labeling , 1977, IEEE Transactions on Computers.

[17]  G. M. Hunter,et al.  Linear transformation of pictures represented by quad trees , 1979 .

[18]  E. V. Krishnamurthy,et al.  On the compactness of subsets of digital pictures , 1978 .

[19]  A. ROSENFELD,et al.  Distance functions on digital pictures , 1968, Pattern Recognit..

[20]  Ramakant Nevatia,et al.  Description and Recognition of Curved Objects , 1977, Artif. Intell..

[21]  C. Dyer Computing the Euler number of an image from its quadtree , 1980 .

[22]  Azriel Rosenfeld,et al.  Region representation: boundary codes from quadtrees , 1980, CACM.

[23]  Azriel Rosenfeld,et al.  A Characterization of Parallel Thinning Algorithms , 1975, Inf. Control..

[24]  Herbert Freeman,et al.  Computer Processing of Line-Drawing Images , 1974, CSUR.

[25]  Azriel Rosenfeld Compact Figures in Digital Pictures , 1974, IEEE Trans. Syst. Man Cybern..

[26]  Azriel Rosenfeld,et al.  A Note on Thinning , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[27]  Azriel Rosenfeld,et al.  Computer representation of planar regions by their skeletons , 1967, CACM.

[28]  M. Shneier Calculations of geometric properties using quadtrees , 1981 .

[29]  Robert S. Ledley,et al.  BUGSYS: a programming system for picture processing—not for debugging , 1966, CACM.

[30]  Wallace S. Rutkowski,et al.  Measurement of the lengths of digitized curved lines , 1979 .

[31]  Azriel Rosenfeld,et al.  Sequential Operations in Digital Picture Processing , 1966, JACM.

[32]  Azriel Rosenfeld,et al.  A region coloring technique for scene analysis , 1973, CACM.

[33]  Herbert A. Glucksman A Parapropagation Pattern Classifier , 1965, IEEE Trans. Electron. Comput..

[34]  Theodosios Pavlidis,et al.  A review of algorithms for shape analysis , 1978 .

[35]  Robert M. Haralick,et al.  A Measure for Circularity of Digital Figures , 1974, IEEE Trans. Syst. Man Cybern..

[36]  Robert B Eberlein,et al.  An iterative gradient edge detection algorithm , 1976 .

[37]  AZRIEL ROSENFELD,et al.  Digital Straight Line Segments , 1974, IEEE Transactions on Computers.

[38]  Patrick Henry Winston,et al.  Learning structural descriptions from examples , 1970 .

[39]  Richard L. Grimsdale,et al.  A system for the automatic recognition of patterns , 1959 .

[40]  Hanan Samet,et al.  Region representation: quadtrees from boundary codes , 1980, CACM.

[41]  L. Hodes Discrete Approximation of Continuous Convex Blobs , 1970 .

[42]  Azriel Rosenfeld,et al.  Thinning Algorithms for Gray-Scale Pictures , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[43]  Hanan Samet,et al.  Connected Component Labeling Using Quadtrees , 1981, JACM.

[44]  Ian T. Young,et al.  An Analysis Technique for Biological Shape. I , 1974, Inf. Control..

[45]  Hanan Samet,et al.  An Algorithm for Converting Rasters to Quadtrees , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[46]  Nikitas A. Alexandridis,et al.  Picture decomposition, tree data-structures, and identifying directional symmetries as node combinations , 1978 .

[47]  Larry S. Davis,et al.  Computational Models of Space: Isovists and Isovist Fields , 1979 .

[48]  Hanan Samet,et al.  Computing Perimeters of Regions in Images Represented by Quadtrees , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[49]  Denis Rutovitz,et al.  An Algorithm for In-Line Generation of a Convex Cover , 1975 .

[50]  HARRY BLUM,et al.  Shape description using weighted symmetric axis features , 1978, Pattern Recognit..

[51]  Stephen B. Gray,et al.  Local Properties of Binary Images in Two Dimensions , 1971, IEEE Transactions on Computers.

[52]  Russell A. Kirsch,et al.  Resynthesis of Biological Images from Tree-Structured Decomposition Data , 1972 .

[53]  Ugo Montanari,et al.  Continuous Skeletons from Digitized Images , 1969, JACM.

[54]  D. Proffitt,et al.  Metrication errors and coding efficiency of chain-encoding schemes for the representation of lines and edges , 1979 .

[55]  Herbert Freeman,et al.  Determining the minimum-area encasing rectangle for an arbitrary closed curve , 1975, CACM.

[56]  Jack Sklansky,et al.  Recognition of convex blobs , 1970, Pattern Recognit..

[57]  Stig Nordbeck,et al.  Computer cartography point-in-polygon programs , 1967 .

[58]  Luigi P. Cordella,et al.  Parallel Detection of Concavities in Cellular Blobs , 1976, IEEE Transactions on Computers.

[59]  Stefano Levialdi,et al.  On shrinking binary picture patterns , 1972, CACM.

[60]  Roger L.T. Cederberg Chain-link coding and segmentation for raster scan devices , 1978 .