Fast computation of morphological area pattern spectra

  title={Fast computation of morphological area pattern spectra},
  author={Arnold Meijster and Michael H. F. Wilkinson},
An area based counterpart of the binary structural opening spectra is developed. It is shown that these area opening and closing spectra can be computed using an adaptation of Tarjan’s union-find algorithm. These spectra provide rotation, translation, and scale invariant pattern vectors for texture analysis. 

From This Paper

Figures, tables, and topics from this paper.
11 Citations
11 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 11 references

Fast grayscale granulometry algorithms , ” in

  • J. Serra, P. Soille
  • ISMM ’ 94 , Mathematical Morphology and its…
  • 1996

An efficient algorithm for morphological area operators

  • A. Meijster, M.H.F. Wilkinson
  • Tech. Rep. 99-9-07, Institute for Mathematics and…
  • 1994
2 Excerpts

Similar Papers

Loading similar papers…