A Discrete Version of Green's Theorem
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 di...
| Veröffentlicht in: | IEEE transactions on pattern analysis and machine intelligence. - 1979. - 4(1982), 3 vom: 01. März, Seite 242-9 |
|---|---|
| 1. Verfasser: | |
| Format: | Aufsatz |
| Sprache: | English |
| Veröffentlicht: |
1982
|
| Zugriff auf das übergeordnete Werk: | IEEE transactions on pattern analysis and machine intelligence |
| Schlagworte: | Journal Article |
| Zusammenfassung: | 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 |
|---|---|
| Beschreibung: | Date Completed 02.10.2012 Date Revised 12.11.2019 published: Print Citation Status PubMed-not-MEDLINE |
| ISSN: | 1939-3539 |