A Discrete Version of Green's Theorem
- 1 May 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4 (3) , 242-249
- https://doi.org/10.1109/tpami.1982.4767241
Abstract
We formulate a discrete version of Green's theorem such that a summation of a two-dimensional function over a discrete region can be evaluated by the use of a summation over its discrete boundary. In many cases, the discrete Green theorem can result in computational gain. Applications of the discrete Green theorem to several typical image processing problems are demonstrated. We also apply it to analyze shapes of particle aggregates of Fe2O3. Experimental results of the shape study are presented.Keywords
This publication has 4 references indexed in Scilit:
- Computer Processing of Line-Drawing ImagesACM Computing Surveys, 1974
- Representation of contours and regions for efficient computer searchCommunications of the ACM, 1973
- Arcs and Curves in Digital PicturesJournal of the ACM, 1973
- Connectivity in Digital PicturesJournal of the ACM, 1970