Computing Perimeters of Regions in Images Represented by Quadtrees
- 1 November 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Pattern Analysis and Machine Intelligence
- Vol. PAMI-3 (6), 683-687
- https://doi.org/10.1109/tpami.1981.4767171
Abstract
An algorithm is presented for computing the total perimeter of a region in a binary image represented by a quadtree. The algorithm explores each segment of the boundary of the region once and only once. Analysis of the algorithm shows that its average execution time is proportional to the number of leaf nodes in the quadtree.This publication has 9 references indexed in Scilit:
- Connected Component Labeling Using QuadtreesJournal of the ACM, 1981
- Region representationCommunications of the ACM, 1980
- Region representationCommunications of the ACM, 1980
- Linear transformation of pictures represented by quad treesComputer Graphics and Image Processing, 1979
- Operations on Images Using Quad TreesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1979
- Organization and Access of Image Data by AreasIEEE Transactions on Pattern Analysis and Machine Intelligence, 1979
- Experiments on picture representation using regular decompositionComputer Graphics and Image Processing, 1976
- Computer Processing of Line-Drawing ImagesACM Computing Surveys, 1974
- PATTERNS AND SEARCH STATISTICS**Research sponsored by the Air Force Office of Scientific Research, Office of Aerospace Research, USAF, under Grant No. AFOSR 70-1915 and the National Science Foundation under Grant No. NSF-GK-4827. The United States Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copywright notation herein.Published by Elsevier BV ,1971