Picture Segmentation by a Tree Traversal Algorithm

  • Steven L. Horowitz
    Computer Science Laboratory, Department of Electrical Engineering, Princeton University, Princeton, NJ
  • Theodosios Pavlidis
    Computer Science Laboratory, Department of Electrical Engineering, Princeton University, Princeton, NJ

書誌事項

公開日
1976-04
権利情報
  • https://www.acm.org/publications/policies/copyright_policy#Background
DOI
  • 10.1145/321941.321956
公開者
Association for Computing Machinery (ACM)

この論文をさがす

説明

<jats:p>In the past, picture segmentation has been performed by merging small primitive regions or by recursively splitting the whole picture. This paper combines the two approaches with significant increase in processing speed while maintaining small memory requirements. The data structure is described in detail and examples of implementations are given.</jats:p>

収録刊行物

  • Journal of the ACM

    Journal of the ACM 23 (2), 368-388, 1976-04

    Association for Computing Machinery (ACM)

被引用文献 (13)*注記

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ