Linear time algorithms for visibility and shortest path problems inside simple polygons
SCG '86 Proceedings of the second annual symposium on Computational geometry
Introduction to algorithms
Combining frequency and spatial domain information for fast interactive image noise removal
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
| Hi-index | 0.01 |
In high-quality image printing it is sometimes required to repair flaws contained in a given image. A simple wayfor such repair is to paste a flaw region with white and then to move those pixels in the neighborhood byu sing a tool called an copy-brush. Since it is a very fine operation, it causes great effort to human operators. It is not easy to automate this operation in the existing matrix representation of an image. In our geometric representation of an image as a collection of contour lines for intensity levels this problem is naturally defined as one of reconnecting those contour lines disconnected by a flaw region. An efficient algorithm for reconnecting contour lines is presented based on perfect matching and observations on geometric properties of interconnection paths.