Hierarchical Image Analysis Using Irregular Tessellations

Abstract

In this paper we have presented an image analysis technique in which a separate hierarchy is built over every compact object of the input. The approach is made possible by a stochastic decimation algorithm which adapts the structure of the hierarchy to the analyzed image. For labeled images the final description is unique. For gray level images the classes are defined by converging local processes and slight differences may appear. At the apex every root can recover information about the represented object in logirhtmic number of processing steps, and thus the adjacency graph can become the foundation for a reulational model of the scene.

Cite

Text

Montanvert et al. "Hierarchical Image Analysis Using Irregular Tessellations." European Conference on Computer Vision, 1990. doi:10.1007/BFB0014847

Markdown

[Montanvert et al. "Hierarchical Image Analysis Using Irregular Tessellations." European Conference on Computer Vision, 1990.](https://mlanthology.org/eccv/1990/montanvert1990eccv-hierarchical/) doi:10.1007/BFB0014847

BibTeX

@inproceedings{montanvert1990eccv-hierarchical,
  title     = {{Hierarchical Image Analysis Using Irregular Tessellations}},
  author    = {Montanvert, Annick and Meer, Peter and Rosenfeld, Azriel},
  booktitle = {European Conference on Computer Vision},
  year      = {1990},
  pages     = {28-32},
  doi       = {10.1007/BFB0014847},
  url       = {https://mlanthology.org/eccv/1990/montanvert1990eccv-hierarchical/}
}