Morphological skeleton representation and coding of binary images

  title={Morphological skeleton representation and coding of binary images},
  author={Petros Maragos and Ronald W. Schafer},
  journal={IEEE Trans. Acoust. Speech Signal Process.},
  • P. MaragosR. Schafer
  • Published 1 March 1984
  • Computer Science
  • IEEE Trans. Acoust. Speech Signal Process.
This paper presents the results of a study on the use of morphological set operations to represent and encode a discrete binary image by parts of its skeleton, a thinned version of the image containing complete information about its shape and size. Using morphological erosions and openings, a finite image can be uniquely decomposed into a finite number of skeleton subsets and then the image can be exactly reconstructed by dilating the skeleton subsets. The morphological skeleton is shown to… 

Skeleton-based morphological coding of binary images

New properties of the discrete morphological skeleton representation of binary images are presented, along with a novel coding scheme for lossless binary image compression that is based on these properties and substantially improves the results obtained by previous skeleton-based coders, and performs better than classical coders.

Morphological representation of discrete and binary images

A unified theory is developed for the mathematical description of the morphological skeleton decomposition of discrete and binary images through repeated erosions and set transformations.

Skeletonization via vertices of morphologically decomposed subsets

This paper shows that images can be decomposed into a series of homotopic subsets by means of morphological erosions using a series of disk-like structuring elements, and the skeleton can be obtained

Binary morphological coding of grayscale images

The authors propose a novel image coding method, with an important difference; instead of segment boundaries, morphological skeletons are used to represent the segments of the gray-scale image.

Morphological Shape Representation And Recognition Of Binary Images

A fast shape recognition scheme based on morphological set operations and skeleton function, exploiting prototype skeletons as structuring elements and the concept of minimal skeleton is proposed.

Morphological skeletonization for medical image compression

The compression ratio is calculated for the evaluation of a new data compression technique using a sample radiograph and illustrates that a compression ratio of 1.72 can be achieved through the use of morphological skeleton representation.


Algorithms identifying image topology in terms of critical scales corresponding to close-hulls and open-skulls, along with a few other salient characteristics, are developed as respective smoothing by expansion and contraction proceeds.

Spatially Variant Morphological Restoration and Skeleton Representation

Experimental results show the dramatic improvement in the performance of the SV Morphological restoration and SV morphological skeleton representation algorithms in comparison to their translation-invariant counterparts.

On the Properties of Morphological Skeletons of Discrete Binary Image Using Double Structuring Elements

  • M. Ito
  • Geography
    2006 IEEE Southwest Symposium on Image Analysis and Interpretation
  • 2006
This paper discusses the properties of the morphological skeletons of a discrete binary image using double structuring elements. Skeletons are generated under the main structuring element and the sub

Skeletonization And Distance Transformation By Greyscale Morphology

The distance transformation, skeletonization, and reconstruction algorithms using the greyscale morphology approach are described and proven to be remarkably simple.



Image Analysis and Mathematical Morphology

This invaluable reference helps readers assess and simplify problems and their essential requirements and complexities, giving them all the necessary data and methodology to master current theoretical developments and applications, as well as create new ones.

Computer representation of planar regions by their skeletons

Any region can be regarded as a union of maximal neighborhoods of its points, and can be specified by the centers and radii of these neighborhoods; this set is a sort of "skeleton" of the region. The

A Note on the Use of Local MIN and MAX Operations in Digital Picture Processing

Shrinking and expanding operations on two-valued digital pictures are useful for noise removal, as well as for detecting dense regions and elongated parts of objects and may be easier to select after these operations have been performed.

Progressive image transmission using a growth-geometry coding

A growth-geometry coding of bilevel images for transmission over low-capacity channels in a progressive fashion indicates this approach has the potential for desirable visual presentation, with relatively high coding efficiency and economical implementation.

A Method for Obtaining Skeletons Using a Quasi-Euclidean Distance

The problem of obtaining the skeleton of a digitized figure is reduced to an optimal policy problem. A hierarchy of methods of defining the skeleton is proposed; in the more complicated ones, the

Biomedical Image Processing

For the last five years, the University of Michigan and the Environmental Research Institute of Michigan have conducted a unique series of studies that involve the processing of biomedical imagery on a highly parallel computer specifically designed for image processing, finding that quantification by automated image analysis not only increases diagnostic accuracy but also provides significant data not obtainable from qualitative analysis alone.

A unification of linear, median, order-statistics and morphological filters under mathematical morphology

  • P. MaragosR. Schafer
  • Mathematics
    ICASSP '85. IEEE International Conference on Acoustics, Speech, and Signal Processing
  • 1985
This paper presents a summary of a unified theory, based upon mathematical morphology, of all translation-invariant and increasing systems, that every such system can be uniquely represented by the minimal elements of its kernel and realized as a minimal combination of morphological erosions.

Parallel architectures for image processing

The process of creative visualization is of pictures as a whole, and conventional computer image processing could be broadly categorized as manipulation of pixel states rather than pictorial content.

Novel method for analysis of printed circuit images

A method is described which is a synthesis of the reference-comparison and the generic-property approaches that exploits their respective strengths and overcomes their respective weaknesses based on the observation that the local geometric and global topological correctness of a printed circuit can be inferred from the correctness of simplified, skeletal versions of the circuit in a test image.