Name
Abstract | ||
|---|---|---|
A method for filling a region whose boundary is represented by the Freeman code is presented. The method makes use of the discrete Green theorem. There is no application limitation on the proposed method. This method can also be generalized to cover a wider range of problems where the boundary is not limited to be in the form of the Freeman code, as long as the boundary is to be represented in sequence. The method is applied in an image cut-and-paste program. Comparison of the proposed method and some existing methods is also provided. |
Year | DOI | Venue |
|---|---|---|
1988 | 10.1016/S0734-189X(88)80040-9 | Computer Vision, Graphics and Image Processing |
Keywords | Field | DocType |
discrete green theorem,region filing | Mathematical optimization,Algebra,Green's theorem,Algorithm,Image processing,Singular boundary method,Mathematics | Journal |
Volume | Issue | ISSN |
42 | 3 | Computer Vision, Graphics and Image Processing |
Citations | PageRank | References |
14 | 1.81 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gregory Y. Tang | 1 | 58 | 11.46 |
| Brian Lien | 2 | 14 | 1.81 |